Regular Expressions with Binding over Data Words for Querying Graph Databases
Journal
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Journal Volume
7907 LNCS
Pages
325-337
Date Issued
2013
Author(s)
Libkin, Leonid
Vrgoc, Domagoj
TONY TAN
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. © 2013 Springer-Verlag.
SDGs
Other Subjects
Binding mechanisms; Biological database; Data values; Finite alphabet; Freeze quantifiers; Graph database; Natural extension; Regular expressions; Automata theory; Computer programming languages; Database systems; Graph theory; Object oriented programming; Pattern matching
Type
conference paper