2011
DOI: 10.1007/s10619-011-7085-8
|View full text |Cite
|
Sign up to set email alerts
|

Scaling XML query processing: distribution, localization and pruning

Abstract: 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 … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
30
0

Year Published

2012
2012
2022
2022

Publication Types

Select...
3
2
1

Relationship

1
5

Authors

Journals

citations
Cited by 7 publications
(30 citation statements)
references
References 27 publications
0
30
0
Order By: Relevance
“…The construction of such execution plans is the main contribution of this paper and will be described in Section 3. For completeness, we briefly summarize the other steps in Appendix B; they are discussed in more detail elsewhere [15].…”
Section: Distributed Query Evaluationmentioning
confidence: 99%
See 4 more Smart Citations
“…The construction of such execution plans is the main contribution of this paper and will be described in Section 3. For completeness, we briefly summarize the other steps in Appendix B; they are discussed in more detail elsewhere [15].…”
Section: Distributed Query Evaluationmentioning
confidence: 99%
“…Label paths are useful not only for optimizing distributed plans but also for certain optimizations during query localization [15].…”
Section: →4 18mentioning
confidence: 99%
See 3 more Smart Citations