tag:blogger.com,1999:blog-6705357907459468226.post-55566004814781912982014-12-16T10:02:00.000+05:302014-12-16T10:02:57.921+05:3015 Top Latest Operational Data Store Interview Questions and Answers<div dir="ltr" style="text-align: left;" trbidi="on">Below are the List of Top 15 Operational Data Store Interview Questions and Answers pdf for freshers and experienced free download.<br /><br /><h3 style="text-align: left;"><b><u><span style="color: blue; font-size: large;">Operational Data Store Interview Questions and Answers</span></u></b></h3><br /><b id="Explain_normalization">1.Explain normalization? </b><br />It is a process of analysing the given relation schemas based on their Functional Dependencies (FDs) and primary key to achieve the properties<br /><br /><ul style="text-align: left;"><li>Minimizing redundancy</li><li>Minimizing insertion, deletion and update anomalies.</li></ul><br /><br /><b id="Explain_DDL_Data_Definition_Language">2.Explain DDL (Data Definition Language)? </b><br />A data base schema is specifies by a set of definitions expressed by a special language called DDL. <br /><br /><b id="Explain_Functional_Dependency">3.Explain Functional Dependency? </b><br />Functional dependency is denoted by X --> Y between two sets of attributes X and Y that are subsets of R specifies a constraint on the possible tuple that can form a relation state r of R. The constraint is for any two tuples t1 and t2 in r if t1[X] = t2[X] then they have t1[Y] = t2[Y]. This means the value of X component of a tuple uniquely determines the value of component Y. <br /><br /><b id="What_is_a_functional_dependency_F_said_to_be_minimal">4.What is a functional dependency F said to be minimal? </b><br /><br /><ol style="text-align: left;"><li>Every dependency in F has a single attribute for its right hand side.</li><li>It cannot replace any dependency X -->A in F with a dependency Y--> A where Y is a proper subset of X and still have a set of dependency that is equivalent to F.</li><li>We cannot remove any dependency from F and still have set of dependency that is equivalent to F.</li></ol><br /><b id="Explain_a_Relation_Schema_and_a_Relation">5.Explain a Relation Schema and a Relation?</b><br />A relation Schema denoted by R(A1, A2, ?, An) is made up of the relation name R and the list of attributes Ai that it contains. A relation is defined as a set of tuples. Let r be the relation which contains set tuples (t1, t2, t3, ..., tn). Each tuple is an ordered list of n-values t=(v1,v2, ..., vn). <br /><br /><b id="What_is_operational_data_store">6.What is operational data store? </b><br />An operational data store (or "ODS") is a database designed to integrate data from multiple sources to make analysis and reporting easier. <br /><br /><b id="What_is_a_Relationship">7.What is a Relationship? </b><br />It is an association among two or more entities.<br /><br />Relationship Set - The collection (or set) of similar relationships.<br /><br />Relationship Type - Relationship type defines a set of associations or a relationship set among a given set of entity types.<br /><br />Degree of Relationship Type - It is the number of entity type participating. <br /><br /><b id="Tell_me_what_is_degree_of_a_Relation">8.Tell me what is degree of a Relation? </b><br />It is the number of attribute of its relation schema. <br /><br /><b id="Explain_Multivalued_dependency">9.Explain Multivalued dependency? </b><br />Multivalued dependency denoted by X-->Y specified on relation schema R, where X and Y are both subsets of R, specifies the following constraint on any relation r of R: if two tuples t1 and t2 exist in r such that t1[X] = t2[X] then t3 and t4 should also exist in r with the following properties<br /><br /><ul style="text-align: left;"><li>t3[x] = t4[X] = t1[X] = t2[X]</li><li>t3[Y] = t1[Y] and t4[Y] = t2[Y]</li><li>t3[Z] = t2[Z] and t4[Z] = t1[Z]</li></ul><br />where [Z = (R-(X U Y)) ]<br /><br /><b id="What_is_VDL_View_Definition_Language_explain">10.What is VDL (View Definition Language) explain? </b><br />It specifies user views and their mappings to the conceptual schema. <br /><br /><b id="Explain_How_does_Tuple-oriented_relational_calculus_differ_from_domain-oriented_relational_calculus">11.Explain How does Tuple-oriented relational calculus differ from domain-oriented relational calculus? </b><br />The tuple-oriented calculus uses a tuple variables i.e., variable whose only permitted values are tuples of that relation. E.g. QUEL<br /><br />The domain-oriented calculus has domain variables i.e., variables that range over the underlying domains instead of over relation. E.g. ILL, DEDUCE. </div>iqs pdfhttps://plus.google.com/114623642748522820843noreply@blogger.com