Distance-join: Pattern match query in a large graph database

Proceedings of the VLDB Endowment

Volumn 2, Issue 1, 2009, Pages 886-897

  Zou, Lei ^a   Chen, Lei ^b   Tamer Ozsu M ^c  

^a HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^c UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH DATABASES; INFORMATION MANAGEMENT; QUERY PROCESSING; VECTOR SPACES;

DATA MANAGEMENT PROBLEMS; GRAPH EMBEDDINGS; JOIN PROCESSING; ORDERS OF MAGNITUDE; PRUNING STRATEGY; REACHABILITY QUERIES; SHORTEST PATH QUERIES; SYNTHETIC DATASETS;

GRAPH THEORY;

EID: 79957815582     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1687627.1687727     Document Type: Article

References (28)

1. C. Böhm, B. Braunmüller, F. Krebs, and H.-P. Kriegel. Epsilon grid order: An algorithm for the similarity join on massive high-dimensional data. In SIGMOD, 2001.
2. T. Brinkhoff, H.-P. Kriegel, and B. Seeger. Efficient processing of spatial joins using r-trees. In SIGMOD, 1993.
3. E. P. F. Chan and H. Lim. Optimization and evaluation of shortest path queries. VLDB J., 16(3), 2007.
4. Y. Chen and Y. Chen. An efficient algorithm for answering graph reachability queries. In ICDE, 2008.
5. J. Cheng, Y. Ke, W. Ng, and A. Lu. fg-index: Towards verification-free query processing on graph databases. In SIGMOD, 2007.
6. J. Cheng, J. X. Yu, B. Ding, P. S. Yu, and H. Wang. Fast graph pattern matching. In ICDE, 2008.
7. E. Cohen, E. Halperin, H. Kaplan, and U. Zwick. Reachability and distance queries via 2-hop labels. SIAM J. Comput., 32(5), 2003.
8. J. H. D.W. Williams and W. Wang. Graph database indexing using structured graph decomposition. In ICDE, 2007.
9. G. Gou and R. Chirkova. Effcient algorithms for exact ranked twig-pattern matching over graphs. In SIGMOD, 2008.
10. P. Y. H. Jiang, H. Wang and S. Zhou. Gstring: A novel approach for efficient search in graph databases. In ICDE, 2007.
11. J. Han and M. Kamber. Data Mining: Concepts and Techniques. Morgan Kaufmann Publishers, 2000.
12. B. Harangsri, J. Shepherd, and A. H. H. Ngu. Selectivity estimation for joins using systematic sampling. In DEXA Workshop, 1997.
13. H. He and A. K. Singh. Closure-tree: An index structure for graph queries. In ICDE, 2006.
14. H. V. Jagadish, B. C. Ooi, K.-L. Tan, C. Yu, and R. Zhang. idistance: An adaptive b+-tree based indexing method for nearest neighbor search. ACM Trans. Database Syst., 30(2), 2005.
15. C. Jiefeng and J. X. Yu. On-line exact shortest distance query processing. In EDBT, 2009.
16. N. Jing, Y.-W. Huang, and E. A. Rundensteiner. Hierarchical encoded path views for path query processing: An optimal model and its performance evaluation. IEEE Trans. Knowl. Data Eng., 10(3), 1998.
17. N. Linial, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica, 15(2), 1995.
18. C. Shahabi, M. R. Kolahdouzan, and M. Sharifzadeh. A road network embedding technique for k-nearest neighbor search in moving object databases. GeoInformatica, 7(3), 2003.
19. D. Shasha, J. T.-L. Wang, and R. Giugno. Algorithmics and applications of tree and graph searching. In PODS, 2002.
20. Y. Tian, R. C. McEachin, C. Santos, D. J. States, and J. M. Patel. Saga: a subgraph matching tool for biological graphs. Bioinformatics, 23(2), 2007.
21. Y. Tian and J. M. Patel. Tale: A tool for approximate large graph matching. In ICDE, pages 963-972, 2008.
22. H. Tong, C. Faloutsos, B. Gallagher, and T. Eliassi-Rad. Fast best-effort pattern matching in large attributed graphs. In KDD, 2007.
23. S. Trißl and U. Leser. Fast and practical indexing and querying of very large graphs. In SIGMOD, 2007.
24. 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.
25. Y. Wu, J. M. Patel, and H. V. Jagadish. Structural join order selection for xml query optimization. In ICDE, 2003.
26. X. Yan, P. S. Yu, and J. Han. Graph indexing: A frequent structure-based approach. In SIGMOD, 2004.
27. S. Zhang, M. Hu, and J. Yang. Treepi: A novel graph indexing method. In ICDE, 2007.
28. P. Zhao, J. X. Yu, and P. S. Yu. Graph indexing: Tree + delta >= graph. In VLDB, 2007.