Hypertree Decompositions-Reference-Cited by-同舟云学术

Hypertree Decompositions

Published:2016-06-15 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems
language:
Short-container-title:

Author:

Gottlob Georg¹,Greco Gianluigi²,Leone Nicola²,Scarcello Francesco²

Affiliation:

1. University of Oxford, Oxford, United Kingdom

2. University of Calabria, Rende - CS, Italy

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/2902251.2902309

Reference137 articles.

1. EmptyHeaded

2. C. R. Aberger S. Tu K. Olukotun and C. Ré. Old techniques for new join algorithms: A case study in RDF processing. CoRR abs/1602.03557 2016. C. R. Aberger S. Tu K. Olukotun and C. Ré. Old techniques for new join algorithms: A case study in RDF processing. CoRR abs/1602.03557 2016.

3. I. Adler. Width functions for hypertree decompositions. PhD thesis Albert-Ludwigs-Universit\"at Freiburg 2006. I. Adler. Width functions for hypertree decompositions. PhD thesis Albert-Ludwigs-Universit\"at Freiburg 2006.

4. Tree-width and functional dependencies in databases

Cited by 54 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Family of Centrality Measures for Graph Data Based on Subgraphs;ACM Transactions on Database Systems;2024-05-16

2. Fast Local Subgraph Counting;Proceedings of the VLDB Endowment;2024-04

3. Artificial Intelligence;Reference Module in Life Sciences;2024

4. Probabilistic Query Evaluation: The Combined FPRAS Landscape;Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems;2023-06-18

5. Guaranteeing the Õ(AGM/OUT) Runtime for Uniform Sampling and Size Estimation over Joins;Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems;2023-06-18