Article

Compressing and searching XML data via two zips

Authors:

S. MuthukrishnanAuthors Info & Claims

WWW '06: Proceedings of the 15th international conference on World Wide Web

Pages 751 - 760

https://doi.org/10.1145/1135777.1135891

Published: 23 May 2006 Publication History

Abstract

XML is fast becoming the standard format to store, exchange and publish over the web, and is getting embedded in applications. Two challenges in handling XML are its size (the XML representation of a document is significantly larger than its native state) and the complexity of its search (XML search involves path and content searches on labeled tree structures). We address the basic problems of compression, navigation and searching of XML documents. In particular, we adopt recently proposed theoretical algorithms [11] for succinct tree representations to design and implement a compressed index for XML, called XBZIPiNDEX, in which the XML document is maintained in a highly compressed format, and both navigation and searching can be done uncompressing only a tiny fraction of the data. This solution relies on compressing and indexing two arrays derived from the XML data. With detailed experiments we compare this with other compressed XML indexing and searching engines to show that XBZIPiNDEX has compression ratio up to 35% better than the ones achievable by those other tools, and its time performance on some path and content search operations is order of magnitudes faster: few milliseconds over hundreds of MBs of XML files versus tens of seconds, on standard XML data sources.

References

[1]

http://xml.coverpages.org/xml.html.]]

[2]

J. Adiego, P. de la Fuente, and G. Navarro. Lempel-Ziv compression of structured text. In IEEE Data Compression Conference, 2004.]]

Digital Library

[3]

J. Adiego, P. de la Fuente, and G. Navarro. Merging prediction by partial matching with structural contexts model. In IEEE Data Compression Conference, page 522, 2004.]]

Digital Library

[4]

A. Arion, A. Bonifati, G. Costa, S. D'Aguanno, I. Manolescu, and A. Pugliese. XQueC: pushing queries to compressed XML data. In VLDB, 2003.]]

[5]

D. Benoit, E. Demaine, I. Munro, R. Raman, V. Raman, and S. Rao. Representing trees of higher degree. Algorithmica, 2005.]]

[6]

B. Catania, A. Maddalena, and A. Vakali. XML document indexes: a classification. In IEEE Internet Computing, pages 64--71, September-October 2005.]]

Digital Library

[7]

T. Chen, J. Lu, and T. W. Lin. On boosting holism in XML twig pattern matching using structural indexing techniques. In ACM Sigmod, pages 455--466, 2005.]]

Digital Library

[8]

J. Cheney. Compressing XML with multiplexed hierarchical PPM models. In IEEE Data Compression Conference, pages 163--172, 2001.]]

Digital Library

[9]

J. Cheney. An empirical evaluation of simple DTD-conscious compression techniques. In WebDB, 2005.]]

[10]

J. Cheng and W. Ng. XQzip: Querying compressed XML using structural indexing. In International Conference on Extending Database Technology, pages 219--236, 2004.]]

[11]

P. Ferragina, F. Luccio, G. Manzini, and S. Muthukrishnan. Structuring labeled trees for optimal succinctness, and beyond. In IEEE Focs, pages 184--193, 2005.]]

Digital Library

[12]

P. Ferragina and G. Manzini. An experimental study of a compressed index. Information Sciences, 135:13--28, 2001.]]

Digital Library

[13]

P. Ferragina and G. Manzini. Indexing compressed text. Journal of the ACM, 52(4):552--581, 2005.]]

Digital Library

[14]

R. F. Geary, R. Raman, and V. Raman. Succinct ordinal trees with level-ancestor queries. In ACM-SIAM Soda, 2004.]]

Digital Library

[15]

D. Geer. Will binary XML speed network traffic? IEEE Computer, pages 16--18, April 2005.]]

Digital Library

[16]

R. Goldman and J. Widom. Dataguides: enabling query formulation and optimization in semistructured databases. In VLDB, pages 436--445, 1997.]]

Digital Library

[17]

A. Golinsky, I. Munro, and S. Rao. Rank/Select operations on large alphabets: a tool for text indexing. In ACM-SIAM SODA, 2006.]]

Digital Library

[18]

R. Kaushik, R. Krishnamurthy, J. Naughton, and R. Ramakrishnan. On the integration of structure indexes and inverted lists. In ACM Sigmod, pages 779--790, 2004.]]

Digital Library

[19]

R. Kaushik, R. Krishnamurthy, J. F. Naughton, and R. Ramakrishnan. On the integration of structure indexes and inverted lists. In ACM Sigmod, 2004.]]

Digital Library

[20]

W. Y. Lam, W. Ng, P. T. Wood, and M. Levene. XCQ: XML compression and querying system. In WWW, 2003.]]

[21]

H. Liefke and D. Suciu. XMILL: An efficient compressor for XML data. In ACM Sigmod, pages 153--164, 2000.]]

Digital Library

[22]

T. Milo and D. Suciu. Index structures for path expressions. In ICDT, pages 277--295, 1999.]]

Digital Library

[23]

Jun-Ki Min, Myung-Jae Park, and Chin-Wan Chung. Xpress: A queriable compression for XML data. In ACM Sigmod, pages 122--133, 2003.]]

Digital Library

[24]

E. Moura, G. Navarro, N. Ziviani, and R. Baeza-Yates. Fast and flexible word searching on compressed text. ACM Transactions on Information Systems, 18(2):113--139, 2000.]]

Digital Library

[25]

P. R. Raw and B. Moon. PRIX: Indexing and querying XML using Pr"ufer sequences. In ICDE, pages 288--300, 2004.]]

Digital Library

[26]

D. Shkarin. PPM: One step to practicality. In IEEE Data Compression Conference, pages 202--211, 2002.]]

Digital Library

[27]

P. M. Tolani and J. R. Haritsa. XGRIND: A query-friendly XML compressor. In ICDE, pages 225--234, 2002.]]

Digital Library

[28]

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.]]

Digital Library

[29]

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.]]

Digital Library

Cited By

May M(2022)Donag: Generating Efficient Patches and Diffs for Compressed ArchivesACM Transactions on Storage10.1145/350791918:3(1-41)Online publication date: 21-Sep-2022
https://dl.acm.org/doi/10.1145/3507919
Suciu DHaritsa J(2018)XML CompressionEncyclopedia of Database Systems10.1007/978-1-4614-8265-9_783(4742-4748)Online publication date: 7-Dec-2018
https://doi.org/10.1007/978-1-4614-8265-9_783
Ferragina PNitto IVenturini R(2018)Text CompressionEncyclopedia of Database Systems10.1007/978-1-4614-8265-9_1151(4070-4072)Online publication date: 7-Dec-2018
https://doi.org/10.1007/978-1-4614-8265-9_1151
Show More Cited By

Index Terms

Compressing and searching XML data via two zips

Recommendations

Compressing XML with Multiplexed Hierarchical PPM Models
DCC '01: Proceedings of the Data Compression Conference

Abstract: Extensible Markup Language (XML) is a standardized language that "describes a class of data objects called XML documents and partially describes the behavior of computer programs which process them." According to Bosak and Bray, XML is the "...
Exchanging intensional XML data
SIGMOD '03: Proceedings of the 2003 ACM SIGMOD international conference on Management of data

XML is becoming the universal format for data exchange between applications. Recently, the emergence of Web services as standard means of publishing and accessing data on the Web introduced a new class of XML documents, which we call intensional ...
XML: Visual QuickStart Guide

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

WWW '06: Proceedings of the 15th international conference on World Wide Web

May 2006

1102 pages

ISBN:1595933239

DOI:10.1145/1135777

General Chairs:
Leslie Carr
University of Southampton
,
David De Roure
University of Southampton
,
Arun Iyengar
IBM Research
,
Program Chairs:
Carole Goble
University of Manchester, UK
,
Mike Dahlin
University of Texas at Austin

Copyright © 2006 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 23 May 2006

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

WWW06

Sponsor:

WWW06: The 15th International World Wide Web Conference 2006

May 23 - 26, 2006

Edinburgh, Scotland

Acceptance Rates

Overall Acceptance Rate 1,899 of 8,196 submissions, 23%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

56
Total Citations
View Citations
784
Total Downloads

Downloads (Last 12 months)11
Downloads (Last 6 weeks)5

Reflects downloads up to 13 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

May M(2022)Donag: Generating Efficient Patches and Diffs for Compressed ArchivesACM Transactions on Storage10.1145/350791918:3(1-41)Online publication date: 21-Sep-2022
https://dl.acm.org/doi/10.1145/3507919
Suciu DHaritsa J(2018)XML CompressionEncyclopedia of Database Systems10.1007/978-1-4614-8265-9_783(4742-4748)Online publication date: 7-Dec-2018
https://doi.org/10.1007/978-1-4614-8265-9_783
Ferragina PNitto IVenturini R(2018)Text CompressionEncyclopedia of Database Systems10.1007/978-1-4614-8265-9_1151(4070-4072)Online publication date: 7-Dec-2018
https://doi.org/10.1007/978-1-4614-8265-9_1151
Suciu DHaritsa J(2017)XML CompressionEncyclopedia of Database Systems10.1007/978-1-4899-7993-3_783-2(1-6)Online publication date: 25-Jan-2017
https://doi.org/10.1007/978-1-4899-7993-3_783-2
Ferragina PNitto IVenturini R(2017)Text CompressionEncyclopedia of Database Systems10.1007/978-1-4899-7993-3_1151-2(1-3)Online publication date: 2-Aug-2017
https://doi.org/10.1007/978-1-4899-7993-3_1151-2
Anjos ELee JSatti S(2016)SJSON: A succinct representation for JavaScript object notation documents2016 Eleventh International Conference on Digital Information Management (ICDIM)10.1109/ICDIM.2016.7829787(173-178)Online publication date: Sep-2016
https://doi.org/10.1109/ICDIM.2016.7829787
Manzini G(2016)XBWT TricksString Processing and Information Retrieval10.1007/978-3-319-46049-9_8(80-92)Online publication date: 21-Sep-2016
https://doi.org/10.1007/978-3-319-46049-9_8
Satti P(2016)Compressing and Indexing Structured TextEncyclopedia of Algorithms10.1007/978-1-4939-2864-4_430(401-407)Online publication date: 22-Apr-2016
https://doi.org/10.1007/978-1-4939-2864-4_430
Senthilkumar RNandagopal GRonald D(2015)QRFXFreeze: Queryable Compressor for RFXThe Scientific World Journal10.1155/2015/8647502015(1-8)Online publication date: 2015
https://doi.org/10.1155/2015/864750
Arroyuelo DClaude FManeth SMäkinen VNavarro GNguyen KSirén JVälimäki N(2015)Fast in-memory XPath search using compressed indexesSoftware—Practice & Experience10.1002/spe.222745:3(399-434)Online publication date: 1-Mar-2015
https://dl.acm.org/doi/10.1002/spe.2227
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents