Skip to main content
SpringerLink
Log in

An Efficient Indexing and Compressing Scheme for XML Query Processing

  • Conference paper
Networked Digital Technologies (NDT 2010)

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

Included in the following conference series:

Abstract

Due to the wide-spread deployment of business-to-business (B2B) E-commerce, XML has become the standard format for data exchange over the Internet. How to process XML queries efficiently is an important research issue. Various indexing techniques have been proposed in the literature. However, they suffer from some of the following problems in various degrees. First, some indexing methods require huge size for index structures, which could be bigger than the original XML document in some cases. Second, some of them require long index construction time to minimize the size of index structures. Third, some of them can’t support complex queries efficiently. To overcome the aforementioned problems, we propose an indexing method called NCIM (Node Clustering Indexing Method). The experimental results show that NCIM can compress XML documents with high compression rate and low index construction time. It also supports complex queries efficiently.

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

Access this chapter

Log in via an institution
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. Clark, J., DeRose, S.: XML path language (XPath) version 1.0. W3C Recommendation (1999), http://www.w3.org/TR/xpath

  2. Boag, S., Chamberlin, D., Fernandez, M., Florescu, D., Robie, J., Simeon, J., Stefanescu, M.: XQuery 1.0: An XML query language. Working Draft (2001), http://www.w3.org/TR/2001/WD-xquery-20011220

  3. Catania, B., Maddalena, A., Vakali, A.: XML document indexes: A classification. IEEE Internet Computing 9(5), 64–71 (2005)

    Article  Google Scholar 

  4. Chung, C., Min, J., Shim, K.: APEX: an adaptive path index for XML data. In: 2002 ACM SIGMOD International Conference on Management of Data (SIGMOD ’02), pp. 121–132. ACM Press, New York (2002)

    Chapter  Google Scholar 

  5. Cooper, B., Sample, N., Franklin, M.J., Hjaltason, G.R., Shadmon, M.: A fast index for semistructured data. In: 27th International Conference on Very Large Data Bases, pp. 341–350 (2001)

    Google Scholar 

  6. Goldman, R., Widom, J.: DataGuides: enabling query formulation and optimization in semistructured databases. In: 23rd International Conference on Very Large Data Bases, pp. 436–445 (1997)

    Google Scholar 

  7. Zhang, B., Geng, Z., Zhou, A.: SIMP: efficient XML structural index for multiple query processing. In: 9th International Conference on Web-Age information Management (WAIM), pp. 113–118. IEEE Computer Society, Washington (2008)

    Chapter  Google Scholar 

  8. Chen, Q., Lim, A., Ong, K.W.: D(k)-index: an adaptive structural summary for graph-structured data. In: 2003 ACM SIGMOD international Conference on Management of Data (SIGMOD ’03), pp. 134–144. ACM Press, New York (2003)

    Chapter  Google Scholar 

  9. Chen, Q., Lim, A., Ong, K.W.: Enabling structural summaries for efficient update and workload adaptation. Data Knowl. Eng. 64(3), 558–579 (2008)

    Article  Google Scholar 

  10. Kaushik, R., Shenoy, D., Bohannon, P., Gudes, E.: Exploiting local similarity for indexing paths in graph-structured data. In: 18th International Conference on Data Engineering (ICDE), pp. 129–140. IEEE Computer Society, Washington (2002)

    Chapter  Google Scholar 

  11. Milo, T., Suciu, D.: Index structures for path expressions. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 277–295. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  12. Haw, S., Lee, C.: Evolution of structural path indexing techniques in XML databases: A survey and open discussion. Advanced Communication Technology 3, 2054–2059 (2008)

    Google Scholar 

  13. Hsu, W.-C., Liao, I.-E., Wu, S.-Y., Kao, K.-F.: An efficient XML indexing method based on path clustering. In: 20th IASTED International Conference on Modelling and Simulation (MS ’09), pp. 339–344 (2009)

    Google Scholar 

  14. Chien, S., Vagena, Z., Zhang, D., Tsotras, V.J., Zaniolo, C.: Efficient structural joins on indexed XML documents. In: 28th International Conference on Very Large Data Bases. VLDB Endowment, pp. 263–274 (2002)

    Google Scholar 

  15. Jiang, H., Lu, H., Wang, W., Ooi, B.C.: XR-Tree: indexing XML data for efficient structural joins. In: 19th International Conference on Data Engineering (ICDE), pp. 253–264. IEEE Computer Society, Washington (2003)

    Google Scholar 

  16. Moro, M.M., Vagena, Z., Tsotras, V.J.: Tree-pattern queries on a lightweight XML processor. In: 31st International Conference on Very Large Data Bases. VLDB Endowment, pp. 205–216 (2005)

    Google Scholar 

  17. Catania, B., Ooi, B.C., Wang, W., Wang, X.: Lazy XML updates: laziness as a virtue, of update and structural join efficiency. In: 2005 ACM SIGMOD international Conference on Management of Data (SIGMOD ’05), pp. 515–526. ACM Press, New York (2005)

    Chapter  Google Scholar 

  18. Sheu, S., Wu, N.: XCut: Indexing XML data for efficient twig evaluation. In: 22nd International Conference on Data Engineering (ICDE), p. 127. IEEE Computer Society, Washington (2006)

    Chapter  Google Scholar 

  19. Bruno, N., Koudas, N., Srivastava, D.: Holistic twig joins: optimal XML pattern matching. In: 2002 ACM SIGMOD international Conference on Management of Data (SIGMOD ’02), pp. 310–321. ACM Press, New York (2002)

    Chapter  Google Scholar 

  20. Li, D., Li, C.: Track: a novel XML join algorithm for efficient processing twig queries. In: 19th Conference on Australasian Database, pp. 137–143 (2007)

    Google Scholar 

  21. Wang, H., Meng, X.: On the Sequencing of Tree Structures for XML Indexing. In: 21st International Conference on Data Engineering (ICDE), pp. 372–383. IEEE Computer Society, Washington (2005)

    Chapter  Google Scholar 

  22. Wang, H., Park, S., Fan, W., Yu, P.S.: ViST: a dynamic index method for querying XML data by tree structures. In: 2003 ACM SIGMOD International Conference on Management of Data (SIGMOD ’03), pp. 110–121. ACM Press, New York (2003)

    Chapter  Google Scholar 

  23. Rao, P., Moon, B.: PRIX: Indexing and querying XML using Prufer sequences. In: 20th International Conference on Data Engineering (ICDE), p. 288. IEEE Computer Society, Washington (2004)

    Google Scholar 

  24. Grimsmo, N.: Faster path indexes for search in XML data. In: 19th Conference on Australasian Database, pp. 127–135 (2007)

    Google Scholar 

  25. Katz, H.: XQEngine: XML query engine (2005), http://xqengine.sourceforge.net/

  26. Ley, M.: DBLP database web site (2008), http://www.informatik.uni-trier.de/~ley/db/

  27. XMARK, An XML benchmark project (2003), http://monetdb.cwi.nl/xml/

  28. UniProt Consortium, UniProtKB/Swiss-Prot, http://www.expasy.ch/sprot/sprot_details.html

  29. Chen, Z., Gehrke, J., Korn, F., Koudas, N., Shanmugasundaram, J., Srivastava, D.: Index structures for matching XML twigs using relational query processors. Data Knowl. Eng. 60(2), 283–302 (2007)

    Article  Google Scholar 

  30. Wu, X., Liu, G.: XML twig pattern matching using version tree. Data Knowl. Eng. 64(3), 580–599 (2008)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science and Engineering, National Chung Hsing University, 250 Kuo Kuang Road, Taichung, 402, Taiwan

    I-En Liao, Wen-Chiao Hsu & Yu-Lin Chen

Authors
  1. I-En Liao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wen-Chiao Hsu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yu-Lin Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Software Engineering, Charles University in Prague, Malostranske namesti 25, 118 00, Prague, Czech Republic

    Filip Zavoral

  2. Charles University, Prague, Czech Republic

    Jakub Yaghob

  3. Al Imam University, Riyadh, Saudi Arabia

    Pit Pichappan

  4. Jordan University of Science and Technology, Irbid, Jordan

    Eyas El-Qawasmeh

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liao, IE., Hsu, WC., Chen, YL. (2010). An Efficient Indexing and Compressing Scheme for XML Query Processing. In: Zavoral, F., Yaghob, J., Pichappan, P., El-Qawasmeh, E. (eds) Networked Digital Technologies. NDT 2010. Communications in Computer and Information Science, vol 87. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14292-5_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14292-5_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14291-8

  • Online ISBN: 978-3-642-14292-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation