Query Evaluation via Tree-Decompositions.
Jörg Flum, Markus Frick, Martin Grohe:
Query Evaluation via Tree-Decompositions.
ICDT 2001: 22-38@inproceedings{DBLP:conf/icdt/FlumFG01,
author = {J{\"o}rg Flum and
Markus Frick and
Martin Grohe},
editor = {Jan Van den Bussche and
Victor Vianu},
title = {Query Evaluation via Tree-Decompositions},
booktitle = {Database Theory - ICDT 2001, 8th International Conference, London,
UK, January 4-6, 2001, Proceedings},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {1973},
year = {2001},
isbn = {3-540-41456-8},
pages = {22-38},
ee = {db/conf/icdt/FlumFG01.html, http://link.springer.de/link/service/series/0558/bibs/1973/19730022.htm},
crossref = {DBLP:conf/icdt/2001},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX
BibTeX
Citation Page
BibTeX
References
- [1]
- Serge Abiteboul, Richard Hull, Victor Vianu:
Foundations of Databases.
Addison-Wesley 1995, ISBN 0-201-53771-0
Contents BibTeX
- [2]
- Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman:
The Design and Analysis of Computer Algorithms.
Addison-Wesley 1974, ISBN 0-201-00029-6
BibTeX
- [3]
- ...
- [4]
- Stefan Arnborg, Jens Lagergren, Detlef Seese:
Easy Problems for Tree-Decomposable Graphs.
J. Algorithms 12(2): 308-340(1991) BibTeX
- [5]
- Hans L. Bodlaender:
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth.
SIAM J. Comput. 25(6): 1305-1317(1996) BibTeX
- [6]
- Chandra Chekuri, Anand Rajaraman:
Conjunctive Query Containment Revisited.
ICDT 1997: 56-70 BibTeX
- [7]
- Bruno Courcelle:
Graph Rewriting: An Algebraic and Logic Approach.
Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B) 1990: 193-242 BibTeX
- [8]
- Bruno Courcelle, Mohamed Mosbah:
Monadic Second-Order Evaluations on Tree-Decomposable Graphs.
Theor. Comput. Sci. 109(1&2): 49-82(1993) BibTeX
- [9]
- Tomás Feder, Moshe Y. Vardi:
Monotone monadic SNP and constraint satisfaction.
STOC 1993: 612-622 BibTeX
- [10]
- ...
- [11]
- ...
- [12]
- Georg Gottlob, Nicola Leone, Francesco Scarcello:
The Complexity of Acyclic Conjunctive Queries.
FOCS 1998: 706-715 BibTeX
- [13]
- Georg Gottlob, Nicola Leone, Francesco Scarcello:
Hypertree Decompositions and Tractable Queries.
PODS 1999: 21-32 BibTeX
- [14]
- Georg Gottlob, Nicola Leone, Francesco Scarcello:
A Comparison of Structural CSP Decomposition Methods.
IJCAI 1999: 394-399 BibTeX
- [15]
- Phokion G. Kolaitis, Moshe Y. Vardi:
Conjunctive-Query Containment and Constraint Satisfaction.
PODS 1998: 205-213 BibTeX
- [16]
- ...
- [17]
- ...
- [18]
- Robert Endre Tarjan, Mihalis Yannakakis:
Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs.
SIAM J. Comput. 13(3): 566-579(1984) BibTeX
- [19]
- James W. Thatcher, Jesse B. Wright:
Generalized Finite Automata Theory with an Application to a Decision Problem of Second-Order Logic.
Mathematical Systems Theory 2(1): 57-81(1968) BibTeX
- [20]
- ...
- [21]
- Peter van Emde Boas:
Machine Models and Simulation.
Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) 1990: 1-66 BibTeX
- [22]
- Moshe Y. Vardi:
The Complexity of Relational Query Languages (Extended Abstract).
STOC 1982: 137-146 BibTeX
- [23]
- Moshe Y. Vardi:
On the Complexity of Bounded-Variable Queries.
PODS 1995: 266-276 BibTeX
- [24]
- Mihalis Yannakakis:
Algorithms for Acyclic Database Schemes.
VLDB 1981: 82-94 BibTeX
BibTeX
ACM SIGMOD Anthology - DBLP:
[Home | Search: Author, Title | Conferences | Journals]
Lecture Notes in Computer Science: Copyright © by Springer
Digitization of EDBT/ICDT/MFDBS proceedings was supported by the EDBT Endowment.
ACM SIGMOD Anthology: Copyright © by ACM (info@acm.org), Corrections: anthology@acm.org
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Sat May 16 23:19:16 2009