Make a version of the hybrid merge-join method that works when both relations are not physically sorted but have a sorted secondary index on the traits to be combined.

In this hypothetical situation, you have access to a database providing the x, y coordinates and names of all neighbouring eateries. Only the following types of inquiries need to be made: The inquiry investigates into whether or not the specified address is acceptable for a restaurant. Which indexing method, B-tree or R-tree, is superior, and why? Why?

Create an order for the generic definitions by making use of the main key definitions from the 2NF and 3NF. Provide a comprehensive example to prove your assertion.

Explain how to split the hybrid hash-join operator into sub-operators to model pipelining