research-article

Definability problems for graph query languages

Authors:

Timos Antonopoulos,

Frédéric ServaisAuthors Info & Claims

ICDT '13: Proceedings of the 16th International Conference on Database Theory

Pages 141 - 152

https://doi.org/10.1145/2448496.2448514

Published: 18 March 2013 Publication History

Abstract

Given a graph, a relation on its nodes, and a query language Q of interest, we study the Q-definability problem which amounts to deciding whether there exists a query in Q defining precisely the given relation over the given graph. Previous research has identified the complexity of FO- and CQ-definability. In this paper, we consider the definability problem for regular paths and conjunctive regular path queries (CRPQs) over labelled graphs.

References

[1]

S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.

Digital Library

[2]

F. Bancilhon. On the completeness of query languages for relational data bases. In MFCS, pages 112--123. Springer, 1978.

[3]

P. Barceló, C. A. Hurtado, L. Libkin, and P. T. Wood. Expressive languages for path queries over graph-structured data. In PODS, pages 3--14. ACM, 2010.

Digital Library

[4]

P. Barceló, L. Libkin, and J. L. Reutter. Querying graph patterns. In PODS, pages 199--210. ACM, 2011.

Digital Library

[5]

P. Barceló, J. Pérez, and J. L. Reutter. Relative expressiveness of nested regular expressions. In AMW, pages 180--195. CEUR-WS.org, 2012.

[6]

G. J. Bex, W. Gelade, F. Neven, and S. Vansummeren. Learning deterministic regular expressions for the inference of schemas from XML data. ACM Transactions on the Web, 4(4), 2010.

Digital Library

[7]

G. J. Bex, F. Neven, T. Schwentick, and S. Vansummeren. Inference of concise regular expressions and DTDs. ACM Transactions on Database Systems, 35(2), 2010.

Digital Library

[8]

P. Buneman, W. Fan, and S. Weinstein. Query optimization for semistructured data using path constraints in a deterministic data model. In DBPL, pages 208--223, 2000.

Digital Library

[9]

D. Calvanese, G. D. Giacomo, M. Lenzerini, and M. Y. Vardi. Containment of conjunctive regular path queries with inverse. In KR, pages 176--185, 2000.

[10]

D. Colazzo, G. Ghelli, and C. Sartiani. Efficient inclusion for a class of XML types with interleaving and counting. Inf. Syst., 34(7):643--656, 2009.

Digital Library

[11]

N. Creignou, P. G. Kolaitis, and B. Zanuttini. Structure identification of boolean relations and plain bases for co-clones. J. Comput. Syst. Sci., 74(7):1103--1115, 2008.

Digital Library

[12]

V. Dalmau. Computational complexity of problems over generalized formulas, 2000. PhD thesis, Universitat Politécnica de Catalunya.

[13]

R. Dechter and J. Pearl. Structure identification in relational data. Artif. Intell., 58(1--3):237--270, 1992.

Digital Library

[14]

A. Deutsch and V. Tannen. Optimization properties for classes of conjunctive regular path queries. In DBPL, pages 21--39. Springer, 2001.

Digital Library

[15]

G. H. L. Fletcher, M. Gyssens, D. Leinders, J. V. den Bussche, D. V. Gucht, S. Vansummeren, and Y. Wu. Relative expressive power of navigational querying on graphs. In ICDT, pages 197--207. ACM, 2011.

Digital Library

[16]

G. H. L. Fletcher, M. Gyssens, J. Paredaens, and D. V. Gucht. On the expressive power of the relational algebra on finite sets of relation pairs. IEEE Trans. Knowl. Data Eng., 21(6):939--942, 2009.

Digital Library

[17]

D. Florescu, A. Y. Levy, and D. Suciu. Query containment for conjunctive queries with regular expressions. In PODS, pages 139--148, 1998.

Digital Library

[18]

F. Geerts and A. Poggi. On database query languages for k-relations. J. Applied Logic, 8(2):173--185, 2010.

[19]

T. J. Green, G. Karvounarakis, and V. Tannen. Provenance semirings. In PODS 2007, pages 31--40. ACM, 2007.

