skip to main content
10.1145/2463664.2463667acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
research-article

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

Published:22 June 2013Publication History

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.

References

  1. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison Wesley, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Noga Alon, Raphael Yuster, and Uri Zwick. Color-Coding. J. ACM, 42(4):844--856, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Stefan Arnborg, Jens Lagergren, and Detlef Seese. Easy Problems for Tree-Decomposable Graphs. J. of Algorithms, 12(2):308--340, 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  5. 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 ScholarGoogle Scholar
  6. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  7. 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 ScholarGoogle ScholarCross RefCross Ref
  8. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  9. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  10. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  11. 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 ScholarGoogle Scholar
  12. Martin Grohe and Stephan Kreutzer. Model Theoretic Methods in Finite Combinatorics, chapter Methods for Algorithmic Meta Theorems. American Mathematical Society, 2011.Google ScholarGoogle Scholar
  13. Wojciech Kazana and Luc Segoufin. First-order query evaluation on structures of bounded degree. Logical Methods in Computer Science (LMCS), 7(2), 2011.Google ScholarGoogle Scholar
  14. Wojciech Kazana and Luc Segoufin. Enumeration of monadic second-order queries on trees. ACM Trans. on Computational Logic (ToCL), to appear.Google ScholarGoogle Scholar
  15. Stephan Kreutzer and Anuj Dawar. Parameterized complexity of first-order logic. Electronic Colloquium on Computational Complexity (ECCC), 16:131, 2009.Google ScholarGoogle Scholar
  16. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  17. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  18. Jaroslav Nešetřil and Patrice Ossona de Mendez. On nowhere dense graphs. European J. of Combinatorics, 32(4):600--617, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  20. Detlef Seese. Linear Time Computable Problems and First-Order Descriptions. Mathematical Structures in Computer Science, 6(6):505--526, 1996.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

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

        Recommendations

        Comments

        Login options

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

        Sign in
        • Published in

          cover image ACM Conferences
          PODS '13: Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGAI symposium on Principles of database systems
          June 2013
          334 pages
          ISBN:9781450320665
          DOI:10.1145/2463664
          • General Chair:
          • Richard Hull,
          • Program Chair:
          • Wenfei Fan

          Copyright © 2013 ACM

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 22 June 2013

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article

          Acceptance Rates

          PODS '13 Paper Acceptance Rate24of97submissions,25%Overall Acceptance Rate476of1,835submissions,26%

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader
        About Cookies On This Site

        We use cookies to ensure that we give you the best experience on our website.

        Learn more

        Got it!