Size Bounds and Query Plans for Relational Joins

Authors:
Albert Atserias;Martin Grohe;Dániel Marx
Affiliations:
-;-;-
Venue:
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Year:
2008

Size and treewidth bounds for conjunctive queries

Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Enumerating homomorphisms

Journal of Computer and System Sciences
Worst-case optimal join algorithms: [extended abstract]

PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Size and Treewidth Bounds for Conjunctive Queries

Journal of the ACM (JACM)
Factorised representations of query results: size bounds and readability

Proceedings of the 15th International Conference on Database Theory
Constraint optimization problems and bounded tree-width revisited

CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Counting homomorphisms via hypergraph-based structural restrictions

ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Structural tractability of enumerating CSP solutions

Constraints
Communication steps for parallel query processing

Proceedings of the 32nd symposium on Principles of database systems
Upper and lower bounds on the cost of a map-reduce computation

Proceedings of the VLDB Endowment

Hi-index	0.00

N/A