Affiliation:
1. Humboldt-Universität, zu Berlin
Abstract
This paper is the tutorial we wish we had had available when starting our own research on constant delay enumeration for conjunctive queries. It provides precise statements and detailed, self-contained proofs of the fundamental results in this area.
Publisher
Association for Computing Machinery (ACM)
Reference60 articles.
1. Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems
2. EmptyHeaded
3. Serge Abiteboul Richard Hull and Victor Vianu. 1995. Foundations of Databases. Addison-Wesley. http://webdam.inria.fr/Alice/ Serge Abiteboul Richard Hull and Victor Vianu. 1995. Foundations of Databases. Addison-Wesley. http://webdam.inria.fr/Alice/
4. What Do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog Have to Do with One Another?
5. Finding and counting given length cycles
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献