Querying graph patterns

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

Volumn , Issue , 2011, Pages 199-210

  Barcelo, Pablo ^a   Libkin, Leonid ^b   Reutter, Juan ^b  

^a UNIVERSITY OF CHILE   (Chile)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Automata; Complexity; Constraint satisfaction; Graph databases; Graph patterns; Query languages

Indexed keywords

AUTOMATA; COMPLEXITY; CONSTRAINT SATISFACTION; GRAPH DATABASE; GRAPH PATTERNS;

AUTOMATA THEORY; QUERY LANGUAGES;

METADATA;

EID: 79960199704     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1989284.1989307     Document Type: Conference Paper

References (40)

1. S. Abiteboul, P. Buneman, D. Suciu. Data on the Web: From Relations to Semistructured Data and XML. Morgan Kauffman, 1999.
2. R. Angles, C. Gutiérrez. Survey of graph database models. ACM Comput. Surv. 40(1): (2008).
3. M. Arenas, P. Barceĺo, L. Libkin, F. Murlak. Relational and XML Data Exchange. Morgan & Claypool, 2010.
4. P. Barceló, L. Libkin, A. Poggi, C. Sirangelo. XML with incomplete information. J. ACM 58(1): 1-62 (2010).
5. P. Barceló, C. Hurtado, L. Libkin, P. Wood. Expressive languages for path queries over graph-structured data. In PODS, pages 3-14, 2010.
6. H. Björklund, W. Martens, and T. Schwentick. Conjunctive query containment over trees. In DBPL'07, pages 66-80.
7. D. Calvanese, G. de Giacomo, M. Lenzerini, M. Y. Vardi. Containment of conjunctive regular path queries with inverse. In KR'00, pages 176-185.
8. D. Calvanese, G. de Giacomo, M. Lenzerini, M. Y. Vardi. Answering regular path queries using views. In ICDE, pages 389-398, 2000. (Pubitemid 30585727)
9. D. Calvanese, G. de Giacomo, M. Lenzerini, M. Y. Vardi. View-based query processing and constraint satisfaction. In LICS, pages 361-371, 2000.
10. D. Calvanese, G. de Giacomo, M. Lenzerini, M. Y. Vardi. Rewriting of regular expressions and regular path queries. JCSS, 64(3):443-465, 2002.
11. D. Calvanese, G. de Giacomo, M. Lenzerini, M. Y. Vardi. Simplifying schema mappings. In ICDT 2011, to appear.
12. J. Cheng, J. X. Yu, B. Ding, P. S. Yu, and H. Wang. Fast graph pattern matching. In ICDE 2008, pages 913-922.
13. S. Cohen and Y. Sagiv. An abstract framework for generating maximal answers to queries. In ICDT 2005, pages 129-143.
14. M. P. Consens, A. O. Mendelzon. GraphLog: a visual formalism for real life recursion. In PODS'90, pages 404-416.
15. I. Cruz, A. Mendelzon, P. Wood. A graphical query language supporting recursion. In SIGMOD'87, pages 323-330.
16. R. Dechter. Constraint Processing. Morgan Kaufmann, 2003.
17. A. Deutsch, V. Tannen. Optimization properties for classes of conjunctive regular path queries. DBPL'01, pages 21-39.
18. R. Diestel. Graph Theory. Springer, 2005.
19. R. Fagin, Ph. Kolaitis, R. Miller, and L. Popa. Data exchange: semantics and query answering. TCS, 336(1):89-124, 2005. (Pubitemid 40612385)
20. W. Fan, J. Li, S. Ma, H. Wang, Y. Wu. Homomorphism revisited for graph matching. PVLDB 3(1): 1161-1172 (2010).
21. W. Fan, J. Li, S. Ma, N. Tang, Y. Wu. Graph pattern matching: from intractable to polynomial time. PVLDB 3(1): 264-275 (2010).
22. W. Fan, J. Li, S. Ma, N. Tang, Y. Wu. Adding regular expressions to graph reachability and pattern queries. In ICDE 2011, to appear.
23. I. Glaister, J. Shallit. A lower bound technique for the size of nondeterministic finite automata. IPL 59:75-77, 1996. (Pubitemid 126375635)
24. G. Gottlob, C. Koch, K. Schulz. Conjunctive queries over trees. J. ACM 53(2) (2006), 238-272.
25. C. Gutierrez, C. Hurtado, A. Mendelzon. Foundations of semantic web databases. In PODS 2004, pages 95-106.
26. M. Gyssens, J. Paredaens, J. Van den Bussche, D. Van Gucht. A graph-oriented object database model. IEEE TKDE 6(4) (1994), 572-586.
27. T. Imielinski, W. Lipski. Incomplete information in relational databases. J. ACM 31 (1984), 761-791.
28. D. Johnson, A. Klug. Testing containment of conjunctive queries under functional and inclusion dependencies. JCSS, 28(1) (1984), pages 167-189. (Pubitemid 14569352)
29. Y. Kanza, W. Nutt, Y. Sagiv. Querying incomplete information in semistructured data. JCSS 64 (3) (2002), 655-693.
30. P. Kolaitis and M. Vardi. A logical approach to constraint satisfaction. In Finite Model Theory and Its Applications, Springer 2007, pages 339-370.
31. M. Lenzerini. Data integration: a theoretical perspective. In PODS'02, pages 233-246.
32. U. Leser. A query language for biological networks. Bioinformatics 21 (suppl 2) (2005), ii33-ii39. (Pubitemid 41535424)
33. R. Milo, S. Shen-Orr, S. Itzkovitz, N. Kashtan, D. Chklovskii, U. Alon. Network motifs: simple building blocks of complex networks. Science 298(5594) (2002), 824-827. (Pubitemid 35231534)
34. M. Natarajan. Understanding the structure of a drug trafficking organization: a conversational analysis. Crime Prevention Studies 11 (2000), 273-298.
35. F. Olken. Graph data management for molecular biology. OMICS 7(1): 75-78 (2003). (Pubitemid 36667511)
36. J. Pérez, M. Arenas, C. Gutierrez. Semantics and complexity of SPARQL. ACM TODS 34(3): 2009.
37. R. Ronen and O. Shmueli. SoQL: a language for querying and creating data in social networks. In ICDE 2009.
38. M. San Martín, C. Gutierrez. Representing, querying and transforming social networks with RDF/SPARQL. In ESWC 2009, pages 293-307.
39. H. Tong, C. Faloutsos, B. Gallagher, and T. Eliassi-Rad. Fast best-effort pattern matching in large attributed graphs. In KDD 2007.
40. G. Weikum, G. Kasneci, M. Ramanath, F. Suchanek. Database and information-retrieval methods for knowledge discovery. CACM 52(4):56-64 (2009).