Reference no: EM132392130

1) What is the difference between SQL, NoSQL, and NewSQL databases? Provide an example of each database systems.

2) What is an index? What is the difference between a clustering index and a secondary index?

3) Show the hash table of size 13 after inserting entries with keys 34, 29, 53, 44, 120, 39, 45, 40, 3, 2, 1, and 4, using linear probing. (Show the computation step by step), and explain the processes of handling the collisions.

4) Show the hash table of size 13 after inserting entries with keys 34, 29, 53, 44, 120, 39, 45, 40, 3, 2, 1, and 4 using quadratic probing ((k + j2) % N), for j ≥ 0, that is, k % N, (k + 1)% N, (k + 4)% n, (k +9)% N, and N is hash table size. (Show the computation step by step), and explain the processes of handling the collisions.

5) Show the hash table of size 13 after inserting entries with keys 34, 29, 53, 44, 120, 39, 45, 40, 3, 2, 1, and 4, using double hashing function : h(k, i) = ((h(k) + i*h′(k))% N), where I ≥ 0 and N is hash table size) with the following functions: h(k) = k % 13; h'(k) = 11 - k % 11; (Show the computation step by step), and explain the processes of handling the collisions.

6) A PARTS file with Part# as the key field includes records with the following Part# values: 23, 65, 37, 60, 46, 92, 48, 71, 56, 59, 18, 21, 10, 74, 78, 15, 16, 20, 24, 28, 39, 43, 47, 50, 69, 75, 8, 49, 33, 38. Suppose that the search field values are inserted in the given order in a B+-tree of order p = 4 and pleaf = 3; show how the tree will expand and what the final tree will look like.

7) Repeat above problem, but use a B-tree of order p = 4 instead of a B+-tree.

Note: For more information, please refer/read related sections in your textbook on Chapter 1 (Database and Database Users), Chapter 16 (Disk Storage, Basic File, Structures, Hashing, and Modern Storage Architectures), and Chapter 17 (Indexing Structures for Files and Physical Design).