Searching substructures with superimposed distance

Proceedings - International Conference on Data Engineering

Volumn 2006, Issue , 2006, Pages 88-

  Yan, Xifeng ^a   Zhu, Feida ^a   Han, Jiawei ^a   Yu, Philip S ^b  

^a University of Illinois at Urbana Champaign   (United States)

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

Author keywords

[No Author keywords available]

Indexed keywords

DISTANCE CONSTRAINTS; MULTIPLE GRAPHS; PARTITION-BASED GRAPH INDEX AND SEARCH (PIS);

CONSTRAINT THEORY; DATABASE SYSTEMS; GRAPH THEORY; INDEXING (OF INFORMATION); QUERY LANGUAGES; SEARCH ENGINES;

DATA STRUCTURES;

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

References (17)

1. C. Bron and J. Kerbosch. Algorithm 457: Finding all cliques of an undirected graph. Comm. of the ACM, 16:575-577, 1973.
2. T. Funkhouser, P. Min, M. Kazhdan, J. Chen, A. Halderman, D. Dobkin, and D. Jacobs. A search engine for 3d models. ACM Trans. on Graphics, 22:83-105, 2003.
3. M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman & Co., New York, 1979.
4. A. Guttman. R-trees: a dynamic index structure for spatial searching. In Proc. 1984 ACM Int. Conf. on Management of Data (SIGMOD'84), pages 47-57, 1984.
5. T. Hagadone. Molecular substructure similarity searching: efficient retrieval in two-dimensional structure databases. J. Chem. Inf. Comput. Sci., 32:515-521, 1992.
6. G. Hjaltason and H. Samet. Index-driven similarity search in metric spaces. In ACM Trans. on Database Systems (TODS), pages 517-580, 2003.
7. L. Holder, D. Cook, and S. Djoko. Substructure discovery in the subdue system. In Proc. AAAI94 Workshop on Knowledge Discovery in Databases (KDD94), page 169 180, 1994.
8. L. Holm and C. Sander. Protein structure comparison by alignment of distance matrices. J. of Molecular Biology, 233:123-138, 1993.
9. B. Messmer and H. Bunke. A new algorithm for error-tolerant subgraph isomorphism detection. IEEE Trans. on Pattern Analysis and Machine Intelligence, 20:493 -504, 1998.
10. J. Raymond, E. Gardiner, and P. Willett. Rascal: Calculation of graph similarity using maximum common edge subgraphs. The Computer Journal, 45:631-644, 2002.
11. T. Sellis, N. Roussopoulos, and C. Faloutsos. The R+-Tree: A dynamic index for multi-dimensional objects. In Proc. 1987 Int. Conf. on Very Large Data Bases (VLDB'87), pages 3-11, 1987.
12. D. Shasha, J. Wang, and R. Giugno. Algorithmes and applications of tree and graph searching. In Proc. 21th ACM Symp. on Principles of Database Systems (PODS'02), pages 39-52, 2002.
13. A. Singh and D. Brutlag. Hierarchical protein structure superposition using both secondary structure and atomic representations. In Proc. 5th Int. Conf. on Intelligent Systems for Molecular Biology (ISMB'97), pages 284-293, 1997.
14. H. Wolfson and I. Rigoutsos. Geometric hashing: An introduction. IEEE Computational Science and Engineering, 4:10-21, 1997.
15. X. Yan and J. Han. gSpan: Graph-based substructure pattern mining. In Proc. 2002 Int. Conf. on Data Mining (ICDM'02), pages 721-724, 2002.
16. X. Yan, P. Yu, and J. Han. Graph indexing: A frequent structure-based approach. In Proc. 2004 ACM Int. Conf. on Management of Data (SIGMOD'04), pages 335-346, 2004.
17. X. Yan, P. Yu, and J. Han. Substructure similarity search in graph databases. In Proc. 2005 ACM Int. Conf. on Management of Data (SIGMOD'05), pages 766-777, 2005.