On the Complexity of Enumerating the Answers to Well-Designed Pattern Trees

Well-designed pattern trees (wdPTs) have been introduced as an extension of conjunctive queries to allow for partial matching - analogously to the OPTIONAL operator of the semantic web query language SPARQL. Several computational problems of wdPTs have been studied in recent years, such as the evaluation problem in various settings, the counting problem, as well as static analysis tasks including the containment and equivalence problems. Also restrictions needed to achieve tractability of these tasks have been proposed. In contrast, the problem of enumerating the answers to a wdPT has been largely ignored so far. In this work, we embark on a systematic study of the complexity of the enumeration problem of wdPTs. As our main result, we identify several tractable and intractable cases of this problem both from a classical complexity point of view and from a parameterized complexity point of view.

[1]  Phokion G. Kolaitis,et al.  Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics , 2002, CP.

[2]  Mihalis Yannakakis,et al.  On Generating All Maximal Independent Sets , 1988, Inf. Process. Lett..

[3]  Martin Grohe,et al.  The complexity of homomorphism and constraint satisfaction problems seen from the other side , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[4]  Phokion G. Kolaitis,et al.  The Complexity of Mining Maximal Frequent Subgraphs , 2014, ACM Trans. Database Syst..

[5]  Jörg Flum,et al.  Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.

[6]  Nadia Creignou,et al.  On Generating All Solutions of Generalized Satisfiability Problems , 1997, RAIRO Theor. Informatics Appl..

[7]  Yehoshua Sagiv,et al.  Full disjunctions: polynomial-delay iterators in action , 2006, VLDB.

[8]  Reinhard Pichler,et al.  Containment and equivalence of well-designed SPARQL , 2014, PODS.

[9]  François Le Gall,et al.  Powers of tensors and fast matrix multiplication , 2014, ISSAC.

[10]  Reinhard Pichler,et al.  Towards Reconciling SPARQL and Certain Answers , 2015, WWW.

[11]  Mihalis Yannakakis,et al.  On the Complexity of Database Queries , 1999, J. Comput. Syst. Sci..

[12]  Luc Segoufin,et al.  First-order queries on classes of structures with bounded expansion , 2018, Log. Methods Comput. Sci..

[13]  Georg Gottlob,et al.  Hypertree decompositions and tractable queries , 1998, J. Comput. Syst. Sci..

[14]  Marcelo Arenas,et al.  Semantics and Complexity of SPARQL , 2006, International Semantic Web Conference.

[15]  Arne Meier,et al.  Paradigms for Parameterized Enumeration , 2013, MFCS.

[16]  Heribert Vollmer,et al.  Parameterized Complexity of Weighted Satisfiability Problems: Decision, Enumeration, Counting , 2015, Fundam. Informaticae.

[17]  Arnaud Durand,et al.  On Acyclic Conjunctive Queries and Constant Delay Enumeration , 2007, CSL.

[18]  Reinhard Pichler,et al.  Efficient Evaluation and Approximation of Well-designed Pattern Trees , 2015, PODS.

[19]  Matthieu Latapy,et al.  Main-memory triangle computations for very large (sparse (power-law)) graphs , 2008, Theor. Comput. Sci..

[20]  Martha Sideri,et al.  Generating all maximal models of a Boolean expression , 2000, Inf. Process. Lett..

[21]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[22]  Luc Segoufin,et al.  Enumerating with constant delay the answers to a query , 2013, ICDT '13.

[23]  Luc Segoufin.  A glimpse on constant delay enumeration (Invited Talk) , 2014, STACS.

[24]  Anand Rajaraman,et al.  Conjunctive query containment revisited , 1997, Theor. Comput. Sci..

[25]  Nicole Schweikardt,et al.  Enumerating answers to first-order queries over databases of low degree , 2014, PODS.

[26]  Georg Gottlob,et al.  The complexity of acyclic conjunctive queries , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[27]  E. Prud hommeaux,et al.  SPARQL query language for RDF , 2011 .

[28]  Yann Strozecki,et al.  Enumeration complexity and matroid decomposition , 2010 .

[29]  Egor V. Kostylev,et al.  CONSTRUCT Queries in SPARQL , 2015, ICDT.

[30]  Serge Abiteboul,et al.  Foundations of Databases , 1994 .

[31]  Mihalis Yannakakis,et al.  Algorithms for Acyclic Database Schemes , 1981, VLDB.

[32]  Reinhard Pichler,et al.  On the Hardness of Counting the Solutions of SPARQL Queries , 2014, AMW.