Compressed hierarchical binary histograms for summarizing multi-dimensional data
Knowledge and Information Systems
RRSi: indexing XML data for proximity twig queries
Knowledge and Information Systems
Exploiting maximal redundancy to optimize SQL queries
Knowledge and Information Systems
Subquery plan reuse based query optimization
Proceedings of the 17th International Conference on Management of Data
| Hi-index | 0.01 |
As database technology is applied to more and more application domains, user queries are becoming increasingly complex (e.g. involving a large number of joins and a complex query structure). Query optimizers in existing database management systems (DBMS) were not developed for efficiently processing such queries and often suffer from problems such as intolerably long optimization time and poor optimization results. To tackle this challenge, we present a new similarity-based approach to optimizing complex queries in this paper. The key idea is to identify similar subqueries that often appear in a complex query and share the optimization result among similar subqueries in the query. Different levels of similarity for subqueries are introduced. Efficient algorithms to identify similar queries in a given query and optimize the query based on similarity are presented. Related issues, such as choosing good starting nodes in a query graph, evaluating identified similar subqueries and analyzing algorithm complexities, are discussed. Our experimental results demonstrate that the proposed similarity-based approach is quite promising in optimizing complex queries with similar subqueries in a DBMS.