Abstract
Graph data models have recently become popular owing to their applications, e.g., in social networks, semantic web. Typical navigational query languages over graph databases — such as Conjunctive Regular Path Queries (CRPQs) — cannot express relevant properties of the interaction between the underlying data and the topology. Two languages have been recently proposed to overcome this problem: walk logic (WL) and regular expressions with memory (REM). In this paper, we begin by investigating fundamental properties of WL and REM, i.e., complexity of evaluation problems and expressive power. We first show that the data complexity of WL is nonelementary, which rules out its practicality. On the other hand, while REM has low data complexity, we point out that many natural data/topology properties of graphs expressible in WL cannot be expressed in REM. To this end, we propose register logic, an extension of REM, which we show to be able to express many natural graph properties expressible in WL, while at the same time preserving the elementariness of data complexity of REMs. It is also incomparable in expressive power against WL.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Angles, R., Gutiérrez, C.: Survey of graph database models. ACM Comput. Surv. 40(1) (2008)
Barceló, P.: Querying graph databases. In: PODS, pp. 175–188 (2013)
Barceló, P., Pérez, J., Reutter, J.L.: Relative expressiveness of nested regular expressions. In: AMW, pp. 180–195 (2012)
Barceló, P., Libkin, L., Lin, A.W., Wood, P.T.: Expressive languages for path queries over graph-structured data. ACM Trans. Database Syst. 37(4), 31 (2012)
Clarke, E.M., Grumberg, O., Peled, D.A.: Model checking. MIT Press (2000)
Cruz, I., Mendelzon, A.O., Wood, P.T.: A graphical query language supporting recursion. In: SIGMOD, pp. 323–330 (1987)
Hellings, J., Kuijpers, B., van den Bussche, J., Zhang, X.: Walk logic as a framework for path query languages on graph databases. In: ICDT, pp. 117–128 (2013)
Kaminski, M., Francez, N.: Finite memory automata. TCS 134(2), 329–363 (1994)
Libkin, L., Vrgoč, D.: Regular path queries on graphs with data. In: ICDT 2012, pp. 74–85 (2012)
Libkin, L., Vrgoč, D.: Regular expressions for data words. In: Bjørner, N., Voronkov, A. (eds.) LPAR-18 2012. LNCS, vol. 7180, pp. 274–288. Springer, Heidelberg (2012)
Libkin, L., Reutter, J.L., Vrgoc, D.: Trial for RDF: adapting graph query languages for RDF data. In: PODS, pp. 201–212 (2013)
Mendelzon, A.O., Wood, P.T.: Finding regular simple paths in graph databases. SIAM J. Comput. 24(6), 1235–1258 (1995)
Robertson, L.E.: Structure of complexity in the weak monadic second-order theories of the natural numbers. In: STOC, pp. 161–171 (1974)
Stockmeyer, L.: The complexity of decision problems in automata theory and logic. Ph.D. thesis. MIT (1974)
Vardi, M.Y.: The complexity of relational query languages. In: STOC, pp. 137–146 (1982)
Wood, P.T.: Query languages for graph databases. SIGMOD Record 41(1), 50–60 (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barceló, P., Fontaine, G., Lin, A.W. (2013). Expressive Path Queries on Graphs with Data. In: McMillan, K., Middeldorp, A., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2013. Lecture Notes in Computer Science, vol 8312. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45221-5_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-45221-5_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-45220-8
Online ISBN: 978-3-642-45221-5
eBook Packages: Computer ScienceComputer Science (R0)