research-article

Expressive languages for path queries over graph-structured data

Authors:

Carlos Hurtado,

Peter WoodAuthors Info & Claims

PODS '10: Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems

Pages 3 - 14

https://doi.org/10.1145/1807085.1807089

Published: 06 June 2010 Publication History

Abstract

For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.), the power of standard languages such as the widely studied conjunctive regular path queries (CRPQs) is insufficient in at least two ways. First, they cannot output paths and second, more crucially, they cannot express relations among paths.

We thus propose a class of extended CRPQs, called ECRPQs, which add regular relations on tuples of paths, and allow path variables in the heads of queries. We provide several examples of their usefulness in querying graph structured data, and study their properties. We analyze query evaluation and representation of tuples of paths in the output by means of automata. We present a detailed analysis of data and combined complexity of queries, and consider restrictions that lower the complexity of ECRPQs to that of relational conjunctive queries. We study the containment problem, and look at further extensions with first-order features, and with non-regular relations that express arithmetic properties of paths, based on the lengths and numbers of occurrences of labels.

References

[1]

P. A. Abdulla, B. Jonsson, M. Nilsson, M. Saksena. A survey of regular model checking. In CONCUR'04, pages 35--48.

[2]

S. Abiteboul, D. Quass, J. McHugh, J.Widom, J. L. Wiener. The LOREL query language for semistructured data. Int. J. Digit. Libr., 1(1):68--88, 1997.

[3]

S. Abiteboul, P. Buneman, D. Suciu. Data on the web: From relations to semistructured data and XML. Morgan Kauffman, 1999.

Digital Library

[4]

A. V. Aho. Algorithms for finding patterns in strings. In Handbook of TCS, Vol. A, pages 255--300, 1990.

Digital Library

[5]

K. Anyanwu, A. P. Sheth. Á-Queries: enabling querying for semantic associations on the semantic web. In WWW'03, pages 690--699.

Digital Library

[6]

C. L. Barrett, R. Jacob, M. V. Marathe. Formal-language-constrained path problems. SIAM J. Comput., 30(3):809--837, 2000.

Digital Library

[7]

M. Benedikt, L. Libkin, T. Schwentick, L. Segoufin. Definable relations and first-order query languages over strings. JACM, 50(5):694--751, 2003.

Digital Library

[8]

A. Blumensath, E. Gradel. Automatic structures. In LICS'00, pages 51--62.

Digital Library

[9]

V. Bruyere, G. Hansel, C. Michaux, R. Villemaire. Logic and p-recognizable sets of integers. Bull. Belg. Math. Society, 1:191--238, 1994.

[10]

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

[11]

D. Calvanese, G. de Giacomo, M. Lenzerini, M. Y. Vardi. Rewriting of regular expressions and regular path queries. JCSS, 64(3):443--465, 2002.

Digital Library

[12]

M. Chrobak. Finite automata and unary languages. Theor. Comput. Sci., 47(2):149--158, 1986.

Digital Library

[13]

M. P. Consens, A. O. Mendelzon. GraphLog: a visual formalism for real life recursion. In PODS'90, pages 404--416.

Digital Library

[14]

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

Digital Library

[15]

C. Elgot, J. Mezei. On relations defined by generalized finite automata. IBM Journal Research Develop, 9(1):47--68, 1965.

Digital Library

[16]

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

Digital Library

[17]

D. D. Freydenberger, D. Reidenbach. Bad news on decision problems for patterns. Information and Computation, 208(1):83--96, 2010.

Digital Library

[18]

C. Frougny, J. Sakarovitch. Rational relations with bounded delay. In STACS'91, pages 50--63.

Digital Library

[19]

G. Grahne, A. Thomo. Query answering and containment for regular path queries under distortions. In FoIKS'04, pages 98--115.

[20]

D. Gusfield. Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press, 1997.

Digital Library

[21]

D. A. Holland, U. Braun, D. Maclean, K.-K. Muniswamy-Reddy, M. I. Seltzer. Choosing a data model and query language for provenance. In Int. Provenance and Annotation Workshop, 2008.

[22]

O. Ibarra, J. Su, Z. Dang, T. Bultan, R. Kemmerer. Counter machines and verification problems. Theor. Comput. Sci., 289(1):165--189, 2002.

Digital Library

[23]

Y. Kanza, Y. Sagiv. Flexible queries over semistructured data. In PODS'01, pages 40--51.

Digital Library

[24]

K. Kochut, M. Janik. SPARQLeR: Extended SPARQL for semantic association discovery. In ESWC'07, pages 145--159.

Digital Library

[25]

D. Kozen. Lower bounds for natural proof systems. In FOCS'77, pages 254--266.

Digital Library

[26]

W.-J. Lee, L. Raschid, P. Srinivasan, N. Shah, D. L. Rubin, N. F. Noy. Using annotations from controlled vocabularies to find meaningful associations. In Proc. Workshop on Data Integr. in Life Sciences, pages 247--263, 2007.

Digital Library

[27]

J. Lehmann, J. Schuppel, and S. Auer. Discovering unknown connections--the DBpedia relationship finder. In Conf. on Social Semantic Web, pages 99--110, 2007.

[28]

H. W. Lenstra. Integer programming in a fixed number of variables. Math. Oper. Res., 8(4):538--548, 1983.

Digital Library

[29]

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

Digital Library

[30]

T. Milo, D. Suciu. Index structures for path expressions. In ICDT'99, pages 277--295.

Digital Library

[31]

C. H. Papadimitriou. On the complexity of integer programming. JACM, 28(4):765--768, 1981.

Digital Library

[32]

A. Sheth et al. Semantic association identification and knowledge discovery for national security applications. J. Database Management, 16(1):33--53, 2005.

[33]

A.W. To. Unary finite automata vs. arithmetic progressions. IPL, 109(17):1010--1014, 2009.

Digital Library

[34]

A.W. To. Model checking FO(R) over one-counter processes and beyond. In CSL'09, pages 485--499.

Digital Library

[35]

K. N. Verma, H. Seidl, T. Schwentick. On the complexity of equational Horn clauses. In CADE'05, pages 337--352.

Digital Library

[36]

G. Weikum, G. Kasneci, M. Ramanath, and F. Suchanek. Database and information-retrieval methods for knowledge discovery. Commun. ACM, 52(4):56--64, 2009.

Digital Library

Cited By

Schneider TŠimkus M(2020)Ontologies and Data Management: A Brief SurveyKI - Künstliche Intelligenz10.1007/s13218-020-00686-334:3(329-353)Online publication date: 13-Aug-2020
https://doi.org/10.1007/s13218-020-00686-3
Zhang XÖzsu M(2019)Correlation constraint shortest path over large multi-relation graphsProceedings of the VLDB Endowment10.14778/3303753.330375612:5(488-501)Online publication date: 1-Jan-2019
https://dl.acm.org/doi/10.14778/3303753.3303756
Poulovassilis A(2018)Applications of Flexible Querying to Graph DataGraph Data Management10.1007/978-3-319-96193-4_4(97-142)Online publication date: 1-Nov-2018
https://doi.org/10.1007/978-3-319-96193-4_4
Show More Cited By

Index Terms

Expressive languages for path queries over graph-structured data
1. Information systems
  1. Data management systems
    1. Database design and models
2. Theory of computation
  1. Formal languages and automata theory

Recommendations

Expressive Languages for Path Queries over Graph-Structured Data

For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.), the power of standard languages such as the widely studied conjunctive ...
Expressiveness and static analysis of extended conjunctive regular path queries

We study the expressiveness and the complexity of static analysis of extended conjunctive regular path queries (ECRPQs), introduced by Barcelo et al. (2010) [3]. ECRPQs are an extension of conjunctive regular path queries (CRPQs), a well-studied ...
View-based query processing: On the relationship between rewriting, answering and losslessness

As a result of the extensive research in view-based query processing, three notions have been identified as fundamental, namely rewriting, answering, and losslessness. Answering amounts to computing the tuples satisfying the query in all databases ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PODS '10: Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems

June 2010

350 pages

ISBN:9781450300339

DOI:10.1145/1807085

General Chair:
Jan Paredaens
University of Antwerp, Belgium
,
Program Chair:
Dirk Van Gucht
Indiana University, USA

Copyright © 2010 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]

Sponsors

SIGMOD: ACM Special Interest Group on Management of Data

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 06 June 2010

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

SIGMOD/PODS '10

Sponsor:

SIGMOD

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

June 6 - 11, 2010

Indiana, Indianapolis, USA

Acceptance Rates

PODS '10 Paper Acceptance Rate 27 of 113 submissions, 24%;

Overall Acceptance Rate 642 of 2,707 submissions, 24%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

41
Total Citations
View Citations
415
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)0

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Schneider TŠimkus M(2020)Ontologies and Data Management: A Brief SurveyKI - Künstliche Intelligenz10.1007/s13218-020-00686-334:3(329-353)Online publication date: 13-Aug-2020
https://doi.org/10.1007/s13218-020-00686-3
Zhang XÖzsu M(2019)Correlation constraint shortest path over large multi-relation graphsProceedings of the VLDB Endowment10.14778/3303753.330375612:5(488-501)Online publication date: 1-Jan-2019
https://dl.acm.org/doi/10.14778/3303753.3303756
Poulovassilis A(2018)Applications of Flexible Querying to Graph DataGraph Data Management10.1007/978-3-319-96193-4_4(97-142)Online publication date: 1-Nov-2018
https://doi.org/10.1007/978-3-319-96193-4_4
Polleres A(2018)SPARQLEncyclopedia of Social Network Analysis and Mining10.1007/978-1-4939-7131-2_124(2865-2872)Online publication date: 12-Jun-2018
https://doi.org/10.1007/978-1-4939-7131-2_124
Firth HMissier P(2017)TAPERDistributed and Parallel Databases10.1007/s10619-017-7196-y35:2(85-115)Online publication date: 1-Jun-2017
https://dl.acm.org/doi/10.1007/s10619-017-7196-y
Polleres A(2017)SPARQLEncyclopedia of Social Network Analysis and Mining10.1007/978-1-4614-7163-9_124-1(1-8)Online publication date: 1-Sep-2017
https://doi.org/10.1007/978-1-4614-7163-9_124-1
Johnson TKanza YLakshmanan LShkapenyuk VArora ARoy SMehta S(2016)NepalProceedings of the 1st ACM SIGMOD Workshop on Network Data Analytics10.1145/2980523.2980530(1-8)Online publication date: 1-Jul-2016
https://dl.acm.org/doi/10.1145/2980523.2980530
Fan WWang XWu Y(2016)Answering Pattern Queries Using ViewsIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2015.242913828:2(326-341)Online publication date: 1-Feb-2016
https://dl.acm.org/doi/10.1109/TKDE.2015.2429138
Ma SLi JHu CLin XHuai J(2016)Big graph searchFrontiers of Computer Science: Selected Publications from Chinese Universities10.1007/s11704-015-4515-110:3(387-398)Online publication date: 1-Jun-2016
https://dl.acm.org/doi/10.1007/s11704-015-4515-1
Huang XBao ZDavidson SMilo TYuan X(2015)Answering regular path queries on workflow provenance2015 IEEE 31st International Conference on Data Engineering10.1109/ICDE.2015.7113299(375-386)Online publication date: Apr-2015
https://doi.org/10.1109/ICDE.2015.7113299
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