Skip to main content

Multidimensional Implementation of Stream ADT

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

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

Included in the following conference series:

  • 902 Accesses

Abstract

Holistic approaches are considered as the most robust solution for processing of twig pattern queries requiring no complicated query optimization. Holistic approaches use an abstract data type called a stream which is an ordered set of XML nodes with the same schema node. A straightforward implementation of a stream is a paged array. In this article, we introduce a multidimensional implementation of the stream for path labeling schemes. We also show that this implementation can be extended in such a way that it supports fast searching of nodes with a content. Although many multidimensional data structures have been introduced in recent years, we show that it is necessary to combine two variants of the R-tree (Ordered R-tree and Signature R-tree) for an efficient implementation the stream ADT.

Work is partially supported by Grants of GACR No. GAP202/10/0573 and GA201/09/0990.

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 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.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., Jagadish, H.V., Koudas, N.: Structural Joins: A Primitive for Efficient XML Query Pattern Matching. In: Proceedings of the 18th International Conference on Data Engineering, ICDE 2002 (2002)

    Google Scholar 

  2. Bauer, M.G., Ramsak, F., Bayer, R.: Multidimensional mapping and indexing of xml. In: BTW. LNI, vol. 26, pp. 305–323. GI (2003)

    Google Scholar 

  3. Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The R*-tree: An Efficient and Robust Access Method for Points and Rectangles. In: Proceedings of the 9th ACM International Conference on Management of Data (SIGMOD 1990) (1990)

    Google Scholar 

  4. Bruno, N., Srivastava, D., Koudas, N.: Holistic Twig Joins: Optimal XML Pattern Matching. In: Proceedings of SIGMOD 2002, pp. 310–321. ACM (2002)

    Google Scholar 

  5. Chen, S., Li, H.-G., Tatemura, J., Hsiung, W.-P., Agrawal, D., Candan, K.S.: Twig2stack: bottom-up processing of generalized-tree-pattern queries over xml documents. In: Proceedings of VLDB 2006, pp. 283–294. VLDB Endowment (2006)

    Google Scholar 

  6. Chen, T., Lu, J., Ling, T.W.: On Boosting Holism in XML Twig Pattern Matching Using Structural Indexing Techniques. In: Proceedings of SIGMOD 2005, pp. 455–466. ACM Press (2005)

    Google Scholar 

  7. Chovanec, P., Krátký, M., Bača, R.: Optimization of Disk Accesses for Multidimensional Range Queries. In: Bringas, P.G., Hameurlain, A., Quirchmayr, G. (eds.) DEXA 2010. LNCS, vol. 6261, pp. 358–367. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  8. Dietz, P.F.: Maintaining Order in a Linked List. In: Proceedings of 14th Annual ACM Symposium on Theory of Computing (STOC 1982), pp. 122–127 (1982)

    Google Scholar 

  9. Grimsmo, N., Bjorklund, T.A., Hetland, M.L.: Fast Optimal Twig Joins. In: Proceedings of VLDB 2010. VLDB Endowment (2010)

    Google Scholar 

  10. Grüst, T.: Accelerating XPath Location Steps. In: Proceedings of SIGMOD 2002, pp. 109–120. ACM Press (2002)

    Google Scholar 

  11. Guttman, A.: R-Trees: A Dynamic Index Structure for Spatial Searching. In: Proceedings SIGMOD 1984, pp. 47–57. ACM Press (1984)

    Google Scholar 

  12. Jiang, H., Lu, H., Wang, W., Ooi, B.: XR-Tree: Indexing XML Data for Efficient Structural Join. In: Proceedings of ICDE 2003. IEEE, India (2003)

    Google Scholar 

  13. Kamel, I., Faloutsos, C.: On packing R-trees. In: Proceedings of the Second International Conference on Information and Knowledge Management (CIKM 1993), pp. 490–499. ACM Press (1993)

    Google Scholar 

  14. Krátký, M., Bača, R., Snášel, V.: On the Efficient Processing Regular Path Expressions of an Enormous Volume of XML Data. In: Wagner, R., Revell, N., Pernul, G. (eds.) DEXA 2007. LNCS, vol. 4653, pp. 1–12. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  15. Krátký, M., Pokorný, J., Snášel, V.: Implementation of XPath Axes in the Multi-dimensional Approach to Indexing XML Data. In: Lindner, W., Fischer, F., Türker, C., Tzitzikas, Y., Vakali, A.I. (eds.) EDBT 2004. LNCS, vol. 3268, pp. 219–229. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  16. Krátký, M., Skopal, T., Snášel, V.: Multidimensional Term Indexing for Efficient Processing of Complex Queries. Kybernetika Journal 40(3), 381–396 (2004)

    Google Scholar 

  17. Krátký, M., Snášel, V., Zezula, P., Pokorný, J.: Efficient Processing of Narrow Range Queries in the R-Tree. In: Proceedings of the 10th International Database Engineering and Applications Symposium (IDEAS 2006), pp. 69–79. IEEE (2006)

    Google Scholar 

  18. Křižka, F., Krátký, M.: On the Efficient Indexing of Ordered Multidimensional Tuples. In: 5th International Conference for Internet Technology and Secured Transactions (ICITST 2010). IEEE, London (2010)

    Google Scholar 

  19. Křižka, F., Krátký, M., Bača, R.: On Support of Ordering in Multidimensional Data Structures. In: Catania, B., Ivanović, M., Thalheim, B. (eds.) ADBIS 2010. LNCS, vol. 6295, pp. 575–578. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  20. Lightstone, S.S., Teorey, T.J., Nadeau, T.: Physical Database Design: the Database Professional’s Guide. Morgan Kaufmann (2007)

    Google Scholar 

  21. Lu, J., Ling, T.W., Chan, C.Y., Chen, T.: From Region Encoding to Extended Dewey: on Efficient Processing of XML Twig Pattern Matching. In: Proceedings of VLDB 2005, pp. 193–204 (2005)

    Google Scholar 

  22. Lu, J., Ling, T.W., Bao, Z., Wang, C.: Extended XML Tree Pattern Matching: Theories and Algorithms. IEEE Transactions on Knowledge and Data Engineering (TKDE) 23 (2011)

    Google Scholar 

  23. Moro, M.M., Vagena, Z., Tsotras, V.J.: Tree-pattern Queries on a Lightweight XML Processor. In: Proceedings of VLDB 2005, pp. 205–216 (2005)

    Google Scholar 

  24. O’Neil, P., O’Neil, E., Pal, S., Cseri, I., Schaller, G., Westbury, N.: ORDPATHs: Insert-friendly XML Node Labels. In: Proceedings of SIGMOD 2004 (2004)

    Google Scholar 

  25. Samet, H.: Foundations of Multidimensional and Metric Data Structures. Morgan Kaufmann (2006)

    Google Scholar 

  26. Tatarinov, I., et al.: Storing and Querying Ordered XML Using a Relational Database System. In: Proceedings of SIGMOD 2002, pp. 204–215. ACM Press, New York (2002)

    Chapter  Google Scholar 

  27. W3 Consortium. XQuery 1.0: An XML Query Language, W3C Working Draft (November 12, 2003), http://www.w3.org/TR/xquery/

  28. Zhang, C., Naughton, J., DeWitt, D., Luo, Q., Lohman, G.: On Supporting Containment Queries in Relational Database Management Systems. In: Proceedings of SIGMOD 2001, pp. 425–436. ACM Press, New York (2001)

    Chapter  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

Křižka, F., Krátký, M., Bača, R., Chovanec, P. (2012). Multidimensional Implementation of Stream ADT. In: Wang, L., Jiang, J., Lu, J., Hong, L., Liu, B. (eds) Web-Age Information Management. WAIM 2011. Lecture Notes in Computer Science, vol 7142. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28635-3_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-28635-3_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-28634-6

  • Online ISBN: 978-3-642-28635-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics