Skip to main content

Indexing Compressed XML Documents

  • Conference paper
Web-Age Information Management (WAIM 2012)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 7419))

Included in the following conference series:

Abstract

XML data compression process seems to be inevitable to solve some problems related to the evolutionary growth of such data. Therefore, the indexing of compressed XML data, meanwhile, remains an important process and needs improvement and development in order to exploit the compressed data for querying and information retrieval. This work consists in studying and analyzing some suitable compressors to improve the indexing compressed XML documents process in order to query them later. We propose a new indexing process which leads in compressed XML data by re-indexing compressed XML data under XMill compressor.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baldonado, M., Chang, C.-C.K., Gravano, L., Paepcke, A.: The Stanford Digital Library Metadata Architecture. Int. J. Digit. Libr. 1, 108–121 (1997)

    Article  Google Scholar 

  2. World Wide Web Consortium, XQuery 1.0: An XML Query Language, W3C Working Draft (2004)

    Google Scholar 

  3. Goldfarb, C.: The SGML Handbook. Oxford University Press, Oxford (1990)

    Google Scholar 

  4. Cheney, J.: Compressing XML with Multiplexed Hierarchical PPM Models. In: Proceedings of the Data Compression Conference, Washington, DC, USA (2001)

    Google Scholar 

  5. Gailly, J.-L.: Gzip, version 1.2.4., http://www.gzip.org/

  6. Seward, J.: bzip2, version 0.9.5d., http://sources.redhat.com/bzip2/

  7. Subramanian, H., Shankar, P.: Compressing XML Documents Using Recursive Finite State Automata. In: Farré, J., Litovsky, I., Schmitz, S. (eds.) CIAA 2005. LNCS, vol. 3845, pp. 282–293. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  8. Adiego, J., De la Fuente, P., Navarro, G.: Merging prediction by partial matching with structural contexts model. In: Proceedings of the 2004 IEEE Data Compression Conference, p. 522 (2004)

    Google Scholar 

  9. Tolani, P.M., Haritsa, J.R.: XGRIND: A Query-friendly XML Compressor. In: IEEE Proceedings of the 18th International Conference on Data Engineering (2002)

    Google Scholar 

  10. Cheney, J.: Compressing XML with Multiplexed Hierarchical PPM Models. In: Data Compression Conference, pp. 163–172 (2001)

    Google Scholar 

  11. Hartmut, L., Dan, S.: XMill: An Efficient Compressor for XML Data. In: SIGMOD Conference, pp. 153–164 (2000)

    Google Scholar 

  12. Dietz, P., Sleator, D.: Two Algorithms for Maintaining Order in a List. In: 19th Annual ACM Symposium on Theory of Computing, pp. 365–372. ACM Press (1987)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jedidi, A., Arfaoui, O., Sassi-Hidri, M. (2012). Indexing Compressed XML Documents. In: Bao, Z., et al. Web-Age Information Management. WAIM 2012. Lecture Notes in Computer Science, vol 7419. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33050-6_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-33050-6_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33049-0

  • Online ISBN: 978-3-642-33050-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics