PostgreSQL: introduction and concepts
PostgreSQL: introduction and concepts
Oracle9i PL/SQL Programming
The Parameterized Complexity of Counting Problems
SIAM Journal on Computing
Constraint solving via fractional edge covers
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Weighted hypertree decompositions and optimal query plans
Journal of Computer and System Sciences
Algorithms for acyclic database schemes
VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
Generalized hypertree decompositions: NP-hardness and tractable variants
Journal of the ACM (JACM)
Decomposing combinatorial auctions and set packing problems
Journal of the ACM (JACM)
Hi-index | 0.00 |
Structural decomposition methods are query optimization methods specifically conceived in the database theory community to efficiently answer (near-)acyclic queries. We propose to demonstrate H-DB, an SQL query optimizer that combines classical quantitative optimization techniques with such structural decomposition methods, which so far have been just analyzed from the theoretical viewpoint. The system provides support to optimizing SQL queries with arbitrary output variables, aggregate operators, ORDER BY statements, and nested queries. H-DB can be put on top of any existing database management system supporting JDBC technology, by transparently interacting/replacing its standard query optimization module. However, to push at maximum its optimization capabilities, H-DB should be coupled with an ad-hoc physical semi-join operator, which (as a relevant example) we implemented and integrated within the PostgreSQL database management system.