Page 227 - DCAP603_DATAWARE_HOUSING_AND_DATAMINING
P. 227

Unit 11: Query Processing and Optimization




          11.8 self assessment                                                                  notes

          Choose the appropriate answers:

          1.   RDBMS stands for
               (a)   Relative Database Management System
               (b)   Relational Database Management System
               (c)   Relative Document Management System
               (d)   Relational Document Management System

          2.   DML stands for
               (a)   Data Manipulation Language
               (b)   Data Multiplication Language
               (c)   Dynamic Multipurpose Language
               (d)   Data Manipulation Logic

          Fill in the blanks:
          3.   Cost is generally measured as total elapsed time for answering the .........................
          4.   The I/O cost depends on the .........................
          5.   .........................  is applicable when the selection is an equality comparison on the attribute
               on which file is ordered.
          6.   .........................  search  retrieves  a  single  record  that  satisfies  the  corresponding  equality
               condition.

          7.   ......................... use equivalence rules to systematically generate expressions equivalent to
               the given expression.
          8.   ......................... is applied only in parallel query plans in which hash or merge joins are
               used.
          9.   Data warehouse handles the large ......................... information.
          10.   The  RID  index  technique  is  one  of  the  traditional  index  techniques  used  in  the
               .........................

          11.9 review Questions

          1.   What do you mean by query processing? Explain.
          2.   Describe BitMap Index technique description with the help of an example.
          3.   Explain cost model in detail with any live example.

          4.   “A new reliable and faster query processing technique will greatly enhance the performance
               of data warehousing processes”. Explain.
          5.   “Optimized bitmap filtering is applicable only to parallel query plans in which hash joins
               are used.” Discuss.
          6.   How will you write your own queries? Explain.
          7.   Describe relational model with the help of suitable example.






                                           LoveLy professionaL university                                   221
   222   223   224   225   226   227   228   229   230   231   232