research-article

Enumeration for FO Queries over Nowhere Dense Graphs

Authors:

Nicole Schweikardt,

Alexandre VignyAuthors Info & Claims

SIGMOD/PODS '18: Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems

Pages 151 - 163

https://doi.org/10.1145/3196959.3196971

Published: 27 May 2018 Publication History

Abstract

We 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 well-known classes of graphs, such as classes of bounded degree, bounded tree-width, or bounded expansion. It has recently been shown by Grohe, Kreutzer, and Siebertz that over nowhere dense classes of databases, first-order sentences can be evaluated in pseudo-linear time (pseudo-linear time means that for all ε there exists an algorithm working in time O(n¹+ε), where n is the size of the database). For first-order queries of higher arities, we show that over any nowhere dense class of databases, the set of their solutions can be enumerated with constant delay after a pseudo-linear time preprocessing. In the same context, we also show that after a pseudo-linear time preprocessing we can, on input of a tuple, test in constant time whether it is a solution to the query.

References

[1]

Serge Abiteboul, Richard Hull, and Victor Vianu. Foundations of Databases. Addison-Wesley, 1995.

Digital Library

[2]

Baruch Awerbuch, Bonnie Berger, Lenore Cowen, and David Peleg. Near-linear cost sequential and distribured constructions of sparse neighborhood covers. In 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3--5 November 1993, pages 638--647. IEEE Computer Society, 1993.

Digital Library

[3]

Baruch Awerbuch and David Peleg. Sparse partitions (extended abstract). In 31st Annual Symposium on Foundations of Computer Science, St. Louis, Missouri, USA, October 22--24, 1990, Volume II, pages 503--513. IEEE Computer Society, 1990.

Digital Library

[4]

Guillaume Bagan. MSO queries on tree decomposable structures are computable with linear delay. In Zoltán Ésik, editor, Computer Science Logic, 20th International Workshop, CSL 2006, 15th Annual Conference of the EACSL, Szeged, Hungary, September 25--29, 2006, Proceedings, volume 4207 of Lecture Notes in Computer Science, pages 167--181. Springer, 2006.

Digital Library

[5]

Guillaume Bagan, Arnaud Durand, and Etienne Grandjean. On acyclic conjunctive queries and constant delay enumeration. In Jacques Duparc and Thomas A. Henzinger, editors, Computer Science Logic, 21st International Workshop, CSL 2007, 16th Annual Conference of the EACSL, Lausanne, Switzerland, September 11--15, 2007, Proceedings, volume 4646 of Lecture Notes in Computer Science, pages 208--222. Springer, 2007.

Digital Library

[6]

Andrey Balmin, Yannis Papakonstantinou, and Victor Vianu. Incremental validation of XML documents. ACM Trans. Database Syst., 29(4):710--751, 2004.

Digital Library

[7]

Christoph Berkholz, Jens Keppeler, and Nicole Schweikardt. Answering conjunctive queries under updates. In Emanuel Sallinger, Jan Van den Bussche, and Floris Geerts, editors, Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2017, Chicago, IL, USA, May 14--19, 2017, pages 303--318. ACM, 2017.

Digital Library

[8]

Christoph Berkholz, Jens Keppeler, and Nicole Schweikardt. Answering FO+MOD queries under updates on bounded degree databases. In Michael Benedikt and Giorgio Orsi, editors, 20th International Conference on Database Theory, ICDT 2017, March 21--24, 2017, Venice, Italy, volume 68 of LIPIcs, pages 8:1--8:18. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017.

[9]

Christoph Berkholz, Jens Keppeler, and Nicole Schweikardt. Answering UCQs under updates and in the presence of integrity constraints. In Benny Kimelfeld and Yael Amsterdamer, editors, 21st International Conference on Database Theory, ICDT 2018, March 26--29, 2018, Vienna, Austria, volume 98 of LIPIcs, pages 8:1--8:19. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018.

[10]

Rodney G. Downey, Michael R. Fellows, and Udayan Taylor. The parameterized complexity of relational database queries and an improved characterization of W{1}. In Douglas S. Bridges, Cristian S. Calude, Jeremy Gibbons, Steve Reeves, and Ian H. Witten, editors, First Conference of the Centre for Discrete Mathematics and Theoretical Computer Science, DMTCS 1996, Auckland, New Zealand, December, 9--13, 1996, pages 194--213. Springer-Verlag, Singapore, 1996.

[11]

Arnaud Durand and Etienne Grandjean. First-order queries on structures of bounded degree are computable with constant delay. ACM Trans. Comput. Log., 8(4):21, 2007.

Digital Library

[12]

