Efficient Similarity Search for Hierarchical Data in Large Databases-Reference-Cited by-同舟云学术

Efficient Similarity Search for Hierarchical Data in Large Databases

Published:2004 Issue: Volume: Page:676-693
ISSN:0302-9743
Container-title:Advances in Database Technology - EDBT 2004
language:
Short-container-title:

Author:

Kailing Karin,Kriegel Hans-Peter,Schönauer Stefan,Seidl Thomas

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-24741-8_39

Reference21 articles.

1. Lecture Notes in Computer Science;T. Jiang,1994

2. Selkow, S.: The tree-to-tree editing problem. Information Processing Letters 6, 576–584 (1977)

3. Zhang, K.: A constrained editing distance between unordered labeled trees. Algorithmica 15, 205–222 (1996)

4. Wang, J.T.L., Zhang, K., Chang, G., Shasha, D.: Finding approximate pattersn in undirected acyclic graphs. Pattern Recognition 35, 473–483 (2002)

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, pp. 61–66 (2002)

Cited by 31 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Subtree Similarity Search Based on Structure and Text;Lecture Notes in Computer Science;2024

2. An overview of cluster-based image search result organization: background, techniques, and ongoing challenges;Knowledge and Information Systems;2022-02-11

3. Top-k Tree Similarity Join;Proceedings of the 30th ACM International Conference on Information & Knowledge Management;2021-10-26

4. Path Histogram Distance for Rooted Labeled Caterpillars;Intelligent Information and Database Systems;2018

5. Extend tree edit distance for effective object identification;Knowledge and Information Systems;2015-01-15