An efficient graph indexing method

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2012, Pages 210-221

  Wang, Xiaoli ^a   Ding, Xiaofeng ^b   Tung, Anthony K H ^a   Ying, Shanshan ^a   Jin, Hai ^b  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX STRUCTURE; DATABASE SIZE; FUNDAMENTAL RESEARCH; GRAPH EDIT DISTANCE; GRAPH INDEXING; GRAPH SEARCH; GRAPH SIMILARITY; REAL DATA SETS; SEARCH STRATEGIES; SIMILARITY SEARCH;

DATA PROCESSING; SCALABILITY;

INDEXING (OF INFORMATION);

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

References (30)

1. H. Hu, X. Yan, Y. Huang, J. Han, and X. J. Zhou, "Mining coherent dense subgraphs across massive biological network for functional discovery," Bioinfomatics, vol. 1, no. 1, pp. 1-9, 2005.
2. X. Yan, P. S. Yu, and J. Han, "Substructure similarity search in graph databases," in SIGMOD, 2005, pp. 766-777.
3. B. T. Messmer and H. Bunke, "A new algorithm for error-tolerant subgraph isomorphism detection," IEEE TPAMI, vol. 20, no. 5, pp. 493-504, 1998.
4. R. Giugno and D. Shasha, "Graphgrep: A fast and universal method for querying graphs," in ICPR, 2002, pp. 112-115.
5. H. He and A. K. Singh, "Closure-tree: an index structure for graph queries," in ICDE, 2006, pp. 38-38.
6. H. Bunke and K. Shearer, "A graph distance metric based on the maximal common subgraph," Pattern Recognition Letter, vol. 19, no. 3-4, pp. 255-259, 1998.
7. M.-L. Fernández and G. Valiente, "A graph distance metric combining maximum common subgraph and minimum common supergraph," Pattern Recognition Letter, vol. 22, no. 6-7, pp. 753-758, 2001.
8. X. Gao, B. Xiao, D. Tao, and X. Li, "A survey of graph edit distance," Pattern Anl. & Applic., 2009.
9. Z. Zeng, A. K. H. Tung, J. Wang, J. Feng, and L. Zhou, "Comparing stars: on approximating graph edit distance," PVLDB, vol. 2, no. 1, pp. 25-36, August 2009.
10. D. Justice, "A binary linear programming formulation of the graph edit distance," IEEE TPAMI, vol. 28, no. 8, pp. 1200-1214, 2006.
11. C. Li, B. Wang, and X. Yang, "Vgram: improving performance of approximate queries on string collections using variable-length grams," in VLDB, 2007, pp. 303-314.
12. R. Yang, P. Kalnis, and A. K. H. Tung, "Similarity evaluation on tree-structured data," in SIGMOD, 2005, pp. 754-765.
13. J. Cheng, Y. Ke, W. Ng, and A. Lu, "Fg-index: towards verification-free query processing on graph databases," in SIGMOD, 2007, pp. 857-872.
14. G. Wang, B. Wang, X. Yang, and G. Yu, "Efficiently indexing large sparse graphs for similarity search," IEEE TKDE, vol. 99, no. PrePrints, 2010.
15. X. Yan, P. S. Yu, and J. Han, "Graph indexing: a frequent structure-based approach," in SIGMOD, 2004, pp. 335-346.
16. S. Zhang, M. Hu, and J. Yang, "Treepi: a novel graph indexing method," in ICDE, 2007, pp. 966-975.
17. H. W. Kugn, "The hungarian method for the assignment problem," Naval Research Logistics, vol. 2, pp. 83-97, 1955.
18. R. Fagin, A. Lotem, and M. Naor, "Optimal aggregation algorithms for middleware," in PODS, 2001, pp. 102-113.
19. P. Hart, N. Nilsson, and B. Raphael, "A formal basis for the heuristic determination of minimum cost paths," IEEE Trans. SSC, vol. 4, no. 2, pp. 100-107, 1968.
20. M. Garey and D. Johnson, Computers and intractability. Freeman San Francisco, 1979.
21. M. Neuhaus, K. Riesen, and H. Bunke, "Fast suboptimal algorithms for the computation of graph edit distance," in SSSPR, 2006, pp. 163-172.
22. H. A. Almohamad and S. O. Duffuaa, "A linear programming approach for the weighted graph matching problem," IEEE Trans. Pattern Anal. Mach. Intell., vol. 15, no. 5, pp. 522-525, 1993.
23. P. Zhao, J. X. Yu, and P. S. Yu, "Graph indexing: tree + delta >=graph," in VLDB, 2007, pp. 938-949.
24. Y. Tian and J. Patel, "Tale: A tool for approximate large graph matching," in ICDE. IEEE, 2008.
25. I. H. Toroslu and G. íçoluk, "Incremental assignment problem," Inf. Sci., vol. 177, no. 6, pp. 1523-1529, 2007.
26. C. Zhang, J. Naughton, D. DeWitt, Q. Luo, and G. Lohman, "On supporting containment queries in relational database management systems," in SIGMOD. ACM, 2001, pp. 425-436.
27. L. Gravano, P. Ipeirotis, H. Jagadish, N. Koudas, S. Muthukrishnan, and D. Srivastava, "Approximate string joins in a database (almost) for free," in VLDB. Citeseer, 2001, pp. 491-500.
28. D. Cutting and J. Pedersen, "Optimization for dynamic inverted index maintenance," in ACM SIGIR. ACM, 1989, pp. 405-411.
29. J. Ferrante, K. J. Ottenstein, and J. D. Warren, "The program dependence graph and its use in optimization," ACM Trans. Program. Lang. Syst., vol. 9, no. 3, pp. 319-349, 1987.
30. M. Gabel, L. Jiang, and Z. Su, "Scalable detection of semantic clones," in ICSE, New York, NY, USA, 2008, pp. 321-330.