Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Define the Query optimisation
The query parser commonly generates a standard initial tree to correspond to an SQL query, with no doing any optimization. Such type of a canonical query tree denotes a relational algebra expression that is extremely inefficient if executed directly. A query commonly has many possible execution strategies, and the process of choosing a appropriate one for processing a query is termed as query optimization. The major guidelines that are applied throughout query optimization are:
a. Combine a cascade of selections
b. Combine a cascade of projections
c. Commute selection and projection
d. Commuting selection with join / cartesian product Commuting projection with join or cartesian product
e. Commute projection with set operations
f. Commute selection with set operations
Give the two reasons for allowing concurrency
The result of the UNION operation between R1 and R2 is a relation that includes? The result of the operation between R1 and R2 includes all the tuples of R1 and R2 which have c
Support by Adding Indexes Multiple indexes can be used to access a data file by multiple access paths. In such a scheme only single copy of the data is consider, only the numbe
State The position of object at any moment is called state. An object can have many states depend upon time. After receiving some input instructions, the object can change its
What are the time stamps associated with each data item? W-timestamp (Q) denotes the largest time stamp if any transaction that implemented WRITE (Q) successfully. R-timesta
What is data definition language? Explain it in detail? The SQL DDL allows specification of not only a set of relations, but also information after each relation, containing
Which operation is used if we are interested in only certain columns of a table? PROJECTION operation is used if we are interested in only certain columns of a table.
Describe the static hash file with buckets and chaining and show how insertion, deletion and modification of a record can be performed. In static hash file organization, the wo
Explain the Dynamic Hashing Techniques There are two methods in it: extendible hashing - stores an access structure in addition to the file, and therefore is somewhat identica
Designing the fields in the data base The following are the considerations one has to remain in mind while designing the fields in the data base. Coding, compression, en
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd