TreeTracker Join: simple, optimal, fast

DOI10.1145/3774325MaRDI QIDQ7227223zbMATH OpenFDO

Authors Zeyuan Hu, Yisu Remy Wang, Daniel P. Miranker

Publication date 9 April 2026

Published in ACM Transactions on Database Systems (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1145/3774325

zbMATH Keywords

acyclic conjunctive queriesjoin orderingoptimal join algorithm

Mathematics Subject Classification ID

Database theory (68P15) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• An optimal backtrack algorithm for tree-structured constraint satisfaction problems
• Any-k algorithms for enumerating ranked answers to conjunctive queries
• Conjunctive-query containment and constraint satisfaction
• On Acyclic Conjunctive Queries and Constant Delay Enumeration
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Worst-case optimal join algorithms

This page was built for publication: TreeTracker Join: simple, optimal, fast

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7227223)