What is query tree? Why do we need this tree in query processing?

Query tree

A query tree represents a tree data structure representing relational algebra expression. The tables of query trees are represented as leaf the query nodes The relational algebra operations are represented as the Internal nodes. The root represents the query as a whole.

Query Processing is the activities involved in parsing, validating, optimizing, and executing a query. We need this tree in query processing because:

  • It reduces the size of the intermediate relations, both in terms of bytes per record as well as a number of records, as soon as possible so that subsequent operations will have fewer data to process and thus execute quicker.
  • Operations, such as conjunctive selections, Should be broken down into their equivalent Set of Smaller units to allow the individual units to be moved into"better" positions within the query tree.
  • Combining Cartesian products with corresponding selects to create joins-utilizing optimized join algorithms like the sort-merge join and hash join can be orders of magnitude more efficient.
  • Move Selects and projects as far down The tree as possible, as these operations will produce smaller intermediate relations that can be processed more quickly by the operations.


Comments

Popular posts from this blog

Suppose that a data warehouse for Big-University consists of the following four dimensions: student, course, semester, and instructor, and two measures count and avg_grade. When at the lowest conceptual level (e.g., for a given student, course, semester, and instructor combination), the avg_grade measure stores the actual course grade of the student. At higher conceptual levels, avg_grade stores the average grade for the given combination. a) Draw a snowflake schema diagram for the data warehouse. b) Starting with the base cuboid [student, course, semester, instructor], what specific OLAP operations (e.g., roll-up from semester to year) should one perform in order to list the average grade of CS courses for each BigUniversity student. c) If each dimension has five levels (including all), such as “student < major < status < university < all”, how many cuboids will this cube contain (including the base and apex cuboids)?

Suppose that a data warehouse consists of the four dimensions; date, spectator, location, and game, and the two measures, count and charge, where charge is the fee that a spectator pays when watching a game on a given date. Spectators may be students, adults, or seniors, with each category having its own charge rate. a) Draw a star schema diagram for the data b) Starting with the base cuboid [date; spectator; location; game], what specific OLAP operations should perform in order to list the total charge paid by student spectators at GM Place in 2004?

Explain market-Oriented Cloud computing architecture.