Database System Implementation

Range of Quiz 2
1. file organization optimize block access time by organizing the blocks to correspond to how data will be accessed 2. heap file organization a record can be placed anywhere in the file where there is space 3. sequential file organization store records in sequential order, based on the value of the search key of each recordhashing file organization 4. multiple clustering file organization records of several different relations can be stored in the same file 5. data dictionary or system catalog A set of system catalog tables is created and maintained for each database. These tables contain information about the definitions of the database objects 6. Indexing Indexing mechanisms used to speed up access to desired data. An index file consists of records of the form and they are typically much smaller than the original file. 7. Hashing the transformation of a string of characters into a usually shorter fixed-length value or key that represents the original string. Hashing is used to index and retrieve items in a database 8. static hashing These pages containing the data can be viewed as a collection of buckets, with one primary page and possibly additional overflow pages per bucket. 9. dynamic hashing It deal with inserts and deletes gracefully. It does not require a dictionary, deals naturally with collisions and offers a lot of flexibility with respect to the timing of bucket splits. 10. hash index organization search keys are distributed uniformly across buckets using a hash function. 11. bucket overflow and overflow bucket Bucket overflow is a kind of data overflow that caused by insufficient bucket and skew in distributed data; While the Overflow bucket is a kind of method that used to handling the bucket overflow. 12. Skew It is the uneven distribution of otherwise evenly distributed data across a number of devices while the data is in transition. Can caused by multiple records have the same search-key value and the chosen hash function produces non-uniform distribution of key value. 13. extendable hashing a type of hash system which treats a hash as a bit string, and uses a trie for bucket lookup 14. ordered index

14th October, 2011

Database System Implementation

search keys are stored in sorted order 15. clustering index It in a sequentially ordered file, the index whose search key specifies the sequential order of the file. The search key of a primary index is usually but not necessarily the primary key. 16. non-clustering index An index whose search key specifies an order different from the sequential order of the file. 17. primary index in a sequentially ordered file, the index whose search key specifies the sequential order of the file. Also called Clustering index. 18. dense index Index record appears for every search-key value in the file. 24. Bitmap: it is a graphical object used to create, manipulate (scale, scroll, rotate, and paint), and store images as files on a disk. 25. bit map index: Bitmap indexes are also useful for unique valued data which is not updated frequently; Bitmap indexes have traditionally been considered to work well for data such as gender; Bitmap indexes are also useful in data warehousing applications for joining a large fact table to smaller dimension tables[2] such as those arranged in a star schema. 26. bit map operations 27. composite key: A composite key is a primary key that consists of more than one column 28. B+-tree index: B+ Tree indexing maintain efficiency despite insertion and deletion of data. 29. balanced tree: A balanced tree is a tree which is balanced - it has roughly the same height on each of its sub-nodes. A balanced tree will have the lowest possible overall height. 30. range query: A range query is a common database operation that retrieves all records where some value is between an upper and lower boundary. 31. B-tree index B-tree allows search-key values to appear only once; eliminates redundant storage of search keys. 32. parsing and translation Parser checks syntax, verifies relations, translate the query into its internal form. This is then translated into relational algebra. 33. relational algebra: Relational algebra, an offshoot of first-order logic (and of algebra of sets), deals with a set of finitary relations (see also relation (database)) that is closed under certain operators 34. query execution engine: query execution engine to execute query plans for select, insert, delete, and update statements 35. Optimization: Query optimization is a function of many relational database management systems in which multiple query plans for satisfying a query are examined and a good query plan is identified 36. Evaluation The query-execution engine takes a query-evaluation plan, executes that plan, and returns

14th October, 2011

Database System Implementation

the answers to the query. 37. evaluation primitive: a relational algebra expression annotated with instructions on how to evaluate it 38. query execution plan or query evaluation plan: a sequence of primitive operations that can be used to evaluate a query 39. access path: Access Path refers to the path chosen by the system to retrieve data after a structured query language (SQL) request is executed 40. file scan: The lowest-level operator to access data; Allows an entire relation to be read 41. query processing: The activities involved in extracting data from a database; Translation of queries in high-level database languages 42. index scan: search algorithms that use an index; Ordered indices permit access to tuples in a sorted order; Impose the overhead of access to blocks containing the index 43. hash join: The Hash join is an example of a join algorithm and is used in the implementation of a relational database management system 44. materialized evaluation Materialized view evaluation involves determining which of the existing materialized views can be used to compute all or parts of the query 45. operator tree: When a database engine (particularly an SQL-based engine) runs a query, it actually breaks down the query into little steps. Filter a bit here, join a table there, etc. A query operator tree is basically a representation of those steps 46. overflow resolution It is a method used to handle Hash-table overflow, and performed during the build phase. 47. overflow avoidance Overflow avoidance performs partitioning carefully to avoid overflows during build phase 48. pipelined evaluation: evaluate several operations simultaneously, passing the results of one operation on to the next 49. Hash file organization Predetermined and fixed file size Hash function is not purely increasing and can be an algorithm Hash function must be deterministic Resulting data order is not sequential or chronological

14th October, 2011