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.
- P. A. Abdulla, B. Jonsson, M. Nilsson, M. Saksena. A survey of regular model checking. In CONCUR'04, pages 35--48.Google Scholar
- 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.Google Scholar
Cross Ref
- S. Abiteboul, P. Buneman, D. Suciu. Data on the web: From relations to semistructured data and XML. Morgan Kauffman, 1999. Google Scholar
Digital Library
- A. V. Aho. Algorithms for finding patterns in strings. In Handbook of TCS, Vol. A, pages 255--300, 1990. Google Scholar
Digital Library
- K. Anyanwu, A. P. Sheth. Á-Queries: enabling querying for semantic associations on the semantic web. In WWW'03, pages 690--699. Google Scholar
Digital Library
- C. L. Barrett, R. Jacob, M. V. Marathe. Formal-language-constrained path problems. SIAM J. Comput., 30(3):809--837, 2000. Google Scholar
Digital Library
- M. Benedikt, L. Libkin, T. Schwentick, L. Segoufin. Definable relations and first-order query languages over strings. JACM, 50(5):694--751, 2003. Google Scholar
Digital Library
- A. Blumensath, E. Gradel. Automatic structures. In LICS'00, pages 51--62. Google Scholar
Digital Library
- V. Bruyere, G. Hansel, C. Michaux, R. Villemaire. Logic and p-recognizable sets of integers. Bull. Belg. Math. Society, 1:191--238, 1994.Google Scholar
- D. Calvanese, G. de Giacomo, M. Lenzerini, M. Y. Vardi. Containment of conjunctive regular path queries with inverse. In KR'00, pages 176--185.Google Scholar
- D. Calvanese, G. de Giacomo, M. Lenzerini, M. Y. Vardi. Rewriting of regular expressions and regular path queries. JCSS, 64(3):443--465, 2002.Google Scholar
Digital Library
- M. Chrobak. Finite automata and unary languages. Theor. Comput. Sci., 47(2):149--158, 1986. Google Scholar
Digital Library
- M. P. Consens, A. O. Mendelzon. GraphLog: a visual formalism for real life recursion. In PODS'90, pages 404--416. Google Scholar
Digital Library
- A. Deutsch, V. Tannen. Optimization properties for classes of conjunctive regular path queries. In DBPL'01, pages 21--39. Google Scholar
Digital Library
- C. Elgot, J. Mezei. On relations defined by generalized finite automata. IBM Journal Research Develop, 9(1):47--68, 1965. Google Scholar
Digital Library
- D. Florescu, A. Levy, D. Suciu. Query containment for conjunctive queries with regular expressions. In PODS'98, pages 139--148. Google Scholar
Digital Library
- D. D. Freydenberger, D. Reidenbach. Bad news on decision problems for patterns. Information and Computation, 208(1):83--96, 2010. Google Scholar
Digital Library
- C. Frougny, J. Sakarovitch. Rational relations with bounded delay. In STACS'91, pages 50--63. Google Scholar
Digital Library
- G. Grahne, A. Thomo. Query answering and containment for regular path queries under distortions. In FoIKS'04, pages 98--115.Google Scholar
- D. Gusfield. Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press, 1997. Google Scholar
Digital Library
- 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.Google Scholar
- O. Ibarra, J. Su, Z. Dang, T. Bultan, R. Kemmerer. Counter machines and verification problems. Theor. Comput. Sci., 289(1):165--189, 2002. Google Scholar
Digital Library
- Y. Kanza, Y. Sagiv. Flexible queries over semistructured data. In PODS'01, pages 40--51. Google Scholar
Digital Library
- K. Kochut, M. Janik. SPARQLeR: Extended SPARQL for semantic association discovery. In ESWC'07, pages 145--159. Google Scholar
Digital Library
- D. Kozen. Lower bounds for natural proof systems. In FOCS'77, pages 254--266. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- J. Lehmann, J. Schuppel, and S. Auer. Discovering unknown connections--the DBpedia relationship finder. In Conf. on Social Semantic Web, pages 99--110, 2007.Google Scholar
- H. W. Lenstra. Integer programming in a fixed number of variables. Math. Oper. Res., 8(4):538--548, 1983.Google Scholar
Digital Library
- A. O. Mendelzon, P. T. Wood. Finding regular simple paths in graph databases. SIAM J. Comput., 24(6):1235--1258, 1995. Google Scholar
Digital Library
- T. Milo, D. Suciu. Index structures for path expressions. In ICDT'99, pages 277--295. Google Scholar
Digital Library
- C. H. Papadimitriou. On the complexity of integer programming. JACM, 28(4):765--768, 1981. Google Scholar
Digital Library
- A. Sheth et al. Semantic association identification and knowledge discovery for national security applications. J. Database Management, 16(1):33--53, 2005.Google Scholar
Cross Ref
- A.W. To. Unary finite automata vs. arithmetic progressions. IPL, 109(17):1010--1014, 2009. Google Scholar
Digital Library
- A.W. To. Model checking FO(R) over one-counter processes and beyond. In CSL'09, pages 485--499. Google Scholar
Digital Library
- K. N. Verma, H. Seidl, T. Schwentick. On the complexity of equational Horn clauses. In CADE'05, pages 337--352. Google Scholar
Digital Library
- G. Weikum, G. Kasneci, M. Ramanath, and F. Suchanek. Database and information-retrieval methods for knowledge discovery. Commun. ACM, 52(4):56--64, 2009. Google Scholar
Digital Library
Index Terms
Expressive languages for path queries over graph-structured data
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