Digital Library

[20]

S. Harris and A. Seaborne. SPARQL 1.1 query language. Tech. report, World Wide Web Consortium (W3C), January 2012.

[21]

J. Hellings, B. Kuijpers, J. Van den Bussche, and X. Zhang. Walk logic as a framework for path query languages on graph databases. ICDT, 2013.

Digital Library

[22]

P. Jeavons, D. A. Cohen, and M. Gyssens. How to determine the expressive power of constraints. Constraints, 4(2):113--131, 1999.

Digital Library

[23]

D. Kozen. Lower bounds for natural proof systems. In FOCS, pages 254--266. IEEE Computer Society, 1977.

Digital Library

[24]

L. Libkin and D. Vrgoc. Regular path queries on graphs with data. In ICDT, pages 74--85. ACM, 2012.

Digital Library

[25]

K. Losemann and W. Martens. The complexity of evaluating path expressions in SPARQL. In PODS, pages 101--112. ACM, 2012.

Digital Library

[26]

A. O. Mendelzon and P. T. Wood. Finding regular simple paths in graph databases. SIAM J. Comput., 24(6):1235--1258, 1995.

Digital Library

[27]

J. Paredaens. On the expressive power of the relational algebra. Inf. Process. Lett., 7(2):107--111, 1978.

[28]

L. J. Stockmeyer and A. R. Meyer. Word problems requiring exponential time: Preliminary report. In STOC, pages 1--9. ACM, 1973.

Digital Library

[29]

B. ten Cate. Notes on AIM CSP workshop,³ 2008.

[30]

B. ten Cate and V. Dalmau. A note on the product homomorphism problem and CQ-definability. Manuscript, 2012. http://arxiv.org/abs/1212.3534

[31]

R. Willard. Testing expressibility is hard. In CP, pages 9--23. Springer, 2010

Digital Library

Cited By

Amendola GManna MRicioppo A(2024)A logic-based framework for characterizing nexus of similarity within knowledge basesInformation Sciences: an International Journal10.1016/j.ins.2024.120331664:COnline publication date: 1-Apr-2024
https://dl.acm.org/doi/10.1016/j.ins.2024.120331
Li BLiu XDong BWang WZhang B(2023)Personalized Rumor Refutation Through Graph Regular Pattern2023 IEEE 8th International Conference on Big Data Analytics (ICBDA)10.1109/ICBDA57405.2023.10104992(165-174)Online publication date: 3-Mar-2023
https://doi.org/10.1109/ICBDA57405.2023.10104992
Cima GCroce FLenzerini MDemartini GZuccon GCulpepper JHuang ZTong H(2021)Query Definability and Its Approximations in Ontology-based Data ManagementProceedings of the 30th ACM International Conference on Information & Knowledge Management10.1145/3459637.3482466(271-280)Online publication date: 26-Oct-2021
https://dl.acm.org/doi/10.1145/3459637.3482466
Show More Cited By

Index Terms

Definability problems for graph query languages
1. Information systems
  1. Data management systems
    1. Database management system engines
      1. Database query processing
    2. Query languages
  2. Information systems applications
2. Theory of computation
  1. Theory and algorithms for application domains
    1. Database theory
      1. Database query processing and optimization (theory)

Recommendations

Practical and comprehensive formalisms for modelling contemporary graph query languages
Abstract
The industry-wide adoption of graph databases has been hindered due to the fragmentation in syntax and semantics of available graph query languages. As a result, several projects have been proposed by industry and academia to develop a ...
Highlights
- There is a lack of explicit mapping between practical graph query languages and theoretical language formalisms.
Regularity problems for visibly pushdown languages
STACS'06: Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science

Visibly pushdown automata are special pushdown automata whose stack behavior is driven by the input symbols according to a partition of the alphabet. We show that it is decidable for a given visibly pushdown automaton whether it is equivalent to a ...
Query languages for data exchange: beyond unions of conjunctive queries
ICDT '09: Proceedings of the 12th International Conference on Database Theory

