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.
- S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison Wesley, 1995. Google Scholar
Digital Library
- Noga Alon, Raphael Yuster, and Uri Zwick. Color-Coding. J. ACM, 42(4):844--856, 1995. Google Scholar
Digital Library
- Stefan Arnborg, Jens Lagergren, and Detlef Seese. Easy Problems for Tree-Decomposable Graphs. J. of Algorithms, 12(2):308--340, 1991. Google Scholar
Digital Library
- Guillaume Bagan. MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay. In Conf. on Computer Science Logic (CSL), pages 167--181, 2006. Google Scholar
Digital Library
- Guillaume Bagan. Algorithmes et complexité des problèmes d'énumération pour l'évaluation de requêtes logiques. PhD thesis, Université de Caen, 2009.Google Scholar
- Guillaume Bagan, Arnaud Durand, and Etienne Grandjean. On Acyclic Conjunctive Queries and Constant Delay Enumeration. In Conf. on Computer Science Logic (CSL), pages 208--222, 2007. Google Scholar
Digital Library
- Guillaume Bagan, Arnaud Durand, Etienne Grandjean, and Frédéric Olive. Computing the jth solution of a first-order query. RAIRO Theoretical Informatics and Applications, 42(1):147--164, 2008.Google Scholar
Cross Ref
- Bruno Courcelle. Graph Rewriting: An Algebraic and Logic Approach. In Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B), pages 193--242. 1990. Google Scholar
Digital Library
- Arnaud Durand and Etienne Grandjean. First-order queries on structures of bounded degree are computable with constant delay. ACM Trans. on Computational Logic (ToCL), 8(4), 2007. Google Scholar
Digital Library
- Zdeněk Dvořák, Daniel Král, and Robin Thomas. Deciding First-Order Properties for Sparse Graphs. In Symp. on Foundations of Computer Science (FOCS), pages 133--142, 2010. Google Scholar
Digital Library
- Markus Frick and Martin Grohe. The complexity of first-order and monadic second-order logic revisited. Ann. Pure Appl. Logic, 130(1--3):3--31, 2004.Google Scholar
- Martin Grohe and Stephan Kreutzer. Model Theoretic Methods in Finite Combinatorics, chapter Methods for Algorithmic Meta Theorems. American Mathematical Society, 2011.Google Scholar
- Wojciech Kazana and Luc Segoufin. First-order query evaluation on structures of bounded degree. Logical Methods in Computer Science (LMCS), 7(2), 2011.Google Scholar
- Wojciech Kazana and Luc Segoufin. Enumeration of monadic second-order queries on trees. ACM Trans. on Computational Logic (ToCL), to appear.Google Scholar
- Stephan Kreutzer and Anuj Dawar. Parameterized complexity of first-order logic. Electronic Colloquium on Computational Complexity (ECCC), 16:131, 2009.Google Scholar
- Jaroslav Nešetřil and Patrice Ossona de Mendez. Grad and classes with bounded expansion I. Decompositions. Eur. J. Comb., 29(3):760--776, 2008. Google Scholar
Digital Library
- Jaroslav Nešetřil and Patrice Ossona de Mendez. Grad and classes with bounded expansion II. Algorithmic aspects. Eur. J. Comb., 29(3):777--791, 2008. Google Scholar
Digital Library
- Jaroslav Nešetřil and Patrice Ossona de Mendez. On nowhere dense graphs. European J. of Combinatorics, 32(4):600--617, 2011. Google Scholar
Digital Library
- Christos H. Papadimitriou and Mihalis Yannakakis. On the Complexity of Database Queries. J. on Computer and System Sciences (JCSS), 58(3):407--427, 1999. Google Scholar
Digital Library
- Detlef Seese. Linear Time Computable Problems and First-Order Descriptions. Mathematical Structures in Computer Science, 6(6):505--526, 1996.Google Scholar
Cross Ref
Index Terms
Enumeration of first-order queries on classes of structures with bounded expansion
Recommendations
Enumeration for FO Queries over Nowhere Dense Graphs
PODS '18: Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database SystemsWe consider the evaluation of first-order queries over classes of databases that are nowhere dense. The notion of nowhere dense classes was introduced by Nesetril and Ossona de Mendez as a formalization of classes of "sparse" graphs and generalizes many ...
First-Order Interpretations of Bounded Expansion Classes
The notion of bounded expansion captures uniform sparsity of graph classes and renders various algorithmic problems that are hard in general tractable. In particular, the model-checking problem for first-order logic is fixed-parameter tractable over ...
First-order queries on structures of bounded degree are computable with constant delay
A relational structure is d-degree-bounded, for some integer d, if each element of the domain belongs to at most d tuples. In this paper, we revisit the complexity of the evaluation problem of not necessarily Boolean first-order (FO) queries over d-...






Comments