Adding regular expressions to graph reachability and pattern queries

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2011, Pages 39-50

  Fan, Wenfei ^a,b   Li, Jianzhong ^b   Ma, Shuai ^a   Tang, Nan ^a   Wu, Yinghui ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b HARBIN INSTITUTE OF TECHNOLOGY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

DATA GRAPH; EMERGING APPLICATIONS; EXPRESSIVE POWER; FUNDAMENTAL PROBLEM; GRAPH PATTERN MATCHING; GRAPH PATTERNS; MINIMIZATION PROBLEMS; NP-COMPLETENESS; PATTERN QUERY; QUADRATIC TIME; REACHABILITY; REACHABILITY QUERIES; REAL LIFE DATA; REGULAR EXPRESSIONS; SOCIAL NETWORKS; SUBGRAPH ISOMORPHISM; SYNTHETIC DATA;

PATTERN MATCHING;

ALGORITHMS;

EID: 79957828078     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2011.5767858     Document Type: Conference Paper

References (37)

1. Terrorist organization network. http://www.start.umd.edu/gtd.
2. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.
3. S. Abiteboul, D. Quass, J. McHugh, J. Widom, and J. L. Wiener. The Lorel query language for semistructured data. Int. J. on Digital Libraries, 1(1):68-88, 1997. (Pubitemid 127078348)
4. J. Bang-Jensen and G. Z. Gutin. Digraphs: Theory, Algorithms and Applications. Springer, 2008.
5. P. Barceĺo, C. A. Hurtado, L. Libkin, and P. T. Wood. Expressive languages for path queries over graph-structured data. In PODS, 2010.
6. M. J. Brzozowski, T. Hogg, and G. Szab́o. Friends and foes: ideological social networking. In CHI, 2008.
7. P. Buneman, M. F. Fernandez, and D. Suciu. Unql: A query language and algebra for semistructured data based on structural recursion. VLDB J., 9(1):76-110, 2000.
8. D. Bustan and O. Grumberg. Simulation-based minimization. TOCL, 4(2):181-206, 2003.
9. D. Chen and C. Y. Chan. Minimization of tree pattern queries with constraints. In SIGMOD, 2008.
10. Z. Chen, H. T. Shen, X. Zhou, and J. X. Yu. Monitoring path nearest neighbor in road networks. In SIGMOD, 2009.
11. J. Cho, N. Shivakumar, and H. Garcia-Molina. Finding replicated Web collections. SIGMOD Rec., 29(2), 2000.
12. E. Cohen, E. Halperin, H. Kaplan, and U. Zwick. Reachability and distance queries via 2-hop labels. SICOMP, 32(5):1338-1355, 2003.
13. W. Fan and P. Bohannon. Information preserving XML schema embedding. TODS, 33(1), 2008.
14. W. Fan, J. Li, S. Ma, N. Tang, Y. Wu, and Y. Wu. Graph pattern matching: From intractability to polynomial time. In PVLDB, 2010.
15. W. Fan, J. Li, S. Ma, H. Wang, and Y. Wu. Graph homomorphism revisited for graph matching. In PVLDB, 2010.
16. D. Florescu, A. Y. Levy, and D. Suciu. Query containment for conjunctive queries with regular expressions. In PODS, 1998.
17. B. Gallagher. Matching structure and semantics: A survey on graphbased pattern matching. AAAI FS., 2006.
18. H. He and A. K. Singh. Graphs-at-a-time: query language and access methods for graph databases. In SIGMOD, 2009.
19. M. R. Henzinger, T. Henzinger, and P. Kopke. Computing simulations on finite and infinite graphs. In FOCS, 1995.
20. T. Jiang and B. Ravikumar. Minimal NFA Problems are Hard. SICOMP, 22(6):1117-1141, 1993.
21. R. Jin, H. Hong, H. Wang, N. Ruan, and Y. Xiang. Computing labelconstraint reachability in graph databases. In SIGMOD, 2010.
22. R. Jin, Y. Xiang, N. Ruan, and H. Wang. Efficiently answering reachability queries on very large directed graphs. In SIGMOD, 2008.
23. M. McPherson, L. Smith-Lovin, and J. M. Cook. Birds of a feather: Homophily in social networks. Annual Review of Sociology, 27:415-444, 2001.
24. F. Neven and T. Schwentick. XPath containment in the presence of disjunction, DTDs, and variables. In ICDT, 2003.
25. C. H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
26. F. Ranzato and F. Tapparo. A new efficient simulation equivalence algorithm. In LICS, 2007.
27. R. Ronen and O. Shmueli. SoQL: A language for querying and creating data in social networks. In ICDE, 2009.
28. D. Shasha, J. T. L. Wang, and R. Giugno. Algorithmics and applications of tree and graph searching. In PODS, 2002.
29. SPARQL. http://www.w3.org/TR/rdf-sparql-query/.
30. R. E. Tarjan. Depth-first search and linear graph algorithms. SICOMP, 1(2):146-160, 1972.
31. H. Tong, C. Faloutsos, B. Gallagher, and T. Eliassi-Rad. Fast best-effort pattern matching in large attributed graphs. In KDD, 2007.
32. J. R. Ullmann. An algorithm for subgraph isomorphism. JACM, 23(1):31-42, 1976.
33. H. Wang, H. He, J. Yang, P. S. Yu, and J. X. Yu. Dual labeling: Answering graph reachability queries in constant time. In ICDE, 2006.
34. F. Wei. TEDI: Efficient shortest path query answering on graphs. In SIGMOD, 2010.
35. Wikipedia. F-measure. http://en.wikipedia.org/wiki/F-measure.
36. P. T. Wood. Containment for XPath fragments under DTD constraints. In ICDT, 2003.
37. L. Zou, L. Chen, and M. T. Özsu. Distance-join: Pattern match query in a large graph database. In PVLDB, 2009.