Skip to main content

R-Programs: A Framework for Distributing XML Structural Joins across Function Calls

  • Conference paper
  • 874 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5901))

Abstract

Structural joins and, in particular, twig joins are essential operations in XML query processing. Algorithms presented so far treat a twig join as a single operator with multiple inputs. However, in XQuery and XSLT, a twig pattern may be scattered across several functions (templates); thus, function integration is required before the application of a twig join operator. This paper presents R-programs – a novel evaluation framework based on an expanding network of operators. In this environment, a function may repeatedly and bidirectionally interact with its caller; consequently, a structural join algorithm may be distributed across the boundary of a function. Given this ability, function integration is no longer required and twig join algorithms become applicable even in the presence of recursive functions.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Grust, T., Rittinger, J.: Jump through Hoops to Grok the Loops Pathfinder’s Purely Relational Account of XQuery-Style Iteration Semantics. In: Proceedings of the ACM SIGMOD/PODS 5th International Workshop on XQuery Implementation, Experience and Perspectives, XIME-P 2008 (2008)

    Google Scholar 

  2. Grust, T., Mayr, M., Rittinger, J.: XQuery Join Graph Isolation: Celebrating 30+ Years of XQuery Processing Technology. In: ICDE 2009, Proceedings of the 2009 IEEE International Conference on Data Engineering, Washington, DC, USA, pp. 1167–1170. IEEE Computer Society, Los Alamitos (2009)

    Google Scholar 

  3. Haw, S.C., Lee, C.S.: Extending Path Summary and Region Encoding for Efficient Structural Query Processing in Native XML Databases. Journal of Systems and Software 82(6), 1025–1035 (2009)

    Article  Google Scholar 

  4. Bruno, N., Koudas, N., Srivastava, D.: Holistic Twig Joins: Optimal XML Pattern Matching. In: SIGMOD 2002, Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data, pp. 310–321. ACM, New York (2002)

    Chapter  Google Scholar 

  5. Che, D.: Holistically Processing XML Twig Queries with AND, OR, and NOT Predicates. In: InfoScale 2007, Proceedings of the 2nd International Conference on Scalable Information Systems, ICST, Brussels, Belgium, pp. 1–4. ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering) (2007)

    Google Scholar 

  6. Fontoura, M., Josifovski, V., Shekita, E., Yang, B.: Optimizing Cursor Movement in Holistic Twig Joins. In: CIKM 2005, Proceedings of the 14th ACM International Conference on Information and Knowledge Management, pp. 784–791. ACM, New York (2005)

    Chapter  Google Scholar 

  7. Bednárek, D.: Bulk Evaluation of User-Defined Functions in XQuery. PhD Thesis, Department of Software Engineering, Charles University, Prague, the Czech Republic (2009)

    Google Scholar 

  8. Bednárek, D.: Reducing Temporary Trees in XQuery. In: Atzeni, P., Caplinskas, A., Jaakkola, H. (eds.) ADBIS 2008. LNCS, vol. 5207, pp. 30–45. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  9. Qin, L., Yu, J.X., Ding, B.: TwigList: Make Twig Pattern Matching Fast. In: Kotagiri, R., Radha Krishna, P., Mohania, M., Nantajeewarawat, E. (eds.) DASFAA 2007. LNCS, vol. 4443, pp. 850–862. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  10. Li, J., Wang, J.: TwigBuffer: Avoiding Useless Intermediate Solutions Completely in Twig Joins. In: Haritsa, J.R., Kotagiri, R., Pudi, V. (eds.) DASFAA 2008. LNCS, vol. 4947, pp. 554–561. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  11. Lu, J., Chen, T., Ling, T.W.: TJFast: Effective Processing of XML Twig Pattern Matching. In: Ellis, A., Hagino, T. (eds.) WWW (Special Interest Tracks and Posters), pp. 1118–1119. ACM, New York (2005)

    Chapter  Google Scholar 

  12. Bača, R., Krátký, M., Snášel, V.: On the Efficient Search of an XML Twig Query in Large DataGuide Trees. In: IDEAS 2008, Proceedings of the 2008 International Symposium on Database Engineering and Applications, pp. 149–158. ACM, New York (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bednárek, D. (2010). R-Programs: A Framework for Distributing XML Structural Joins across Function Calls. In: van Leeuwen, J., Muscholl, A., Peleg, D., Pokorný, J., Rumpe, B. (eds) SOFSEM 2010: Theory and Practice of Computer Science. SOFSEM 2010. Lecture Notes in Computer Science, vol 5901. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11266-9_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-11266-9_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-11265-2

  • Online ISBN: 978-3-642-11266-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics