Scaling XML query processing: distribution, localization and pruning


DOI: 10.1007/s10619-011-7085-8

Cite this article as:
Kling, P., Özsu, M.T. & Daudjee, K. Distrib Parallel Databases (2011) 29: 445. doi:10.1007/s10619-011-7085-8


Distributing data collections by fragmenting them is an effective way of improving the scalability of a database system. While the distribution of relational data is well understood, the unique characteristics of the XML data and query model present challenges that require different distribution techniques. In this paper, we show how XML data can be fragmented horizontally and vertically. Based on this, we propose solutions to two of the problems encountered in distributed query processing and optimization on XML data, namely localization and pruning. Localization takes a fragmentation-unaware query plan and converts it to a distributed query plan that can be executed at the sites that hold XML data fragments in a distributed system. We then show how the resulting distributed query plan can be pruned so that only those sites are accessed that can contribute to the query result. We demonstrate that our techniques can be integrated into a real-life XML database system and that they significantly improve the performance of distributed query execution.


Distributed XML Localization Pruning 

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  • Patrick Kling
    • 1
  • M. Tamer Özsu
    • 1
  • Khuzaima Daudjee
    • 1
  1. 1.Cheriton School of Computer ScienceUniversity of WaterlooWaterlooCanada

Personalised recommendations