Structural heuristics for query optimization
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach to join-query optimization is cost based, which requires developing a cost model, assigning an estimated cost to each que...
Main Author: | McMahan, Benjamin James |
---|---|
Other Authors: | Vardi, Moshe Y. |
Format: | Others |
Language: | English |
Published: |
2009
|
Subjects: | |
Online Access: | http://hdl.handle.net/1911/17707 |
Similar Items
-
Query-time optimization techniques for structured queries in information retrieval
by: Cartright, Marc-Allen
Published: (2013) -
Optimizing Query Processing Under Skew
by: Zhang, Wangda
Published: (2020) -
Query-Time Optimization Techniques for Structured Queries in Information Retrieval
by: Cartright, Marc-Allen
Published: (2013) -
Querying Graph Structured Data
by: Yang, Lei
Published: (2015) -
Accelerating Analytical Query Processing with Data Placement Conscious Optimization and RDMA-aware Query Execution
by: Liu, Feilong
Published: (2018)