Expressive languages for path queries over graph-structured data

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2010, Pages 3-14

  Barceló, Pablo ^a   Hurtado, Carlos ^b   Libkin, Leonid ^c   Wood, Peter ^d  

^a UNIVERSITY OF CHILE   (Chile)

^b Univ A Ibañez   (Chile)

^c UNIVERSITY OF EDINBURGH   (United Kingdom)

^d UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

conjunctive queries; graph databases; regular path queries; regular relations

Indexed keywords

ANALYSIS OF DATA; APPROXIMATE PATTERN MATCHING; ARITHMETIC PROPERTY; COMBINED COMPLEXITY; CONJUNCTIVE QUERIES; FIRST-ORDER; GRAPH DATABASE; GRAPH STRUCTURED DATA; PATH QUERIES; QUERY EVALUATION; RDF GRAPH; REGULAR PATH QUERIES; SEMANTIC ASSOCIATIONS; SEQUENCE ALIGNMENTS; STRUCTURED DATA;

LINGUISTICS; PATTERN MATCHING;

QUERY LANGUAGES;

EID: 77954717292     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1807085.1807089     Document Type: Conference Paper

References (36)

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