메뉴 건너뛰기




Volumn , Issue , 2006, Pages 751-760

Compressing and searching XML data via two zips

Author keywords

Labeled trees; XML compression and indexing

Indexed keywords

COMPRESSED INDEX; LABELED TREES; REPRESENTATION OF A DOCUMENT; XML COMPRESSION; CONTENT SEARCH; NATIVE STATE; ORDER OF MAGNITUDE; SEARCHING ENGINE; STANDARD FORMAT; THEORETICAL ALGORITHMS; TREE REPRESENTATION; XML COMPRESSION AND INDEXING; XML DATA; XML DATA SOURCES; XML FILES; XML INDEXING; XML REPRESENTATION;

EID: 34250636362     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1135777.1135891     Document Type: Conference Paper
Times cited : (53)

References (29)
  • 1
    • 85081443799 scopus 로고    scopus 로고
    • http://xml.coverpages.org/xml.html.
  • 6
    • 27344447955 scopus 로고    scopus 로고
    • XML document indexes: A classification
    • September-October
    • B. Catania, A. Maddalena, and A. Vakali. XML document indexes: a classification. In IEEE Internet Computing, pages 64-71, September-October 2005.
    • (2005) IEEE Internet Computing , pp. 64-71
    • Catania, B.1    Maddalena, A.2    Vakali, A.3
  • 7
    • 27344440048 scopus 로고    scopus 로고
    • On boosting holism in XML twig pattern matching using structural indexing techniques
    • T. Chen, J. Lu, and T. W. Lin. On boosting holism in XML twig pattern matching using structural indexing techniques. In A CM Sigmod, pages 455-466, 2005.
    • (2005) A CM Sigmod , pp. 455-466
    • Chen, T.1    Lu, J.2    Lin, T.W.3
  • 8
    • 0035008559 scopus 로고    scopus 로고
    • Compressing XML with multiplexed hierarchical PPM models
    • J. Cheney. Compressing XML with multiplexed hierarchical PPM models. In IEEE Data Compression Conference, pages 163-172, 2001.
    • (2001) IEEE Data Compression Conference , pp. 163-172
    • Cheney, J.1
  • 9
    • 34250192866 scopus 로고    scopus 로고
    • An empirical evaluation of simple DTD-conscious compression techniques
    • J. Cheney. An empirical evaluation of simple DTD-conscious compression techniques. In WebDB, 2005.
    • (2005) WebDB
    • Cheney, J.1
  • 11
    • 33748626529 scopus 로고    scopus 로고
    • Structuring labeled trees for optimal succinctness, and beyond
    • P. Ferragina, F. Luccio, G. Manzini, and S. Muthukrishnan. Structuring labeled trees for optimal succinctness, and beyond. In IEEE Foes, pages 184-193, 2005.
    • (2005) IEEE Foes , pp. 184-193
    • Ferragina, P.1    Luccio, F.2    Manzini, G.3    Muthukrishnan, S.4
  • 12
    • 0035367304 scopus 로고    scopus 로고
    • An experimental study of a compressed index
    • P. Ferragina and G. Manzini. An experimental study of a compressed index. Information Sciences, 135:13-28, 2001.
    • (2001) Information Sciences , vol.135 , pp. 13-28
    • Ferragina, P.1    Manzini, G.2
  • 13
    • 30544432152 scopus 로고    scopus 로고
    • Indexing compressed text
    • P. Ferragina and G. Manzini. Indexing compressed text. Journal of the ACM, 52(4):552-581, 2005.
    • (2005) Journal of the ACM , vol.52 , Issue.4 , pp. 552-581
    • Ferragina, P.1    Manzini, G.2
  • 14
    • 1842421216 scopus 로고    scopus 로고
    • Succinct ordinal trees with level-ancestor queries
    • R. F. Geary, R. Raman, and V. Raman. Succinct ordinal trees with level-ancestor queries. In ACM-SIAM Soda, 2004.
    • (2004) ACM-SIAM Soda
    • Geary, R.F.1    Raman, R.2    Raman, V.3
  • 15
    • 18144417474 scopus 로고    scopus 로고
    • Will binary XML speed network traffic?
    • April
    • D. Geer. Will binary XML speed network traffic? IEEE Computer, pages 16-18, April 2005.
    • (2005) IEEE Computer , pp. 16-18
    • Geer, D.1
  • 16
    • 84994092452 scopus 로고    scopus 로고
    • Dataguides: Enabling query formulation and optimization in semistructured databases
    • R. Goldman and J. Widom. Dataguides: enabling query formulation and optimization in semistructured databases. In VLDB, pages 436-445, 1997.
    • (1997) VLDB , pp. 436-445
    • Goldman, R.1    Widom, J.2
  • 17
    • 85081446998 scopus 로고    scopus 로고
    • Rank/Select operations on large alphabets: A tool for text indexing
    • A. Golinsky, I. Munro, and S. Rao. Rank/Select operations on large alphabets: a tool for text indexing. In ACM-SIAM SODA, 2006.
    • (2006) ACM-SIAM SODA
    • Golinsky, A.1    Munro, I.2    Rao, S.3
  • 20
    • 85081442753 scopus 로고    scopus 로고
    • W. Y. Lam, W. Ng, P. T. Wood, and M. Levene. XCQ: XML compression and querying system. In WWW, 2003.
    • W. Y. Lam, W. Ng, P. T. Wood, and M. Levene. XCQ: XML compression and querying system. In WWW, 2003.
  • 21
    • 0039785296 scopus 로고    scopus 로고
    • XMILL: An efficient compressor for XML data
    • H. Liefke and D. Suciu. XMILL: An efficient compressor for XML data. In ACM Sigmod, pages 153-164, 2000.
    • (2000) ACM Sigmod , pp. 153-164
    • Liefke, H.1    Suciu, D.2
  • 22
    • 80052793558 scopus 로고    scopus 로고
    • Index structures for path expressions
    • T. Milo and D. Suciu. Index structures for path expressions. In ICDT, pages 277-295, 1999.
    • (1999) ICDT , pp. 277-295
    • Milo, T.1    Suciu, D.2
  • 23
    • 1142291604 scopus 로고    scopus 로고
    • Xpress: A queriable compression for XML data
    • Jun-Ki Min, Myung-Jae Park, and Chin-Wan Chung. Xpress: A queriable compression for XML data. In ACM Sigmod, pages 122-133, 2003.
    • (2003) ACM Sigmod , pp. 122-133
    • Min, J.1    Park, M.2    Chung, C.3
  • 25
    • 2442531722 scopus 로고    scopus 로고
    • PRIX: Indexing and querying XML using Prüfer sequences
    • P. R. Raw and B. Moon. PRIX: Indexing and querying XML using Prüfer sequences. In ICDE, pages 288-300, 2004.
    • (2004) ICDE , pp. 288-300
    • Raw, P.R.1    Moon, B.2
  • 27
    • 0036203985 scopus 로고    scopus 로고
    • XGRIND: A query-friendly XML compressor
    • P. M. Tolani and J. R. Haritsa. XGRIND: A query-friendly XML compressor. In ICDE, pages 225-234, 2002.
    • (2002) ICDE , pp. 225-234
    • Tolani, P.M.1    Haritsa, J.R.2
  • 28
    • 1142267353 scopus 로고    scopus 로고
    • H. Wang, S. Park, W. Fan, and P. S. Yu. ViST: a dynamic index methd for querying XML data by tree structures. In ACM Sigmod, pages 110-121, 2003.
    • H. Wang, S. Park, W. Fan, and P. S. Yu. ViST: a dynamic index methd for querying XML data by tree structures. In ACM Sigmod, pages 110-121, 2003.
  • 29
    • 33645028326 scopus 로고    scopus 로고
    • Efficient processing of XML path queries using the disk-based F&B index
    • W. Wang, H. Wang, H. Lu, H. Jang, X. Lin, and J. Li. Efficient processing of XML path queries using the disk-based F&B index. In VLDB, pages 145-156, 2005.
    • (2005) VLDB , pp. 145-156
    • Wang, W.1    Wang, H.2    Lu, H.3    Jang, H.4    Lin, X.5    Li, J.6


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