Enumeration of first-order queries on classes of structures with bounded expansion

Authors:
Wojciech Kazana;Luc Segoufin
Affiliations:
INRIA and ENS Cachan, Cachan, France;INRIA and ENS Cachan, Cachan, France
Venue:
Proceedings of the 32nd symposium on Principles of database systems
Year:
2013

Citing 12
Cited 0

Easy problems for tree-decomposable graphs

Journal of Algorithms
Graph rewriting: an algebraic and logic approach

Handbook of theoretical computer science (vol. B)
Color-coding

Journal of the ACM (JACM)
On the complexity of database queries

Journal of Computer and System Sciences
Foundations of Databases: The Logical Level

Foundations of Databases: The Logical Level
First-order queries on structures of bounded degree are computable with constant delay

ACM Transactions on Computational Logic (TOCL)
Grad and classes with bounded expansion I. Decompositions

European Journal of Combinatorics
Grad and classes with bounded expansion II. Algorithmic aspects

European Journal of Combinatorics
Deciding First-Order Properties for Sparse Graphs

FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
On nowhere dense graphs

European Journal of Combinatorics
MSO queries on tree decomposable structures are computable with linear delay

CSL'06 Proceedings of the 20th international conference on Computer Science Logic
On acyclic conjunctive queries and constant delay enumeration

CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the evaluation of first-order queries over classes of databases with bounded expansion. The notion of bounded expansion is fairly broad and generalizes bounded degree, bounded treewidth and exclusion of at least one minor. It was known that over a class of databases with bounded expansion, first-order sentences could be evaluated in time linear in the size of the database. We first give a different proof of this result. Moreover, we show that answers to first-order queries can be enumerated with constant delay after a linear time preprocessing. We also show that counting the number of answers to a query can be done in time linear in the size of the database.