Fast graph pattern matching

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2008, Pages 913-922

  Cheng, Jiefeng ^a   Yu, Jeffrey Xu ^a   Ding, Bolin ^a   Yu, Philip S ^b   Wang, Haixun ^c  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^b UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

^c IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION MANAGEMENT;

COMPLICATED STRUCTURES; EXPRESSIVE POWER; GRAPH PATTERN MATCHING; INTERNET TECHNOLOGY; NEW APPROACHES; OPTIMIZATION APPROACH; PERFORMANCE STUDY; TECHNOLOGICAL ADVANCES;

PATTERN MATCHING;

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

References (32)

1. S. Abiteboul, P. Buneman, and D. Suciu, Data on the Web: from relations to semistructured data and XML. Morgan Kaufmann Publishers Inc., 2000.
2. D. Brickley and R. V. Guha, "Resource Description Framework (RDF) Schema Specification 1.0," W3C Candidate Recommendation, 2000.
3. D. Shasha, J. T. L. Wang, and R. Giugno, "Algorithmics and applications of tree and graph searching," in Proc. of PODS'02, 2002.
4. K. Anyanwu and A. Sheth, "ρ-queries: enabling querying for semantic associations on the semantic web," in Proc. of WWW'03, 2003.
5. N. Bruno, N. Koudas, and D. Srivastava, "Holistic twig joins: optimal XML pattern matching," in Proc. of SIGMOD'02, 2002.
6. S. Chen, H.-G. Li, J. Tatemura, W.-P. Hsiung, D. Agrawal, and K. S. Candan, "Twig2stack: Bottom-up processing of generalized-tree-pattern queries over XML documents," in Proc. of VLDB'06, 2006.
7. E. Cohen, E. Halperin, H. Kaplan, and U. Zwick, "Reachability and distance queries via 2-hop labels," in Proc. of SODA'02, 2002.
8. R. Schenkel and A. T. et. al, "Hopi: An efficient connection index for complex XML document collections," in Proc. of EDBT04, 2004.
9. R. Schenkel, A. Theobald, and G. Weikum, "Efficient creation and incremental maintenance of the HOPI index for complex XML document collections," in Proc. of ICDE'05, 2005.
10. J. Cheng, J. X. Yu, X. Lin, H. Wang, and P. S. Yu, "Fast computation of reachability labeling for large graphs," in Proc. of EDBT'06, 2006.
11. _, "Fast computing reachability labelings for large graphs with high compression rate," 2008, to appear in Proc. of EDBTOS, 2008.
12. Y. Wu, J. M. Patel, and H. Jagadish, "Structural join order selection for XML query optimization," in Proc. of ICDE'03, 2003.
13. J. Cheng, J. X. Yu, and N. Tang, "Fast reachability query processing," in Proc. of DASFAA'06, 2006.
14. M. Jarke and J. Koch, "Query optimization in database systems," ACM Computing Surveys, vol. 16, no. 2, 1984.
15. P. Mishra and M. H. Eich, "Join processing in relational databases," ACM Computing Surveys, vol. 24, no. 1, 1992.
16. G. Graefe, "Query evaluation techniques for large databases," ACM Computing Surveys, vol. 25, no. 2, 1993.
17. Y E. Ioannidis, "Query optimization," ACM Computing Surveys, vol. 28, no. 1, 1996.
18. S. Chaudhuri, "An overview of query optimization in relational systems," in Proc. of PODS'98, 1998.
19. D. Kossmann, "The state of the art in distributed query processing," ACM Computing Surveys, vol. 32, no. 4, 2000.
20. L. Chen, A. Gupta, and M. E. Kurul, "Stack-based algorithms for pattern matching on dags," in Proc. of VLDB'05, 2005.
21. H. Wang, W. Wang, X. Lin, and J. Li, "Labeling scheme and structural joins for graph-structured XML data," in Proc. of APWeb'05, 2005.
22. R. Agrawal, A. Borgida, and H. V. Jagadish, "Efficient management of transitive relationships in large data and knowledge bases," in Proc. of SIGMOD'89, 1989.
23. J. Cheng, J. X. Yu, and B. Ding, 'Cost-based query optimization for multi reachability joins," in Proc. of DASFAA'07, 2007.
24. A. Schmidt, F. Waas, M. Kersten, M. J. Carey, I. Manolescu, and R. Busse, "Xmark: A benchmark for xml data management," in Proc. of VLDB'02, 2002.
25. P. G. Selinger, M. M. Astrahan, D. D. Chamberlin, R. A. Lorie, and T. G. Price, "Access path selection in a relational database management system," in Proc. of SIGMOD'79, 1979, pp. 23-34.
26. S. Chaudhuri, "An overview of query optimization in relational systems," in Proc. of PODS'98, 1998.
27. P. A. Bernstein, N. Goodman, E. Wong, et al., "Query processing in a system for distributed databases (SDD-I)," ACM Trans. Database Syst., vol. 6, no. 4, 1981.
28. P. A. Bernstein and D.-M. W. Chiu, "Using semi-joins to solve relational queries," J. ACM, vol. 28, no. 1, 1981.
29. M. S. Chen and P. S. Yu, "Interleaving a join sequence with semijoins in distributed query processing," IEEE Trans. Parallel Distrib. Syst., vol. 3, no. 5, 1992.
30. _, "Combining joint and semi-join operations for distributed query processing," TKDE, vol. 5, no. 3, 1993.
31. F. Bancilhon and R. Ramakrishnan, "An amateur's introduction to recursive query processing strategies," in Proc. of SIGMOD'86, 1986.
32. C. Yu and H. V. Jagadish, "Querying complex structured databases," in Proc. of VLDB'07, 2001.