Skip to main content

A Non Redundant Compact XML Storage for Efficient Indexing and Querying of XML Documents

  • Conference paper
Global Trends in Computing and Communication Systems (ObCom 2011)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 269))

Included in the following conference series:

Abstract

XML is self describing and extensible. It is stored in the form of text document which makes it a cross platform technology independent of hardware and software. Because of such unique features XML is now recognized as standard for data storage and exchange over the net. Moreover size of XML database has also increased considerably. With such growing presence of XML in database technology there is ever increasing need to design compact non redundant storage for XML which can be effectively utilized for efficient indexing and querying of XML. The proposed technique (NRCX) stores the structure (path) and contents separately in the form of structure index and contents index respectively. The structure index provides id for all unique paths in the XML document. All data items for particular path id are grouped and stored together. This technique uniquely blends the path and the contents without the necessity of storing the path information repeatedly. This approach dramatically reduces the storage requirement for XML. The implementation of this technique and comparison with other techniques confirms our claim.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Al-Khalifa, S., Jagdish, H.V., Koudas, N., Patel, J.M., Srivastava, D., Wu, Y.: Structural Joins: A Primitive For Efficient Xml Query Pattern Matching. In: 18th International Conference on Data Engineering (ICDE), San Jose, CA, February 26-March 1, pp. 141–152 (2002)

    Google Scholar 

  2. Bruno, N., Koudas, N., Srivastava, D.: Holistic Twig Joins: Optimal XML Pattern Matching. In: 21st ACM SIGMOD Int. Conference on Management of Data (SIGMOD), pp. 310–321 (2002)

    Google Scholar 

  3. Bunaman, P., Grohe, M., Christioph, K.: Path Queries on Compressed XML. In: 29th VLDB Conference, Berlin Germany (2003)

    Google Scholar 

  4. Kaushik, R., Krishnamurthy, R., Naughton, J.F., Ramkrishnan, R.: On the Integration of Structure Index and Inverted List. In: 2004 ACM SIGMOD International Conference on Management of Data, Paris, France, June 13-18, pp. 779–790 (2004)

    Google Scholar 

  5. Liefke, H., Suciu, D.: XMill: An Efficient Compressor for XML Data. In: ACM SIGMOD International Conference on Management of Data, pp. 153–164 (2000)

    Google Scholar 

  6. Cheney, J.: Compressing XML with multiplexed hierarchical PPM models. In: Proceedings of the IEEE Data Compression Conference, pp. 163–172 (2000)

    Google Scholar 

  7. Chan, Z., Gehrke, J., Korn, F., Koudas, N., Shanmugasundram, J., Srivastava. D.: Index Structures for Matching XML Twigs using Relational Query Processor. In: 21st International Conference on Data Engineering Workshop ICDEW, Tokyo, Japan, April 5-8, pp. 1273–1283 (2005)

    Google Scholar 

  8. Totarinov, I., Vigals, S.D., Beyer, K., Shanmugasundram, J., Shekita, E., Zhang, C.: Storing and Querying Ordered XML using a Relational Database System. In: ACM SIGMOD Int’l Conference on Management of Data, Madison Wisconsin USA, June 3-6, pp. 204–215 (2002)

    Google Scholar 

  9. Tolani, P., Haritsa, J.: XGRIND: A Query-Friendly XML Compressor. In: 18th International Conference on Data Engineering (ICDE), pp. 225–234. IEEE Computer Society (2002)

    Google Scholar 

  10. Min, J., Park, M., Chung, C.: XPRESS: A Queriable Compression for XML Data. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, San Diego, California (2003)

    Google Scholar 

  11. Arion, A., Bonifati, A., Costa, G., Aguanno, S.D., Manolescu, I., Pugliese, A.: XQueC: Pushing queries to compressed XML data. In: 29th International Conference on Very Large Data Bases (2003)

    Google Scholar 

  12. Huang, Y.F., Wang, S.-H.: An efficient XML Processing based on combining T bitmap and Index Techniques. In IEEE Symposium on Computers and Communication ISCC, Marrakech, Morocco, July 6-9, pp. 858–863 (2008)

    Google Scholar 

  13. Ying, L., Yun, M.S.: Applying Dewey Encoding to Construct XML Index for Path and Keyword Query. In: First International Workshop on Database Technology and Application, Wuhan, Hubie, China, April 25-26, pp. 553–556 (2009)

    Google Scholar 

  14. Senthilkumar, R., Varshinee, P., Kannan, A.: Designing and Querying a Compact Redundancy Free XML Storage. J. The Open Information System Journal 3, 98–107 (2009)

    Article  Google Scholar 

  15. Wong, R., Lam, F., Shui, W.: Querying and maintaining a compact XML storage. In: 16th International Conference on World Wide Web, Banff, Alberta, Canada (2007)

    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

Atique, M., Raut, A.D. (2012). A Non Redundant Compact XML Storage for Efficient Indexing and Querying of XML Documents. In: Krishna, P.V., Babu, M.R., Ariwa, E. (eds) Global Trends in Computing and Communication Systems. ObCom 2011. Communications in Computer and Information Science, vol 269. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29219-4_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29219-4_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29218-7

  • Online ISBN: 978-3-642-29219-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics