메뉴 건너뛰기




Volumn 1 DISI, Issue , 2010, Pages 142-150

CLUX: Clustering XML sub-trees

Author keywords

Grammar based compression; XML compression; XML sub tree clustering

Indexed keywords

ATTRIBUTE VALUES; BLOW-UP; CLUSTER-BASED; DATA EXCHANGE; DATA VOLUME; DE FACTO STANDARD; DOM TREE; ENTERPRISE INFORMATION SYSTEM; GRAMMAR-BASED COMPRESSION; MEMORY CONSUMPTION; SPACE EFFICIENT; XML COMPRESSION; XML DATA; XML MARKUP; XML TREES;

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

References (28)
  • 10
    • 58049178200 scopus 로고    scopus 로고
    • Efficient Memory Representation of XML Dokuments
    • G. Busatto, M. Lohrey, and S. Maneth, 2005. Efficient Memory Representation of XML Dokuments, DBPL.
    • (2005) DBPL
    • Busatto, G.1    Lohrey, M.2    Maneth, S.3
  • 12
    • 24644458263 scopus 로고    scopus 로고
    • XQzip, 2004. Querying Compressed XML Using Structural Indexing
    • J. Cheng, W. Ng: XQzip, 2004. Querying Compressed XML Using Structural Indexing. EDBT.
    • EDBT
    • Cheng, J.1    Ng, W.2
  • 15
    • 34548810784 scopus 로고    scopus 로고
    • Structural Selectivity Estimation for XML Documents
    • D. K. Fisher and S. Maneth, 2007. Structural Selectivity Estimation for XML Documents. In Proc of the ICDE.
    • (2007) Proc of the ICDE
    • Fisher, D.K.1    Maneth, S.2
  • 17
    • 84938015047 scopus 로고
    • A method for the construction of minimum-redundancy codes
    • D. A. Huffman, 1952. A method for the construction of minimum-redundancy codes. In: Proc. of the I.R.E.
    • (1952) Proc. of the I.R.E.
    • Huffman, D.A.1
  • 19
    • 0039785296 scopus 로고    scopus 로고
    • XMill: An Efficient Compressor for XML Data
    • H. Liefke and D. Suciu, 2000. XMill: An Efficient Compressor for XML Data, Proc. of ACM SIGMOD.
    • (2000) Proc. of ACM SIGMOD
    • Liefke, H.1    Suciu, D.2
  • 24
    • 78649847303 scopus 로고    scopus 로고
    • Compressing XML Documents Using Recursive Finite State Automata
    • H. Subramanian, P. Shankar: Compressing XML Documents Using Recursive Finite State Automata. CIAA 2005
    • CIAA 2005
    • Subramanian, H.1    Shankar, P.2
  • 25
    • 0036203985 scopus 로고    scopus 로고
    • XGRIND: A query-friendly XML compressor
    • P. M. Tolani and J. R. Hartisa, 2002. XGRIND: A query-friendly XML compressor. In Proc. ICDE.
    • (2002) Proc. ICDE
    • Tolani, P.M.1    Hartisa, J.R.2
  • 27
    • 2442458711 scopus 로고    scopus 로고
    • A Succinct Physical Storage Scheme for Efficient Evaluation of Path Queries in XML
    • N. Zhang, V. Kacholia, M. T. Özsu, 2004. A Succinct Physical Storage Scheme for Efficient Evaluation of Path Queries in XML. ICDE
    • (2004) ICDE
    • Zhang, N.1    Kacholia, V.2    Özsu, M.T.3
  • 28
    • 0017493286 scopus 로고    scopus 로고
    • A Universal Algorithm for Sequential Data Compression, 1977
    • J. Ziv and A. Lempel: A Universal Algorithm for Sequential Data Compression, 1977. In IEEE Transactions on Information Theory, No. 3, Volume 23, 337-343
    • IEEE Transactions on Information Theory , vol.23 , Issue.3 , pp. 337-343
    • Ziv, J.1    Lempel, A.2


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