Lower Bounds on the Communication of XPath Queries in MapReduce.
Foto Afrati, Matthew Damigos, Manolis Gergatsoulis · EDBT/ICDT Workshops · 2015
We present two algorithms, each depending on a different data fragmentation of the XML tree. They both compute XPath queries in MapReduce, by first computing subqueries and then combining their results. We compute the replication rate of each algorithm and show it is less than 2.