Assume that each tuple of Sailors is 50 bytes long, that a page can hold 80 Sailors tuples, and that we have 500 pages of such tuples. For each of the following selection conditions, estimate the number of pages retrieved, given the catalog information in the question. 1. Assume that we have a B+-tree index T on the search key (Sailors.sid), and as- sume that I Height(T) = 4, INPages(T) = 50, Low (T) = 1, and High (T): = 100,000. (a) Sailors.sid<50,000 (Sailors) (b) Sailors.sid=50,000 (Sailors) 2. Assume that we have a hash index T on the search key (Sailors.sid), and assume that I Height(T) = 2, IN Pages(T) = 50, Low (T) 1, and High(T) = 100,000. (a) Sailors.sid<50,000 (Sailors) =

Assume that each tuple of Sailors is 50 bytes long, that a page can hold 80 Sailors tuples, and that we have 500 pages of such tuples. For each of the following selection conditions, estimate the number of pages retrieved, given the catalog information in the question. 1. Assume that we have a B+-tree index T on the search key (Sailors.sid), and as- sume that I Height(T) = 4, INPages(T) = 50, Low (T) = 1, and High (T): = 100,000. (a) Sailors.sid<50,000 (Sailors) (b) Sailors.sid=50,000 (Sailors) 2. Assume that we have a hash index T on the search key (Sailors.sid), and assume that I Height(T) = 2, IN Pages(T) = 50, Low (T) 1, and High(T) = 100,000. (a) Sailors.sid<50,000 (Sailors) =

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Suppose there is a relation r(A, B, C), with a B+-tree index with search key(A, B). What is the worst-case cost of finding records satisfying 10 < A < 50 ∧ 5 < B < 10 using this index, in terms of the number of records n2 that satisfy this selection, as well as n1 and h defined above?
Imagine that you have access to a database with the names and x, y locations of many different places. Let's say that only the following kinds of questions are being asked: The main question of the study is whether or not there is a restaurant at a certain location. Which way of sorting is better: Is it a B-tree or an R-tree? Why?
Imagine that you have a database that contains the x, y coordinates as well as the names of eateries. Consider the possibility that just the following categories of questions will be asked: The inquiry seeks to ascertain whether or not a restaurant can be discovered at a certain place. Indexes based on R-trees against those based on B-trees: which is superior? Why?
Consider a Table T with a key field k. A and B tree of order P denotes the maximum number of record pointers in a B tree. Assume K is 10 bytes long disk block size is 512 Bytes. Record pointer is 8 Bytes and block pointer size is 5 Bytes long in order for each P tree node to fit in a single disk block the maximum value of P.
Suppose there is a relation r(A, B, C), with a B+-tree index with search key(A, B). What is the worst-case cost of finding records satisfying 10 < A < 50 using this index, in terms of the number of records retrieved n1 and the height h of the tree?
QUESTION 2 There are many algorithms exist for keeping binary search trees balanced, among them are AVL and Splay. Discuss the differences between the AVL and Splay algorithms in keeping a binary search tree balanced. In the big-O notation, what is the cost of splaying amortized over a sequence of retrievals, insertions and deletes? Given the following Figure 3. Show step by step splaying process when node d is accessed. Proceed with accessing node b
Create a programme that does a range search on all components that fall between bounds a, b along a dimension i of the multidimensional data collection, represented as a k-d tree.Given the data collection (7, 5), (4, 2), (6, 8), (1, 4), (3, 5), (2, 4), (3, 7), (9, 1), (6, 6), (5, 1) expressed as a k-d tree (k = 2), a range search of data components falling inside (a = 3, b = 7) along dimension i = 2 produces (7, 5), (1, 4), (3, 5), (3, 7), (6, 6).
You have access to a database that contains the x, y coordinates and names of all surrounding dining establishments. The only questions that need answering are these: A restaurant's viability at the given location is being questioned. Is it preferable to use a B-tree or an R-tree indexing method, and why? Why?
Suppose that, in a three-level tree, we can afford to keep a links in internal memory, between b and 2b links in pages representing internal nodes, and between c and 2citems in pages representing external nodes. What is the maximum number of items thatwe can hold in such a tree, as a function of a, b, and c?
The leaf nodes of a B+-tree file organization may lose sequentiality after a sequence of inserts. The leaf nodes of a B+-tree file organization may lose sequentiality after a sequence of inserts. To minimize the number of seeks in a sequential scan, many databasesallocate leaf pages in extents of n blocks, for some reasonably large n.When the first leaf of a B+-tree is allocated, only one block of an n-blockunit is used, and the remaining pages are free. If a page splits, and itsn-block unit has a free page, that space is used for the new page. If then-block unit is full, another n-block unit is allocated, and the first n∕2 leafpages are placed in one n-block unit and the remaining one in the secondn-block unit. For simplicity, assume that there are no delete operations. The technique of redistributing values to siblings to improve space utilization is likely to be more efficient when used with the preceding allocation scheme for leaf blocks. Explain why.
What would happen to insertions, deletions, and hash table searches if the linked list pointers were kept in an AVL tree? Your response must include an explanation of the running time in terms of hash table size. Is Big-Ohnotation necessary?
Imagine having a database of restaurant names and x, y coordinates. Imagine just these inquiries: The investigation's main question is if a restaurant is there. Best indexing method: B-tree or R-tree? Why?