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

  • David Bednárek
Part of the Lecture Notes in Computer Science book series (LNCS, 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 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. 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)CrossRefGoogle Scholar
  4. 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)CrossRefGoogle Scholar
  5. 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. 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)CrossRefGoogle Scholar
  7. 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. 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)CrossRefGoogle Scholar
  9. 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)CrossRefGoogle Scholar
  10. 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)CrossRefGoogle Scholar
  11. 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)CrossRefGoogle Scholar
  12. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • David Bednárek
    • 1
  1. 1.Department of Software Engineering, Faculty of Mathematics and PhysicsCharles University in Prague 

Personalised recommendations