Abstract
Data words assign to each position a letter from a finite alphabet and a data value from an infinite set. Introduced as an abstraction of paths in XML documents, they recently found applications in querying graph databases as well. Those are actively studied due to applications in such diverse areas as social networks, semantic web, and biological databases. Querying formalisms for graph databases are based on specifying paths conforming to some regular conditions, which led to a study of regular expressions for data words.
Previously studied regular expressions for data words were either rather limited, or had the full expressiveness of register automata, at the expense of a quite unnatural and unintuitive binding mechanism for data values. Our goal is to introduce a natural extension of regular expressions with proper bindings for data values, similar to the notion of freeze quantifiers used in connection with temporal logics over data words, and to study both language-theoretic properties of the resulting class of languages of data words, and their applications in querying graph databases.
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.
References
Abiteboul, S., Buneman, P., Suciu, D.: Data on the Web: From Relations to Semistructured Data and XML. Morgan Kauffman (1999)
Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley (1995)
Abiteboul, S., Vianu, V.: Regular path queries with constraints. JCSS 58, 428–452 (1999)
Angles, R., Gutiérrez, C.: Survey of graph database models. ACM Comput. Surv. 40(1) (2008)
Barceló, P., Figueira, D., Libkin, L.: Graph logics with rational relations and the generalized intersection problem. In: LICS (2012)
Barceló, P., Libkin, L., Lin, A.W., Wood, P.: Expressive languages for path queries over graph-structured data. ACM TODS 37(4) (2012)
Bojanczyk, M.: Automata for Data Words and Data Trees. In: RTA, pp. 1–4 (2010)
Calvanese, D., de Giacomo, G., Lenzerini, M., Vardi, M.Y.: Containment of conjunctive regular path queries with inverse. In: KR 2000, pp. 176–185 (2000)
Calvanese, D., de Giacomo, G., Lenzerini, M., Vardi, M.Y.: Rewriting of regular expressions and regular path queries. JCSS 64(3), 443–465 (2002)
Consens, M.P., Mendelzon, A.O.: GraphLog: a visual formalism for real life recursion. In: PODS 1990, pp. 404–416 (1990)
Cruz, I., Mendelzon, A., Wood, P.: A graphical query language supporting recursion. In: SIGMOD 1987, pp. 323–330 (1987)
Demri, S., Lazić, R.: LTL with the freeze quantifier and register automata. ACM TOCL 10(3) (2009)
Fan, W.: Graph pattern matching revised for social network analysis. In: ICDT 2012, pp. 8–21 (2012)
Figueira, D.: Reasoning on words and trees with data. PhD thesis (2010)
Figueira, D.: Alternating register automata on finite words and trees. Logical Methods in Computer Science 8(1) (2012)
Grumberg, O., Kupferman, O., Sheinvald, S.: Variable automata over infinite alphabets. In: Dediu, A.-H., Fernau, H., Martín-Vide, C. (eds.) LATA 2010. LNCS, vol. 6031, pp. 561–572. Springer, Heidelberg (2010)
Grumberg, O., Kupferman, O., Sheinvald, S.: Variable automata over infinite alphabets (2011) (manuscript)
Gutierrez, C., Hurtado, C., Mendelzon, A.: Foundations of semantic Web databases. J. Comput. Syst. Sci. 77(3), 520–541 (2011)
Kaminski, M., Francez, N.: Finite-memory automata. TCS 134(2), 329–363 (1994)
Kaminski, M., Tan, T.: Regular expressions for languages over infinite alphabets. Fundamenta Informaticae 69(3), 301–318 (2006)
Leser, U.: A query language for biological networks. Bioinformatics 21(suppl. 2), 33–39 (2005)
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)
Milo, R., Shen-Orr, S., et al.: Network motifs: simple building blocks of complex networks. Science 298(5594), 824–827 (2002)
Neven, F., Schwentick, T., Vianu, V.: Finite state machines for strings over infinite alphabets. ACM TOCL 5(3), 403–435 (2004)
Olken, F.: Graph data management for molecular biology. OMICS 7, 75–78 (2003)
Pérez, J., Arenas, M., Gutierrez, C.: Semantics and complexity of SPARQL. ACM TODS 34(3), 1–45 (2009)
Ronen, R., Shmueli, O.: SoQL: a language for querying and creating data in social networks. In: ICDE 2009, pp. 1595–1602 (2009)
San Martín, M., Gutierrez, C.: Representing, querying and transforming social networks with RDF/SPARQL. In: Aroyo, L., et al. (eds.) ESWC 2009. LNCS, vol. 5554, pp. 293–307. Springer, Heidelberg (2009)
Schwentick, T.: A Little Bit Infinite? On Adding Data to Finitely Labelled Structures. In: STACS 2008, pp. 17–18 (2008)
Segoufin, L.: Automata and logics for words and trees over an infinite alphabet. In: Ésik, Z. (ed.) CSL 2006. LNCS, vol. 4207, pp. 41–57. Springer, Heidelberg (2006)
A. Tal. Decidability of Inclusion for Unification Based Automata. M.Sc. thesis (in Hebrew), Technion (1999)
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
Libkin, L., Tan, T., Vrgoč, D. (2013). Regular Expressions with Binding over Data Words for Querying Graph Databases. In: Béal, MP., Carton, O. (eds) Developments in Language Theory. DLT 2013. Lecture Notes in Computer Science, vol 7907. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38771-5_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-38771-5_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38770-8
Online ISBN: 978-3-642-38771-5
eBook Packages: Computer ScienceComputer Science (R0)