Arnaud Durand, Nicole Schweikardt, and Luc Segoufin. Enumerating answers to first-order queries over databases of low degree. In Richard Hull and Martin Grohe, editors, Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS'14, Snowbird, UT, USA, June 22--27, 2014, pages 121--131. ACM, 2014.

Digital Library

[13]

Markus Frick and Martin Grohe. Deciding first-order properties of locally tree-decomposable structures. J. ACM, 48(6):1184--1206, 2001.

Digital Library

[14]

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.

[15]

Haim Gaifman. On local and non-local properties. In Proceedings of the Herbrand Symposium, volume 107 of Studies in Logic and the Foundations of Mathematics, pages 105 -- 135. Elsevier, 1982.

[16]

Martin Grohe, Stephan Kreutzer, and Sebastian Siebertz. Deciding first-order properties of nowhere dense graphs. In David B. Shmoys, editor, Symposium on Theory of Computing, STOC 2014, New York, NY, USA, May 31 - June 03, 2014, pages 89--98. ACM, 2014.

Digital Library

[17]

Martin Grohe and Nicole Schweikardt. First-order query evaluation with cardinality conditions. In Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2018, Houston, TX, USA, June 10--15, 2018. ACM, 2018. Full version available at CoRR, http://arxiv.org/abs/1707.05945, 2017.

Digital Library

[18]

