HyperBench-Reference-Cited by-同舟云学术

HyperBench

Published:2019 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems - PODS '19
language:
Short-container-title:

Author:

Fischl Wolfgang¹,Gottlob Georg²,Longo Davide Mario¹,Pichler Reinhard¹

Affiliation:

1. Vienna University of Technology, Vienna, Austria

2. Vienna University of Technology & University of Oxford, Oxford, United Kingdom

Funder

Austrian Science Fund (FWF)

Publisher

ACM Press

Reference50 articles.

1. Christopher R. Aberger, Andrew Lamb, Susan Tu, Andres Nö tzli, Kunle Olukotun, and Christopher Ré. 2017. EmptyHeaded: A Relational Engine for Graph Processing. ACM Trans. Database Syst. , Vol. 42, 4 (2017), 20:1--20:44. https://doi.org/10.1145/3129246

2. Christopher R. Aberger, Susan Tu, Kunle Olukotun, and Christopher Ré. 2016. Old Techniques for New Join Algorithms: A Case Study in RDF Processing. CoRR , Vol. abs/1602.03557 (2016). arxiv: 1602.03557 http://arxiv.org/abs/1602.03557

3. Isolde Adler, Georg Gottlob, and Martin Grohe. 2007. Hypertree width and related hypergraph invariants. Eur. J. Comb. , Vol. 28, 8 (2007), 2167--2181. https://doi.org/10.1016/j.ejc.2007.04.013

4. Kamal Amroun, Zineb Habbas, and Wassila Aggoune-Mtalaa. 2016. A compressed Generalized Hypertree Decomposition-based solving technique for non-binary Constraint Satisfaction Problems. AI Commun. , Vol. 29, 2 (2016), 371--392. https://doi.org/10.3233/AIC-150694

5. Molham Aref, Balder ten Cate, Todd J. Green, Benny Kimelfeld, Dan Olteanu, Emir Pasalic, Todd L. Veldhuizen, and Geoffrey Washburn. 2015. Design and Implementation of the LogicBlox System. In Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, Melbourne, Victoria, Australia, May 31 - June 4, 2015 , , Timos K. Sellis, Susan B. Davidson, and Zachary G. Ives (Eds.). ACM, 1371--1382. https://doi.org/10.1145/2723372.2742796

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

1. Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth;ACM Transactions on Database Systems;2023-12-30

2. Computing optimal hypertree decompositions with SAT;Artificial Intelligence;2023-12

3. Fractional covers of hypergraphs with bounded multi-intersection;Theoretical Computer Science;2023-11

4. Computing partial hypergraphs of bounded width;Discrete Applied Mathematics;2023-04

5. Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth;Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems;2022-06-12