Efficient similarity search for hierarchical data in large databases

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2992, Issue , 2004, Pages 676-693

  Kailing, Karin ^a   Kriegel, Hans Peter ^a   Schönauer, Stefan ^a   Seidl, Thomas ^b  

^a UNIVERSITY OF MUNICH   (Germany)

^b RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CHEMICAL COMPOUNDS; DATABASE SYSTEMS; FORESTRY;

CONSTRAINED EDIT DISTANCES; CONTENT-BASED INFORMATION; DATABASE APPLICATIONS; HIERARCHICAL DATA; HIERARCHICAL STRUCTURES; OBJECT REPRESENTATIONS; SIMILARITY SEARCH; TREE-STRUCTURED DATA;

TREES (MATHEMATICS);

COMPUTATION; DATA; IMAGES;

EID: 29844445531     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24741-8_39     Document Type: Article

References (21)

1. Jiang, T., Wang, L., Zhang, K.: Alignment of trees - an alternative to tree edit. Proc. Int. Conf. on Combinatorial Pattern Matching (CPM), LNCS 807 (1994) 75-86
2. Selkow, S.: The tree-to-tree editing problem. Information Processing Letters 6 (1977)576-584
3. Zhang, K.: A constrained editing distance between unordered labeled trees. Algorithmica 15 (1996) 205-222
4. Wang, J.T.L., Zhang, K., Chang, G., Shasha, D.: Finding approximate pattersn in undirected acyclic graphs. Pattern Recognition 35 (2002) 473-483
5. Nierman, A., Jagadish, H.V.: Evaluating structural similarity in XML documents. In: Proc. 5th Int. Workshop on the Web and Databases (WebDB 2002), Madison, Wisconsin, USA. (2002) 61-66
6. Sebastian, T.B., Klein, P.N., Kimia, B.B.: Recognition of shapes by editing shock graphs. In: Proc. 8th Int. Conf. on Computer Vision (ICCV'0l), Vancouver, BC, Canada. Volume 1. (2001) 755-762
7. Bunke, H., Shearer, K.: A graph distance metric based on the maximal common subgraph. Pattern Recognition Letters 19 (1998) 255-259
8. Chartrand, G., Kubicki, G., Schultz, M.: Graph similarity and distance in graphs. Aequationes Mathematicae 55 (1998) 129-145
9. Kubicka, E., Kubicki, G., Vakalis, I.: Using graph distance in object recognition. In: Proc. ACM Computer Science Conference. (1990) 43-18
10. Papadopoulos, A., Manolopoulos, Y.: Structure-based similarity search with graph histograms. In: Proc. DEXA/IWOSS Int. Workshop on Similarity Search. (1999) 174-178
11. Levenshtein.V.: Binary codes capable of correcting deletions, insertions and reversals. Soviet Physics-Doklady 10 (1966) 707-710
12. Wagner, R.A., Fisher, M.J.: The string-to-string correction problem. Journal of the ACM 21 (1974) 168-173
13. Zhang, K., Statman, R., Shasha, D.: On the editing distance between unordered labeled trees. Information Processing Letters 42 (1992) 133-139
14. Zhang, K., Wang, J., Shasha, D.: On the editing distance between undirected acyclic graphs. International Journal of Foundations of Computer Science 7 (1996) 43-57
15. Agrawal, R., Faloutsos, C., Swami, A.N.: Efficient similarity search in sequence databases. In: Proc. 4th Int. Conf. of Foundations of Data Organization and Algorithms (FODO). (1993) 69-84
16. Seidl, T., Kriegel, H.P.: Optimal multi-step k-nearest neighbor search. In Haas, L.M.,Tiwary, A., eds.: Proc. ACM SIGMOD Int. Conf. on Managment of Data, ACM Press (1998) 154-165
17. Berchtold, S., Keim, D., Kriegel, H.P.: The X-tree: An index structure for high-dimensional data. In: 22nd Conference on Very Large Databases, Bombay, India (1996) 28-39
18. Chavez, E., Navarro, G., Baeza-Yates, R., Marroquin, J.: Searching in metric spaces. ACM Computing Surveys 33 (2001) 273-321
19. Ciaccia, P., Patella, M., Zezula, P.: M-tree: An efficient access method for similarity search in metric spaces. In: VLDB'97, Proc. 23rd Int. Conf. on Very Large Databases, August 25-29, 1997, Athens, Greece. (1997) 426-435
20. Wang, J., Zhang, K., Jeong, K., Shasha, D.: A system for approximate tree matching. IEEE Transactions on Knowledge and Data Engineering 6 (1994) 559-571
21. Ester, M., Kriegel, H.P., Schubert, M.: Web site mining: A new way to spot competitors, customers and suppliers in the world wide web. In: Proc. 8th Int. Conf on Knowledge Discovery in Databases (SIGKDD'02), Edmonton, Alberta, Canada. (2002) 249-258