Wojciech Kazana. Query evaluation with constant delay. (L'évaluation de requêtes avec un délai constant). PhD thesis, École normale supérieure de Cachan, Paris, France, 2013.

[19]

Wojciech Kazana and Luc Segoufin. First-order query evaluation on structures of bounded degree. Logical Methods in Computer Science, 7(2), 2011.

[20]

Wojciech Kazana and Luc Segoufin. Enumeration of first-order queries on classes of structures with bounded expansion. In Richard Hull and Wenfei Fan, editors, Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2013, New York, NY, USA - June 22 - 27, 2013, pages 297--308. ACM, 2013.

Digital Library

[21]

Wojciech Kazana and Luc Segoufin. Enumeration of monadic second-order queries on trees. ACM Trans. Comput. Log., 14(4):25:1--25:12, 2013.

Digital Library

[22]

Stephan Kreutzer and Anuj Dawar. Parameterized complexity of first-order logic. Electronic Colloquium on Computational Complexity (ECCC), 16:131, 2009.

[23]

Leonid Libkin. Elements of Finite Model Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer, 2004.

Digital Library

[24]

Jaroslav Nesetril and Patrice Ossona de Mendez. First order properties on nowhere dense structures. J. Symb. Log., 75(3):868--887, 2010.

[25]

Jaroslav Nesetril and Patrice Ossona de Mendez. On nowhere dense graphs. Eur. J. Comb., 32(4):600--617, 2011.

Digital Library

[26]

Jaroslav Nesetril and Patrice Ossona de Mendez. Sparsity - Graphs, Structures, and Algorithms, volume 28 of Algorithms and combinatorics. Springer, 2012.

Digital Library

[27]

Matthias Niewerth and Luc Segoufin. Enumeration of MSO queries on strings with constant delay and logarithmic updates. In Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2018, Houston, TX, USA, June 10--15, 2018. ACM, 2018.

Digital Library

[28]

David Peleg. Distance-dependent distributed directories. Inf. Comput., 103(2):270--298, 1993.

Digital Library

[29]

Luc Segoufin and Alexandre Vigny. Constant delay enumeration for FO queries over databases with local bounded expansion. In Michael Benedikt and Giorgio Orsi, editors, 20th International Conference on Database Theory, ICDT 2017, March 21--24, 2017, Venice, Italy, volume 68 of LIPIcs, pages 20:1--20:16. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017.

[30]

Sebastian Siebertz. Nowhere Dense Classes of Graphs: Characterisations and Algorithmic Meta- Theorems. PhD thesis, Technical University of Berlin, Germany, 2016.

[31]

Moshe Y. Vardi. The complexity of relational query languages (extended abstract). In Harry R. Lewis, Barbara B. Simons, Walter A. Burkhard, and Lawrence H. Landweber, editors, Proceedings of the 14th Annual ACM Symposium on Theory of Computing, May 5--7, 1982, San Francisco, California, USA, pages 137--146. ACM, 1982.

Digital Library

Cited By

Dreier JRossmanith PMarx D(2021)Approximate evaluation of first-order counting queriesProceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3458064.3458168(1720-1739)Online publication date: 10-Jan-2021
https://dl.acm.org/doi/10.5555/3458064.3458168
Carmeli NKröll M(2021)On the Enumeration Complexity of Unions of Conjunctive QueriesACM Transactions on Database Systems10.1145/345026346:2(1-41)Online publication date: 29-May-2021
https://dl.acm.org/doi/10.1145/3450263
Dreier JGorla D(2021)Lacon- and shrub-decompositionsProceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science10.1109/LICS52264.2021.9470680(1-13)Online publication date: 29-Jun-2021
https://dl.acm.org/doi/10.1109/LICS52264.2021.9470680
Show More Cited By

Index Terms

Enumeration for FO Queries over Nowhere Dense Graphs
1. Theory of computation
  1. Logic
    1. Finite Model Theory

Recommendations

Enumeration for FO Queries over Nowhere Dense Graphs
We consider the evaluation of first-order queries over classes of databases that are nowhere dense. The notion of nowhere dense classes was introduced by Nešetřil and Ossona de Mendez as a formalization of classes of “sparse” graphs and generalizes many ...
Deciding First-Order Properties of Nowhere Dense Graphs

Nowhere dense graph classes, introduced by Nešetřil and Ossona de Mendez [2010, 2011], form a large variety of classes of “sparse graphs” including the class of planar graphs, actually all classes with excluded minors, and also bounded degree graphs and ...
Nowhere Dense Classes of Graphs: Characterisations and Algorithmic Meta-Theorems / Nowhere Dense Klassen von Graphen

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PODS '18: Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems

May 2018

462 pages

ISBN:9781450347068

DOI:10.1145/3196959

General Chair:
Jan Van den Bussche
Hasselt University
,
Program Chair:
Marcelo Arenas
Pontificia Universidad Católica de Chile

Copyright © 2018 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Sponsors

SIGMOD: ACM Special Interest Group on Management of Data

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 27 May 2018

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Funded by the Deutsche Forschungsgemeinschaft (DFG German Research Foundation) - SCHW 837/5-1

Conference

SIGMOD/PODS '18

Sponsor:

SIGMOD

SIGMOD/PODS '18: International Conference on Management of Data

June 10 - 15, 2018

TX, Houston, USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

13
Total Citations
View Citations
171
Total Downloads

Downloads (Last 12 months)5
Downloads (Last 6 weeks)1

Reflects downloads up to 04 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Dreier JRossmanith PMarx D(2021)Approximate evaluation of first-order counting queriesProceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3458064.3458168(1720-1739)Online publication date: 10-Jan-2021
https://dl.acm.org/doi/10.5555/3458064.3458168
Carmeli NKröll M(2021)On the Enumeration Complexity of Unions of Conjunctive QueriesACM Transactions on Database Systems10.1145/345026346:2(1-41)Online publication date: 29-May-2021
https://dl.acm.org/doi/10.1145/3450263
Dreier JGorla D(2021)Lacon- and shrub-decompositionsProceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science10.1109/LICS52264.2021.9470680(1-13)Online publication date: 29-Jun-2021
https://dl.acm.org/doi/10.1109/LICS52264.2021.9470680
Capelli FStrozecki Y(2021)Enumerating models of DNF fasterDiscrete Applied Mathematics10.1016/j.dam.2020.02.014303:C(203-215)Online publication date: 15-Nov-2021
https://dl.acm.org/doi/10.1016/j.dam.2020.02.014
Berkholz CGerhardt FSchweikardt N(2020)Constant delay enumeration for conjunctive queriesACM SIGLOG News10.1145/3385634.33856367:1(4-33)Online publication date: 24-Feb-2020
https://dl.acm.org/doi/10.1145/3385634.3385636
Durand ASuciu DTao YWei Z(2020)Fine-Grained Complexity Analysis of Queries: From Decision to Counting and EnumerationProceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3375395.3389130(331-346)Online publication date: 14-Jun-2020
https://dl.acm.org/doi/10.1145/3375395.3389130
Toruńczyk SSuciu DTao YWei Z(2020)Aggregate Queries on Sparse DatabasesProceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3375395.3387660(427-443)Online publication date: 14-Jun-2020
https://dl.acm.org/doi/10.1145/3375395.3387660
Schweikardt NBouyer P(2019)Local normal forms and their use in algorithmic meta theoremsProceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science10.5555/3470152.3470195(1-3)Online publication date: 24-Jun-2019
https://dl.acm.org/doi/10.5555/3470152.3470195
Amarilli ABourhis PMengel SNiewerth MSuciu DSkritek SKoch C(2019)Enumeration on Trees with Tractable Combined Complexity and Efficient UpdatesProceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3294052.3319702(89-103)Online publication date: 25-Jun-2019
https://dl.acm.org/doi/10.1145/3294052.3319702
Carmeli NKröll MSuciu DSkritek SKoch C(2019)On the Enumeration Complexity of Unions of Conjunctive QueriesProceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3294052.3319700(134-148)Online publication date: 25-Jun-2019
https://dl.acm.org/doi/10.1145/3294052.3319700
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents