Abstract
Graph databases make use of logics that combine traditional first-order features with navigation on paths, in the same way logics for model checking do. However, modern applications of graph databases impose a new requirement on the expressiveness of the logics: they need comparing labels of paths based on word relations (such as prefix, subword, or subsequence). This has led to the study of logics that extend basic graph languages with features for comparing labels of paths based on regular relations or the strictly more powerful rational relations. The evaluation problem for the former logic is decidable (and even tractable in data complexity), but already extending this logic with such a common rational relation as subword or suffix makes evaluation undecidable. In practice, however, it is rare to have the need for such powerful logics. Therefore, it is more realistic to study the complexity of less expressive logics that still allow comparing paths based on practically motivated rational relations. Here we concentrate on the most basic languages, which extend graph pattern logics with path comparisons based only on suffix, subword, or subsequence. We pinpoint the complexity of evaluation for each one of these logics, which shows that all of them are decidable in elementary time (Pspace or NExptime). Furthermore, the extension with suffix is even tractable in data complexity (but the other two are not). In order to obtain our results we establish a link between the evaluation problem for graph logics and two important problems in word combinatorics: word equations with regular constraints and longest common subsequence.
- Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, and Mayank Saksena. 2004. A survey of regular model checking. In Proceedings of the 15th International Conference on Concurrency Theory (CONCUR’04). Lecture Notes in Computer Science, Vol. 3170. 348--360. Google ScholarCross Ref
- Habib Abdulrab and Jean-Pierre Pécuchet. 1989. Solving word equations. J. Symb. Comput. 8, 5 (1989), 499--521. Google ScholarDigital Library
- Renzo Angles and Claudio Gutiérrez. 2008. Survey of graph database models. ACM Comput. Surv. 40, 1 (2008). Google ScholarDigital Library
- Kemafor Anyanwu, Angela Maduko, and Amit P. Sheth. 2007. SPARQ2L: Towards support for subgraph extraction queries in rdf databases. In Proceedings of the 16th International Conference on World Wide Web (WWW’07). 797--806. Google ScholarDigital Library
- Pablo Barceló. 2013. Querying graph databases. In Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS’13). 175--188. Google ScholarDigital Library
- Pablo Barceló, Diego Figueira, and Leonid Libkin. 2013. Graph logics with rational relations. Logic. Methods Comput. Sci. 9, 3 (2013). Google ScholarCross Ref
- Pablo Barceló, Leonid Libkin, Anthony Widjaja Lin, and Peter T. Wood. 2012. Expressive languages for path queries over graph-structured data. ACM Trans. Database Syst. 37, 4 (2012), 31. Google ScholarDigital Library
- Michael Benedikt, Leonid Libkin, Thomas Schwentick, and Luc Segoufin. 2003. Definable relations and first-order query languages over strings. J. ACM 50, 5 (2003), 694--751. Google ScholarDigital Library
- Jean Berstel. 1979. Transductions and Context-Free Languages. Teubner Verlag. Google ScholarCross Ref
- Guillaume Blin, Laurent Bulteau, Minghui Jiang, Pedro J. Tejada, and Stéphane Vialette. 2012. Hardness of longest common subsequence for sequences with bounded run-lengths. In Proceedings of the 23rd Annual Symposium on Combinatorial Pattern Matching (CPM’12). 138--148. Google ScholarDigital Library
- Achim Blumensath and Erich Grädel. 2000. Automatic structures. In 15th Annual IEEE Symposium on Logic in Computer Science (LICS) 2000. 51--62. Google ScholarDigital Library
- Egon Börger, Erich Grädel, and Yuri Gurevich. 1997. The Classical Decision Problem. Springer. Google ScholarCross Ref
- Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, and Moshe Y. Vardi. 2000. Containment of conjunctive regular path queries with inverse. In Proceedings of the 7th International Conference on Principles of Knowledge Representation and Reasoning (KR’00). 176--185. Google ScholarDigital Library
- Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, and Moshe Y. Vardi. 2002. Rewriting of regular expressions and regular path queries. J. Comput. Syst. Sci. 64, 3 (2002), 443--465. Google ScholarDigital Library
- Edmund Clarke, Orna Grumberg, and Doron Peled. 1979. Model Checking. MIT Press, Cambridge, MA.Google Scholar
- Isabel F. Cruz, Alberto O. Mendelzon, and Peter T. Wood. 1987. A graphical query language supporting recursion. In Proceedings of SIGMOD 1987. 323--330. Google ScholarDigital Library
- Volker Diekert, Claudio Gutiérrez, and Christian Hagenah. 2005. The existential theory of equations with rational constraints in free groups is PSPACE-complete. Inf. Comput. 202, 2 (2005), 105--140. Google ScholarDigital Library
- S Eilenberg, C. C Elgot, and J. C Shepherdson. 1969. Sets recognized by n-tape automata. J. Algebra 13, 4 (1969), 447--464. Google ScholarCross Ref
- Diego Figueira and Leonid Libkin. 2015. Path logics for querying graphs: Combining expressiveness and efficiency. In Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2015). 329--340. Google ScholarDigital Library
- Christiane Frougny and Jacques Sakarovitch. 1993. Synchronized rational relations of finite and infinite words. Theor. Comput. Sci. 108, 1 (1993), 45--82. Google ScholarDigital Library
- Dan Gusfield. 1997. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press. Google ScholarDigital Library
- Lucian Ilie. 1999. Subwords and power-free words are not expressible by word equations. Fundam. Inform. 38, 1-2 (1999), 109--118. Google ScholarDigital Library
- Juhani Karhumäki, Filippo Mignosi, and Wojciech Plandowski. 2000. The expressibility of languages and relations by word equations. J. ACM 47, 3 (2000), 483--505. Google ScholarDigital Library
- Dexter Kozen. 1977. Lower bounds for natural proof systems. In 18th Annual Symposium on Foundations of Computer Science (FOCS 1977). 254--266. Google ScholarDigital Library
- André Lentin. 1972. Equations in free monoids. In ICALP. 67--85.Google Scholar
- M. Lothaire. 1997. Combinatorics on Words. Cambridge University Press. Google ScholarCross Ref
- David Maier. 1978. The complexity of some problems on subsequences and supersequences. J. ACM 25, 2 (1978), 322--336. Google ScholarDigital Library
- G.S. Makanin. 1977. The problem of solvability of equations in free semigroups. Math USSR SBornik 32 (1977), 129--198. Google ScholarCross Ref
- Wojciech Plandowski. 2004. Satisfiability of word equations with constants is in PSPACE. J. ACM 51, 3 (2004), 483--496. Google ScholarDigital Library
- Jacques Sakarovitch. 2009. Elements of Automata Theory. Cambridge University Press. Google ScholarDigital Library
- Klaus U. Schulz. 1990. Makanin’s algorithm for word equations: Two improvements and a generalization. In Word Equations and Related Topics, First International Workshop (IWWERT’90). 85--150. Google ScholarDigital Library
- Anthony Widjaja To and Leonid Libkin. 2010. Algorithmic metatheorems for decidable LTL model checking over infinite systems. In Proceedings of the 13th International Conference on Foundations of Software Science and Computational Structures (FOSSACS’10). 221--236. Google ScholarDigital Library
- Moshe Y. Vardi. 1982. The complexity of relational query languages (extended abstract). In Proceedings of the 14th Annual ACM Symposium on Theory of Computing (STOC’82). 137--146. Google ScholarDigital Library
- Peter T. Wood. 2012. Query languages for graph databases. SIGMOD Rec. 41, 1 (2012), 50--60. Google ScholarDigital Library
- Fang Yu, Tevfik Bultan, and Oscar H. Ibarra. 2011. Relational string verification using multi-track automata. Int. J. Found. Comput. Sci. 22, 8 (2011), 1909--1924. Google ScholarCross Ref
Index Terms
- Graph Logics with Rational Relations: The Role of Word Combinatorics
Recommendations
Graph logics with rational relations: the role of word combinatorics
CSL-LICS '14: Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)Graph databases make use of logics that combine traditional first-order features with navigation on paths, in the same way logics for model checking do. However, modern applications of graph databases impose a new requirement on the expressiveness of ...
Graph Logics with Rational Relations and the Generalized Intersection Problem
LICS '12: Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer ScienceWe investigate some basic questions about the interaction of regular and rational relations on words. The primary motivation comes from the study of logics for querying graph topology, which have recently found numerous applications. Such logics use ...
Uniform strategies, rational relations and jumping automata
A general concept of uniform strategies has recently been proposed as a relevant notion in game theory for computer science, which subsumes various notions from the literature. It relies on properties involving sets of plays in two-player turn-based ...
Comments