Download File Storage & Indexing Exam: A Guide to File Organizations, Indexing, and B+ Trees and more Exams Database Management Systems (DBMS) in PDF only on Docsity!
CMPT 454 L3 - File Storage and Indexing Exam
File Organizations Methods of arranging records in a file for efficient operations
Indices Data structures organizing data to improve record retrieval based on criteria
Tree based indexing Indexing method using tree structures for efficient data retrieval
Hash based indexing Indexing method using hash functions for quick data access
SELECT * FROM Customer SQL query to retrieve all data from the Customer table
Adjacent blocks Storing table data in neighboring disk blocks for efficient access
RAID Redundant Array of Independent Disks for data storage and retrieval
Disk I/O Reading from or writing to disk, typically in block units
Block Unit of data read from or written to disk, often 16 kilobytes
Data files Storage for records in a database, usually representing tables
File organization Method of arranging records in a file for efficiency
Heap files Unordered file structure where records are stored without specific order
Sorted file File with records arranged in order based on a sort key
Primary key Unique identifier for records in a table, identified by a UNIQUE constraint
Candidate key Field or set of fields that can uniquely identify records, not specified in table design
Superkey Key used to order a sequential file
Search key Key used to find records in an index
Secondary index Index where the search key is not the sort key of the file
Bucket Storage unit in an index containing pointers to matching records
Binary search Search algorithm for finding a target value within a sorted array
SQL Server Microsoft's relational database management system
B trees Data structure for organizing and storing data in a database
RID
Record ID, a unique identifier for records in a database
Secondary Indexes Additional indexes improving query efficiency with complex criteria
Indirection Process of collecting RIDs from buckets to intersect criteria
Boolean Attributes Attributes representing word presence in a document
Inverted Index Combination of document word indices using indirect buckets
B+ Trees Tree structure for multiple level indexes with balanced properties
Composite Search Keys Search keys containing multiple fields for equality searches
Bulk Loading Process of building index levels efficiently for future insertions
Search Key Compression
Node Splitting Process of splitting full leaf nodes in B+ trees
Leaf Node Occupancy Rules Requirements for the minimum number of key values in leaf nodes
B+ Tree Insertion Process of inserting records and maintaining order in the index pages
Root Creation Creating a new root node in B+ trees after insertion
Chain Nodes Linking new nodes to original nodes in B+ trees
Search Algorithm Algorithm to find records based on search keys in B+ trees
Range Searches Searching for values within a specified range in B+ trees
Leaf Node Data Data entries in leaf nodes matching record attribute values
Index Pages Pages in B+ trees maintaining values in order
Data File Records Records contained in leaf nodes of B+ tree indexes
Parent Interior Nodes Nodes containing pointers to new nodes in B+ tree insertion
Record Retrieval Process of finding and retrieving records based on search keys
Insert Adding a value to the tree structure.
Split Dividing a full node into two nodes.
Input/output operations on disk.
Overflow Pages Pages for duplicate values.
Search Key Value used to search in the tree.
Parent Node Node above the current node.
Tombstones Markers for deleted records.
Recursive Function calling itself.
Main Memory Fast-access memory.
Duplicate Values Repetitive entries in the tree.
Null Keys Empty key values.
Pointer Reference to another node.
New Keys Unique keys in the tree.
Hash Table Maps search key values to array elements
Hash Function Generates value between 0 and B-
Buckets Array elements storing data objects
Local Depth Number of bits used to determine bucket membership
Insert Record Adding data to the hash index
Split Block Dividing a full block into two
Adjust Pointers Updating pointers after block splitting
Double Directory Size Increasing the size of the directory
Bit Value Value of some attribute represented in bits
Blocking Factor
Number of entries that fit on a page
In-Memory Hash Table Bucket is a single array element or linked list
Hash Value Computed value used to access the directory
Sequence of Bits Used to determine directory access
Static Hashing Performance identical if directory fits in memory
Linear Hashing No directory, buckets stored sequentially
Bucket Splitting Occurs when average occupancy exceeds maximum
