Similarity evaluation on tree-structured data

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2005, Pages 754-765

  Yang, Rui ^a   Kalnis, Panos ^a   Tung, Anthony K H ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATABASE SYSTEMS; MATHEMATICAL TRANSFORMATIONS; PROBLEM SOLVING; TREES (MATHEMATICS); VECTORS;

DATA MANIPULATION; MULTIDIMENSIONAL VECTORS; SIMILARITY EVALUATION; TREE-STRUCTURED DATA;

DATA STRUCTURES;

EID: 29844449569     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1066157.1066243     Document Type: Conference Paper

References (23)

1. C. C. Aggarwal, J. L. wolf, and P. S. Yu. A new method for similarity indexing of market basket data. In SIGMOD, pages 407-418, 1999.
2. E. Chávez, G. Navarro, R. Baeza-Yates, and J. L. Marrquín. Proximity searching in metric spaces. ACM Computing Surveys, 33(3):273-321, 2001.
3. Edgar Chavez and Gonzalo Navarro. Towards measuring the searching complexity of metric sapces. In Proc. of the Mexican Computing Meeting, pages 969-978, 2001.
4. Minos Garofalakis and Amit Kumar. Correlating XML data streams using tree-edit distance embeddings. In PODS, pages 143-154, June 2003.
5. Luis Gravano, Panagiotis G. Ipeirotis, H. V. Jagadish, Nick Koudas, S. Muthukrishnan, and Divesh Srivastava, Approximate string joins in a database (almost) for free. In VLDB, pages 327-340, 2001.
6. A. Guttman. R-trees: a dynamic index structure for spatial searching, In SIGMOD, pages 47-57, 1984.
7. K. Kailing, H. P. Kriegel, S. Schönauer, and T. Seidl. Efficient similarity search for hierarchical data in large databases, In EDBT, pages 676-693, March. 2004.
8. Juha Kärkkäinen. Computing the threshold for q-gram filters, In SWAT, pages 348-357, 2002.
9. Donald E. Knuth, The Art of Computer Programming. Addison-Wesley Pub Co, 1997.
10. Nikos Mamoulis, David W. Cheung, and Wang Lian. Similarity search in sets and categorical data using the signature tree. In ICDE, pages 75-86, 2003.
11. Alexandros Nanopoulos and Yannis Manolopoulos. Efficient similarity search for market basket data. The VLDB Journal, 11(2):138-152, 2002.
12. Y. Sakurai, M. Yoshikawa, S. Uemura, and H. Kojima, The A-tree: An index structure for high-dimensional spaces using relative approximation, In VLDB, pages 516-526, 2000.
13. Thomas Seidl and Hans-Peter Kriegel. Optimal multi-step k-nearest neighbor search. In SIGMOD, pages 154-165.
14. Stanley M. Selkow. The tree-to-tree editing problem, Information Processing Letters, 6:184-186, December 1977.
15. S.Guha, H. V. Jagadish, N. Koudas, D. Srivastava, and T. Yu. Approximate XML joins. In SIGMOD, pages 287-298, June 2002.
16. Dennis Shasha and Kaizhong Zhang. Approximate Tree Pattern Matching, Oxford University, 1997.
17. Erkki Sutinen and Jorma Tarhio. On using c-gram locations in approximate string matching. In Proc. of 3rd Annual European Symposium, pages 327-340, 1995.
18. Jiang Tao, Lusheng Wang, and Kaizhong Zhang. Alignment of trees - an alternative to tree edit. In Theoretical Computer Science, volume 143, pages 75-86, 1995.
19. Esko Ukkonen. Approximate string-matching with q-grams and maximal matches. Theoretical Computer Science, 92:191-211, 1992.
20. R. Weber, H.-J. Schek, and S. Blott. A quantitative ananlysis and performance study for similarity search methods in high-dimensional space. In VLDB, pages 194-205, 1998.
21. Mohammed J. Zaki. Efficiently mining frequent trees in a forest. In SIGKDD, pages 71-80, 2002.
22. Kaizhong Zhang. Algorithms for the constrained editing distance between ordered labelled trees and related problems. In Pattern Regonition, volume 28, pages 463-474, 1995.
23. Kaizhong Zhang and Dennis Shasha. Simple fast algorithms for the editing distance between trees and related problems. SIAM Journal on Computing, 18:1245-1262, December 1989.