메뉴 건너뛰기




Volumn , Issue , 2006, Pages 247-258

An incrementally maintainable index for approximate lookups in hierarchical data

Author keywords

[No Author keywords available]

Indexed keywords

DATA CHANGE; HIERARCHICAL DATA; INCREMENTAL MAINTENANCE; INDEX STRUCTURE; IT SUPPORTS; LOOKUPS; PERFORMANCE; SYNTHETIC AND REAL DATA; TREE PATTERN;

EID: 84864285827     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (8)

References (20)
  • 1
    • 0036209423 scopus 로고    scopus 로고
    • Structural joins: A primitive for efficient XML query pattern matching
    • IEEE Computer Society
    • S. Al-Khalifa, H. V. Jagadish, J. M. Patel, Y. Wu, N. Koudas, and D. Srivastava. Structural joins: A primitive for efficient XML query pattern matching. In Proc. of ICDE, pages 141-152. IEEE Computer Society, 2002.
    • (2002) Proc. of ICDE , pp. 141-152
    • Al-Khalifa, S.1    Jagadish, H.V.2    Patel, J.M.3    Wu, Y.4    Koudas, N.5    Srivastava, D.6
  • 2
    • 33745628382 scopus 로고    scopus 로고
    • Approximate matching of hierarchical data using pg-grams
    • Morgan Kaufmann Publishers Inc.
    • N. Augsten, M. Böhlen, and J. Gamper. Approximate matching of hierarchical data using pg-grams. In Proc. of VLDB, pages 301-312. Morgan Kaufmann Publishers Inc., 2005.
    • (2005) Proc. of VLDB , pp. 301-312
    • Augsten, N.1    Böhlen, M.2    Gamper, J.3
  • 3
    • 0036367943 scopus 로고    scopus 로고
    • Holistic twig joins: Optimal XML pattern matching
    • ACM Press
    • N. Bruno, N. Koudas, and D. Srivastava. Holistic twig joins: Optimal XML pattern matching. In Proc. of SIGMOD, pages 310-321. ACM Press, 2002.
    • (2002) Proc. of SIGMOD , pp. 310-321
    • Bruno, N.1    Koudas, N.2    Srivastava, D.3
  • 4
    • 0036205449 scopus 로고    scopus 로고
    • Detecting changes in XML documents
    • IEEE Computer Society
    • G. Cobéna, S. Abiteboul, and A. Marian. Detecting changes in XML documents. In Proc. of ICDE, pages 41-52. IEEE Computer Society, 2002.
    • (2002) Proc. of ICDE , pp. 41-52
    • Cobéna, G.1    Abiteboul, S.2    Marian, A.3
  • 6
    • 23944432428 scopus 로고    scopus 로고
    • XML stream processing using tree-edit distance embeddings
    • M. Garofalakis and A. Kumar. XML stream processing using tree-edit distance embeddings. ACM Trans, on Database Systems, 30(1):279-332, 2005.
    • (2005) ACM Trans, on Database Systems , vol.30 , Issue.1 , pp. 279-332
    • Garofalakis, M.1    Kumar, A.2
  • 8
    • 0344496626 scopus 로고    scopus 로고
    • Index-based approximate XML joins
    • IEEE Computer Society
    • S. Guha, N. Koudas, D. Srivastava, and T. Yu. Index-based approximate XML joins. In Proc. of ICDE, pages 708-710. IEEE Computer Society, 2003.
    • (2003) Proc. of ICDE , pp. 708-710
    • Guha, S.1    Koudas, N.2    Srivastava, D.3    Yu, T.4
  • 9
    • 0344065589 scopus 로고    scopus 로고
    • XR-tree: Indexing XML data for efficient structural joins
    • IEEE Computer Society
    • H. Jiang, H. Lu, W. Wang, and B. C. Ooi. XR-tree: Indexing XML data for efficient structural joins. In Proc. of ICDE, pages 253-263. IEEE Computer Society, 2003.
    • (2003) Proc. of ICDE , pp. 253-263
    • Jiang, H.1    Lu, H.2    Wang, W.3    Ooi, B.C.4
  • 11
    • 29844437563 scopus 로고    scopus 로고
    • Updates for structure indexes
    • Morgan Kaufmann Publishers Inc.
    • R. Kaushik, P. Bohannon, J. F. Naughton, and P. Shenoy. Updates for structure indexes. In Proc. of VLDB, pages 239-250. Morgan Kaufmann Publishers Inc., 2002.
    • (2002) Proc. of VLDB , pp. 239-250
    • Kaushik, R.1    Bohannon, P.2    Naughton, J.F.3    Shenoy, P.4
  • 13
    • 0037531629 scopus 로고    scopus 로고
    • Indexing and querying XML data for regular path expressions
    • Morgan Kaufmann Publishers Inc.
    • Q. Li and B. Moon. Indexing and querying XML data for regular path expressions. In Proc. of VLDB, pages 361-370. Morgan Kaufmann Publishers Inc., 2001.
    • (2001) Proc. of VLDB , pp. 361-370
    • Li, Q.1    Moon, B.2
  • 15
    • 1142303692 scopus 로고    scopus 로고
    • D(k)-index: An adaptive structural summary for graph-structured data
    • ACM Press
    • C. Qun, A. Lim, and K. W. Ong. D(k)-index: An adaptive structural summary for graph-structured data. In Proc. of SIGMOD, pages 134-144. ACM Press, 2003.
    • (2003) Proc. of SIGMOD , pp. 134-144
    • Qun, C.1    Lim, A.2    Ong, K.W.3
  • 16
    • 28444435105 scopus 로고    scopus 로고
    • Efficient creation and incremental maintenance of the HOPI index for complex XML document collections
    • IEEE Computer Society
    • R. Schenkel, A. Theobald, and G. Weikum. Efficient creation and incremental maintenance of the HOPI index for complex XML document collections. In ICDE, pages 360-371. IEEE Computer Society, 2005.
    • (2005) ICDE , pp. 360-371
    • Schenkel, R.1    Theobald, A.2    Weikum, G.3
  • 17
    • 0027113212 scopus 로고
    • Approximate string-matching with q-grams and maximal matches
    • E. Ukkonen. Approximate string-matching with q-grams and maximal matches. Theoretical Computer Science, 92(1):191-211, 1992.
    • (1992) Theoretical Computer Science , vol.92 , Issue.1 , pp. 191-211
    • Ukkonen, E.1
  • 18
    • 29844441371 scopus 로고    scopus 로고
    • DogmatiX tracks down duplicates in XML
    • ACM Press
    • M. Weis and F. Naumann. DogmatiX tracks down duplicates in XML. In Proc. of SIGMOD, pages 431-442. ACM Press, 2005.
    • (2005) Proc. of SIGMOD , pp. 431-442
    • Weis, M.1    Naumann, F.2
  • 19
    • 29844449569 scopus 로고    scopus 로고
    • Similarity evaluation on tree-structured data
    • ACM Press
    • R. Yang, P. Kalnis, and A. K. H. Tung. Similarity evaluation on tree-structured data. In Proc. of SIGMOD, pages 754-765. ACM Press, 2005.
    • (2005) Proc. of SIGMOD , pp. 754-765
    • Yang, R.1    Kalnis, P.2    Tung, A.K.H.3
  • 20
    • 0024889169 scopus 로고
    • Simple fast algorithms for the editing distance between trees and related problems
    • K. Zhang and D. Shasha. Simple fast algorithms for the editing distance between trees and related problems. SIAM Journal on Computing, 18(6):1245-1262, 1989.
    • (1989) SIAM Journal on Computing , vol.18 , Issue.6 , pp. 1245-1262
    • Zhang, K.1    Shasha, D.2


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