메뉴 건너뛰기




Volumn 2992, Issue , 2004, Pages 200-218

Efficient Query Evaluation over Compressed XML Data

Author keywords

[No Author keywords available]

Indexed keywords

DATA COMPRESSION RATIO; ECONOMIC AND SOCIAL EFFECTS; QUERY PROCESSING; XML;

EID: 35048854194     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24741-8_13     Document Type: Article
Times cited : (22)

References (30)
  • 2
  • 3
    • 0033884411 scopus 로고    scopus 로고
    • An Algebraic Compression Framework for Query Results
    • Chen, Z., Seshadri, P.: An Algebraic Compression Framework for Query Results. In: Proc. of the ICDE Conf. (2000)
    • (2000) Proc. of the ICDE Conf.
    • Chen, Z.1    Seshadri, P.2
  • 7
    • 0039785296 scopus 로고    scopus 로고
    • XMILL: An efficient compressor for XML data
    • Liefke, H., Suciu, D.: XMILL: An efficient compressor for XML data. In: Proc. of ACM SIGMOD. (2000)
    • (2000) Proc. of ACM SIGMOD.
    • Liefke, H.1    Suciu, D.2
  • 11
    • 84938015047 scopus 로고
    • A Method for Construction of Minimum-Redundancy Codes
    • Huffman, D.A.: A Method for Construction of Minimum-Redundancy Codes. In: Proc. of the IRE. (1952)
    • (1952) Proc. of the IRE.
    • Huffman, D.A.1
  • 12
    • 0040569149 scopus 로고    scopus 로고
    • Dictionary-Based Order-Preserving String Compression
    • Antoshenkov, G.: Dictionary-Based Order-Preserving String Compression. VLDB Journal 6 (1997) 26-39
    • (1997) VLDB Journal , vol.6 , pp. 26-39
    • Antoshenkov, G.1
  • 16
    • 0023364261 scopus 로고
    • Arithmetic Coding for Data Compression
    • Witten, I.H.: Arithmetic Coding For Data Compression. Communications of ACM (1987)
    • (1987) Communications of ACM
    • Witten, I.H.1
  • 17
    • 0000978261 scopus 로고
    • Optimal Computer Search Trees and Variable-Length Alphabetical Codes
    • Hu, T.C., Tucker, A.C.: Optimal Computer Search Trees And Variable-Length Alphabetical Codes. SIAM J. APPL. MATH 21 (1971) 514-532
    • (1971) SIAM J. APPL. MATH , vol.21 , pp. 514-532
    • Hu, T.C.1    Tucker, A.C.2
  • 21
    • 35048831287 scopus 로고    scopus 로고
    • Storage Techniques and Mapping Schemas for XML
    • Amer-Yahia, S.: Storage Techniques and Mapping Schemas for XML. SIGMOD Record (2003)
    • (2003) SIGMOD Record
    • Amer-Yahia, S.1
  • 23
    • 35048818930 scopus 로고    scopus 로고
    • Website: The bzip2 and libbzip2 Official Home Page
    • Website: The bzip2 and libbzip2 Official Home Page (2002) http://sources.redhat.com/bzip2/.
    • (2002)
  • 25
    • 35048858261 scopus 로고    scopus 로고
    • Website: Berkeley DB Data Store
    • Website: Berkeley DB Data Store (2003) http://www.sleepycat.com/pro- ducts/data.shtml.
    • (2003)
  • 27
    • 0036366836 scopus 로고    scopus 로고
    • Accelerating XPath location steps
    • T.Grust: Accelerating XPath location steps. In: Proc. of ACM SIGMOD. (2002) 109-120
    • (2002) Proc. of ACM SIGMOD. , pp. 109-120
    • Grust, T.1
  • 29
    • 35048853518 scopus 로고    scopus 로고
    • Website: The XML Query Language
    • Website: The XML Query Language (2003) http://www.w3.org/XML/Query.
    • (2003)
  • 30
    • 35048820920 scopus 로고    scopus 로고
    • Website: XQuery and XPath Full-text Use Cases
    • Website: XQuery and XPath Full-text Use Cases (2003) http://www.w3.org/ TR/xmlqueryfull-text-use-cases.
    • (2003)


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