NeMa: Fast graph search with label similarity

Proceedings of the VLDB Endowment

Volumn 6, Issue 3, 2013, Pages 181-192

  Khan, Arijit ^a   Wu, Yinghui ^a   Aggarwal, Charu C ^b   Yan, Xifeng ^a  

^a University of California   (United States)

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

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH STRUCTURES; HEURISTIC ALGORITHMS; INFERENCE ENGINES; SEARCH ENGINES;

ALGORITHM FOR SOLVING; INFERENCE MODELS; KEYWORD SEARCH; OPTIMIZATION TECHNIQUES; REAL LIFE DATA; REAL-LIFE NETWORKS; STATE OF THE ART; SUBGRAPH MATCHING;

GRAPH THEORY;

EID: 84875119542     PISSN: None     EISSN: 21508097     Source Type: Journal    
DOI: 10.14778/2535569.2448952     Document Type: Article

References (43)

1. S. Abiteboul. Querying Semi-Structured Data. ICDT, 1997.
2. J. R. Anderson. A Spreading Activation Theory of Memory. J. Verbal Learning and Verbal Behavior, 1983.
3. P. Barceĺo, L. Libkin, and J. L. Reutter. Querying Graph Patterns. PODS, 2011.
4. M. Bayati, M. Gerritsen, D. F. Gleich, A. Saberi, and Y. Wang. Algorithms for Large, Sparse Network Alignment Problems. ICDM, 2009.
5. H. Berger, M. Dittenbach, and D. Merkl. An Adaptive Information Retrieval System based on Associative Networks. APCCM, 2004.
6. N. Buchan and R. Croson. The Boundaries of Trust: Own and Others' Actions in US and China. J. Econ. Behav. and Org., 2004.
7. V. S. Cherukuri and K. S. Candan. Propagation-Vectors for Trees (PVT): Concise yet Effective Summaries for Hierarchical Data and Trees. LSDS-IR, 2008.
8. S. Cook. The Complexity of Theorem Proving Procedures. STOC, 1971.
9. L. P. Cordella, P. Foggia, C. Sansone, and M. Vento. A (sub)graph Isomorphism Algorithm for Matching Large Graphs. IEEE Tran. Pattern Anal. and Machine Int., 2004.
10. S. Das, E. I. Chong, G. Eadon, and J. Srinivasan. Supporting Ontology-Based Semantic Matching in RDBMS. VLDB, 2004.
11. W. Fan, J. Li, S. Ma, N. Tang, Y. Wu, and Y. Wu. Graph Pattern Matching: From Intractable to Polynomial Time. PVLDB, 2010.
12. W. Fan, J. Li, S. Ma, H. Wang, and Y. Wu. Graph Homomorphism Revisited for Graph Matching. PVLDB, 2010.
13. B. Gallagher. Matching Structure and Semantics: A Survey on Graph-Based Pattern Matching. AAAI FS., 2006.
14. J. Han. Mining Heterogeneous Information Networks by Exploring the Power of Links. ALT, 2009.
15. L. Han, T. Finin, and A. Joshi. GoRelations: An Intuitive Query System for DBpedia. LNCS, 2011.
16. H. He, H. Wang, J. Yang, and P. S. Yu. BLINKS: Ranked Keyword Searches on Graphs. SIGMOD, 2007.
17. J. Liu and X. Dong and A. Halevy. Answering Structured Queries on Unstructured Data. WebDB, 2006.
18. M. Kargar and A. An. Keyword Search in Graphs: Finding r-cliques. PVLDB, 2011.
19. B. P. Kelley, B. Yuan, F. Lewitter, R. Sharan, B. R. Stockwell, and T. Ideker. PathBLAST: A Tool for Alignment of Protein Interaction Networks. Nucleic Acids Res, 2004.
20. A. Khan, N. Li, X. Yan, Z. Guan, S. Chakraborty, and S. Tao. Neighborhood Based Fast Graph Search in Large Networks. SIGMOD, 2011.
21. J. W. Kim and K. S. Candan. CP/CV: Concept Similarity Mining without Frequency Information from Domain Describing Taxonomies. CIKM, 2006.
22. Z. Liang, M. Xu, M. Teng, and L. Niu. NetAlign: A Web-based Tool for Comparison of Protein Interaction Networks. Bioinfo., 2006.
23. S. Ma, Y. Cao, W. Fan, J. Huai, and T.Wo. Capturing Topology in Graph Pattern Matching. PVLDB, 2012.
24. G. Malewicz, M. H. Austern, A. J. C. Bik, J. C. Dehnert, I. Horn, N. Leiser, and G. Czajkowski. PREGEL: A System for Large-Scale Graph Processing. SIGMOD, 2010.
25. S. Melnik, H. G.-Molina, and E. Rahm. Similarity Flooding: A Versatile Graph Matching Algorithm and its Application to Schema Matching. ICDE, 2002.
26. M. Mongiov'i{dotless}, R. D. Natale, R. Giugno, A. Pulvirenti, A. Ferro, and R. Sharan. SIGMA: A Set-Cover-Based Inexact Graph Matching Algorithm. J. Bioinfo. and Comp. Bio., 2010.
27. C. Papadimitriou and M. Yannakakis. Optimization, Approximation, and Complexity Classes. J. Comp. and Sys. Sc., 1991.
28. Y. Papakonstantinou and V. Vassalos. Query Rewriting for Semistructured Data. SIGMOD, 1999.
29. J. Pearl. Reverend Bayes on inference engines: A distributed Hierarchical Approach. American Association of AI Conf., 1982.
30. K. Sambhoos, R. Nagi, M. Sudit, and A. Stotz. Enhancements to High Level Data Fusion using Graph Matching and State Space Search. Inf. Fusion, 2010.
31. P. Sen, G. M. Namata, M. Bilgic, L. Getoor, B. Gallagher, and T. Eliassi-Rad. Collective Classification in Network Data. AI Magazine, 2008.
32. H. Shang, Y. Zhang, X. Lin, and J. Yu. Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism. PVLDB, 2008.
33. R. Singh, J. Xu, and B. Berger. Global Alignment of Multiple Protein Interaction Networks with Application to Functional Orthology Detection. PNAS, 2008.
34. Z. Sun, H. Wang, H. Wang, B. Shao, and J. Li. Efficient Subgraph Matching on Billion Node Graphs. PVLDB, 2012.
35. Y. Tian, R. McEachin, C. Santos, D. States, and J. Patel. SAGA: A Subgraph Matching Tool for Biological Graphs. Bioinfo., 2006.
36. Y. Tian and J. M. Patel. TALE: A Tool for Approximate Large Graph Matching. ICDE, 2008.
37. H. Tong, C. Faloutsos, B. Gallagher, and T. Eliassi-Rad. Fast Best-Effort Pattern Matching in Large Attributed Graphs. KDD, 2007.
38. J. R. Ullmann. An Algorithm for Subgraph Isomorphism. J. ACM, 1976.
39. J. Yao, B. Cui, L. Hua, and Y. Huang. Keyword Query Reformulation on Structured Data. ICDE, 2012.
40. S. Zampelli, Y. Deville, C. Solnon, S. Sorlin, and P. Dupont. Filtering for Subgraph Isomorphism. CP, 2007.
41. S. Zhang, J. Yang, and W. Jin. SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs. PVLDB, 2010.
42. Q. Zhong, H. Li, J. Li, G. Xie, J. Tang, L. Zhou, and Y. Pan. A Gauss Function Based Approach for Unbalanced Ontology Matching. SIGMOD, 2009.
43. L. Zou, J. Mo, L. Chen, M. T. Özsu, and D. Zhao. gStore: Answering SPARQL Queries via Subgraph Matching. VLDB, 2011.