Download as DOCX, PDF, TXT or read online from Scribd
Download as docx, pdf, or txt
You are on page 1/ 5
E-DATABASE MANAGEMENT SYSTEM
DIGITAL ASSIGNMENT -2
NAME: YUVASRI.R
REGISTER NO: 21BCS0082
COURSE CODE:
SLOT: 1.State the comparison and differences between Binary Search Tree (BST), BTrees, and B+ Trees in a tabular format.
Feature Binary Search Tree B-Tree B+ Tree
(BST) Node Structure Each node has a Each node can Each node can key, left child, and have multiple have multiple right child keys and keys and multiple children multiple children Balancing Not self-balancing Self-balancing Self-balancing Search Efficient for small Efficient for Efficient for datasets large datasets large datasets Insertion/Deletion Can lead to an More complex More complex unbalanced tree if due to balancing due to balancing not implemented requirements requirements carefully Operations Simple operations Complex Complex operations operations Efficiency Best-case search: Search, Search, O(log n) insertion, insertion, deletion: O(log deletion: O(log n) n) Memory Can be memory Memory Memory inefficient if efficient due to efficient due to unbalanced node packing node packing and leaf nodes Leaf Nodes Not necessarily at All leaf nodes at All leaf nodes at the same level the same level the same level Typical Use Simple databases, Database Database small datasets systems, systems, filesystems filesystems Examples Basic search trees Database Database in programming indexing indexing structures structures
Aspect Binary Search Tree B-Tree B+ Tree
(BST) Time Complexity Average: O(log n) Average: O(log n) Average: O(log n) Worst Case: O(n) Worst Case: O(log n) Worst Case: O(log n) Space Complexity O(n) Depends on order Depends on order and and number of keys number of keys Completeness Not self-balancing, Self-balancing, Self-balancing, may lead to skewed maintains balance maintains balance trees Optimal Use Cases Small data sets, Databases, File Databases, File where simplicity is Systems, Concurrent Systems, Concurrent preferred access requirements access requirements
2. Explain in detail on the role of BST, B-Tree, and B+ Tree on the databases. In physical database design, describe the Indexing, hashing on file systems and detail the working principles of BST, B-Tree, and B+ Trees with relevant database examples.
Role of BST, B-Tree, and B+ Tree in Databases:
Binary Search Tree (BST):
BSTs are commonly used in databases for indexing purposes. In a database context, an index is a data structure that allows for efficient retrieval of rows from a table based on the values of certain columns. In a BST-based index, each node represents a row in the table, and the key values are the indexed column values. This allows for fast lookup operations, especially for range queries and equality searches. However, traditional BSTs may become unbalanced with certain insertion and deletion patterns, leading to degradation in performance. Self-balancing BST variants like AVL trees or Red-Black trees can mitigate this issue.
B-Tree: B-Trees are widely used in database systems for indexing large datasets. They are particularly well-suited for storing and retrieving data efficiently on disk or other secondary storage devices. B-Trees maintain balance through a set of rules governing the structure of the tree, ensuring that all leaf nodes are at the same level and that nodes are well- distributed throughout the tree. In a B-Tree index, each node contains multiple keys and pointers, allowing for efficient disk access patterns. This makes B-Trees ideal for databases where data is stored on disk or other secondary storage devices.
B+ Tree: B+ Trees are a variant of B-Trees optimized for disk-based storage systems. They share many similarities with B-Trees but have certain differences in structure. In a B+ Tree, only leaf nodes contain actual data records, while internal nodes are used solely for indexing. This ensures that leaf nodes are densely packed with data records, improving disk I/O performance. B+ Trees also maintain a sorted linked list of leaf nodes, facilitating efficient range queries and sequential access. Indexing and Hashing in Physical Database Design:
Indexing: Indexing involves creating data structures (such as BSTs, B-Trees, or Hash Tables) to optimize query performance by providing fast access paths to data. In physical database design, indexes are typically stored alongside the actual data, either in memory or on disk, to accelerate query processing. Indexes can be created on one or more columns of a table, allowing for efficient retrieval based on various criteria. While indexing improves query performance, it comes with overhead in terms of storage space and maintenance, as indexes need to be updated whenever the underlying data changes.
Hashing on File Systems:
Hashing is another technique used in physical database design to provide fast access to data. In hashing, a hash function is applied to each data item, generating a hash value that is used as an index into a hash table. Hash tables can be used for direct access to records based on their keys, making them suitable for primary key lookups. However, hashing may lead to collisions, where multiple keys map to the same hash value, requiring collision resolution techniques such as chaining or open addressing. Working Principles of BST, B-Tree, and B+ Trees with Database Examples:
Binary Search Tree (BST):
Example: Suppose we have a database table storing student records, and we want to create an index on the "student_id" column. The BST index would consist of nodes representing student records, with "student_id" values as keys. When querying for a specific student_id, the BST allows for efficient retrieval by performing binary search operations on the index.
B-Tree: Example: Consider a database table containing millions of rows of customer data, and we want to create an index on the "last_name" column. The B-Tree index organizes the last names of customers in a balanced tree structure, allowing for efficient lookup and range queries. B-Trees ensure that disk I/O operations are minimized by maintaining balance and optimizing node access patterns.
B+ Tree: Example: In a file system used by a database, we want to create an index on the "file_name" attribute. The B+ Tree index would consist of internal nodes storing keys for navigation and leaf nodes containing pointers to actual file records. B+ Trees facilitate efficient range queries and sequential access due to the sorted linked list of leaf nodes.
