SCOPUS 정보 검색 플랫폼

Volumn 3841 LNCS, Issue , 2006, Pages 319-330

Approximate top-k structural similarity search over XML documents

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DIGITAL LIBRARIES; ELECTRONIC DOCUMENT EXCHANGE; HIERARCHICAL SYSTEMS; QUERY LANGUAGES; SEARCH ENGINES;

EDIT OPERATION COSTS; STRUCTURAL SUMMARIES; TOP-K STRUCTURAL SIMILARITY SEARCH; XML DOCUMENTS;

XML;

EID: 33745644286 PISSN: 03029743 EISSN: 16113349 Source Type: Book Series
DOI: 10.1007/11610113_29 Document Type: Conference Paper

Times cited : (8)

References (16)

1
- 0024889169
- Simple fast algorithms for the editing distance between trees and related problems
- Zhang, K., Shasha, D.: Simple fast algorithms for the editing distance between trees and related problems. SIAM J. Comput.18 (1989) 1245-1262
- (1989) SIAM J. Comput. , vol.18 , pp. 1245-1262
- Zhang, K.¹ Shasha, D.²

2
- 35048847659
- Clustering XML documents using structural summaries
- Dalamagas, T., Cheng, T., Winkel, K., Sellis, T.: Clustering XML Documents using Structural Summaries. In EDBT Workshops (2004) 547-556
- (2004) EDBT Workshops , pp. 547-556
- Dalamagas, T.¹ Cheng, T.² Winkel, K.³ Sellis, T.⁴

3
- 0018491659
- The tree-to-tree correction problem
- Tai, K: The Tree-to-Tree Correction Problem. J. of the ACM. 26 No. 3. (1979) 422-433
- (1979) J. of the ACM. , vol.26 , Issue.3 , pp. 422-433
- Tai, K.¹

4
- 0028406997
- Exact and approximate algorithms for unordered tree matching
- Shasha, D., Wang, J., Zhang, K., Shih, F.: Exact and approximate algorithms for unordered tree matching. IEEE rans. Sys. Man. Cyber. 24 (1994) 668-678
- (1994) IEEE Rans. Sys. Man. Cyber. , vol.24 , pp. 668-678
- Shasha, D.¹ Wang, J.² Zhang, K.³ Shih, F.⁴

5
- 0001122858
- The tree-to-tree editing problem
- Selkow, S.: The tree-to-tree editing problem. Information Processing Letters. 6 184-186
- Information Processing Letters , vol.6 , pp. 184-186
- Selkow, S.¹

6
- 0001858630
- A constrained editing distance between unordered labeled trees
- Zhang, K.: A constrained editing distance between unordered labeled trees. Algorithmica 15 (1996) 205-222
- (1996) Algorithmica , vol.15 , pp. 205-222
- Zhang, K.¹

7
- 0000307499
- On the editing distance between unordered labeled trees
- Zhang, K., Statman, R., Shasha, D.: On the editing distance between unordered labeled trees. Inf. Process. Lett. 42 (1992) 133-139
- (1992) Inf. Process. Lett. , vol.42 , pp. 133-139
- Zhang, K.¹ Statman, R.² Shasha, D.³

8
- 4644340823
- Automatic web news extraction using tree edit distance
- Castro, D., Golgher, P., Suva, A., Laender, A.: Automatic web news extraction using tree edit distance. In WWW (2004) 502-511
- (2004) WWW , pp. 502-511
- Castro, D.¹ Golgher, P.² Suva, A.³ Laender, A.⁴

9
- 14644393851
- Evaluating structural similarity in XML documents
- Nierman, A., Jagadish, H.: Evaluating structural similarity in XML documents. In WebDB (2002) 61-66
- (2002) WebDB , pp. 61-66
- Nierman, A.¹ Jagadish, H.²

10
- 0002816102
- Comparing hierarchical data in extended memory
- Chawathe, S: Comparing hierarchical data in extended memory. In VLDB (1999) 90-101
- (1999) VLDB , pp. 90-101
- Chawathe, S.¹

11
- 29844445531
- Efficient similarity search for hierarchical data in large databases
- Kailing, K., Kriegel, H., Schönauer, S., Seidl, T.: Efficient Similarity Search for Hierarchical Data in Large Databases. In EDBT (2004) 676-693
- (2004) EDBT , pp. 676-693
- Kailing, K.¹ Kriegel, H.² Schönauer, S.³ Seidl, T.⁴

12
- 29844449569
- Similarity evaluation on tree-structured data
- Yang, R., Kalnis, P., Tung, K.: Similarity Evaluation on Tree-structured Data. In SIGMOD (2005) 754-765
- (2005) SIGMOD , pp. 754-765
- Yang, R.¹ Kalnis, P.² Tung, K.³

13
- 2442437492
- Bertino, E., Guerrini, G., Mesiti, M.: Measuring the Structural Similarity among XML Documents and DTDs. (2001) http://www.disi.unige.it/person/ MesitiM
- (2001) Measuring the Structural Similarity among XML Documents and DTDs
- Bertino, E.¹ Guerrini, G.² Mesiti, M.³

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.