The class of unions of conjunctive queries (UCQ) has been shown to be particularly well-behaved for data exchange; its certain answers can be computed in polynomial time (in terms of data complexity). However, this is not the only class with this ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

ICDT '13: Proceedings of the 16th International Conference on Database Theory

March 2013

301 pages

ISBN:9781450315982

DOI:10.1145/2448496

Editors:
Wang-Chiew Tan
UC Santa Cruz
,
Giovanna Guerrini
Universita' di Genova, Italy
,
Barbara Catania
Universita' di Genova, Italy
,
Anastasios Gounaris
Aristotle University of Thessaloniki, Greece

Copyright © 2013 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 ACM 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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 18 March 2013

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article

Funding Sources

Seventh Framework Programme

Conference

EDBT/ICDT '13

EDBT/ICDT '13: Joint 2013 EDBT/ICDT Conferences

March 18 - 22, 2013

Genoa, Italy

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

11
Total Citations
View Citations
169
Total Downloads

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

Reflects downloads up to 23 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Amendola GManna MRicioppo A(2024)A logic-based framework for characterizing nexus of similarity within knowledge basesInformation Sciences: an International Journal10.1016/j.ins.2024.120331664:COnline publication date: 1-Apr-2024
https://dl.acm.org/doi/10.1016/j.ins.2024.120331
Li BLiu XDong BWang WZhang B(2023)Personalized Rumor Refutation Through Graph Regular Pattern2023 IEEE 8th International Conference on Big Data Analytics (ICBDA)10.1109/ICBDA57405.2023.10104992(165-174)Online publication date: 3-Mar-2023
https://doi.org/10.1109/ICBDA57405.2023.10104992
Cima GCroce FLenzerini MDemartini GZuccon GCulpepper JHuang ZTong H(2021)Query Definability and Its Approximations in Ontology-based Data ManagementProceedings of the 30th ACM International Conference on Information & Knowledge Management10.1145/3459637.3482466(271-280)Online publication date: 26-Oct-2021
https://dl.acm.org/doi/10.1145/3459637.3482466
Barceló PBaumgartner ADalmau VKimelfeld BSuciu DSkritek SKoch C(2019)Regularizing Conjunctive Features for ClassificationProceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3294052.3319680(2-16)Online publication date: 25-Jun-2019
https://dl.acm.org/doi/10.1145/3294052.3319680
Bonifati AFletcher GVoigt HYakovets N(2018)Querying GraphsSynthesis Lectures on Data Management10.2200/S00873ED1V01Y201808DTM05110:3(1-184)Online publication date: Oct-2018
https://doi.org/10.2200/S00873ED1V01Y201808DTM051
Laure BAngela BTova M(2018)Machine Learning to Data Management: A Round Trip2018 IEEE 34th International Conference on Data Engineering (ICDE)10.1109/ICDE.2018.00226(1735-1738)Online publication date: Apr-2018
https://doi.org/10.1109/ICDE.2018.00226
Cohen SMilo TTan W(2016)Data Management for Social NetworkingProceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/2902251.2902306(165-177)Online publication date: 15-Jun-2016
https://dl.acm.org/doi/10.1145/2902251.2902306
Cohen SWeiss Y(2016)The Complexity of Learning Tree Patterns from Example GraphsACM Transactions on Database Systems10.1145/289049241:2(1-44)Online publication date: 11-May-2016
https://dl.acm.org/doi/10.1145/2890492
Arenas MDiaz G(2016)The Exact Complexity of the First-Order Logic Definability ProblemACM Transactions on Database Systems10.1145/288609541:2(1-14)Online publication date: 11-May-2016
https://dl.acm.org/doi/10.1145/2886095
Arenas MDiaz GKostylev EBourdeau JHendler JNkambou RHorrocks IZhao B(2016)Reverse Engineering SPARQL QueriesProceedings of the 25th International Conference on World Wide Web10.1145/2872427.2882989(239-249)Online publication date: 11-Apr-2016
https://dl.acm.org/doi/10.1145/2872427.2882989
Show More Cited By

View Options

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