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?

What is Sqoop-merge and how does it work?

Let's say there are two students who want to enroll in the same class, but there's only room for one of them. What aspect of the database system prevents both students from obtaining the last open seat in the classroom?

Please please do this manually  a.What is the distance between the two farthest members? (max or complete link) (round to four decimal places here, and next 2 problems); b. What is the distance between the two closest members? (min or single link);c. What is the average distance between all pairs? d. What is the center distance between two clusters? e. Among all three distances above, which one is robust to noise? Answer either “complete”, “single”, “average”, and "center"

List and explain the methods used for resolution the external hashing collision.

Exactly what is the meaning of the term "clustering," anyway? How does it function in the context of data mining?

Describe the difference between closed and open hashing in more detail. In relation to database applications, have a discussion on the relative merits of each technique.