Help Privacy Policy Disclaimer
  Advanced SearchBrowse




Conference Paper

Faster Join Enumeration for Complex Queries


Neumann,  Thomas
Databases and Information Systems, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available

Moerkotte, G., & Neumann, T. (2008). Faster Join Enumeration for Complex Queries. In Proceedings of the 2008 IEEE 24th International Conference on Data Engineering (ICDE'08) (pp. 1430-1432). Piscataway, NJ: IEEE.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-1BA9-A
Most existing join ordering algorithms concentrate on join queries with simple join predicates and inner joins only, where simple predicates are those that involve exactly two relations. However, real queries may contain complex join predicates, i.e. predicates involving more than two relations. We show how to handle complex join predicates efficiently, by modeling the query graph as a hypergraph and reasoning about its connected subgraphs.