论文信息 - Lower Bounds on the Communication of XPath Queries in MapReduce

Lower Bounds on the Communication of XPath Queries in MapReduce

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.

[1] Anand Rajaraman,et al. Mining of Massive Datasets , 2011 .

[2] Georg Gottlob,et al. The complexity of XPath query evaluation , 2003, PODS.

[3] Ioana Manolescu,et al. Web Data Management , 2011 .

[4] Jeffrey D. Ullman,et al. Upper and Lower Bounds on the Cost of a Map-Reduce Computation , 2012, Proc. VLDB Endow..

[5] Lukas Lewandowski,et al. Using Map and Reduce for Querying Distributed XML Data , 2012 .

[6] Mariano P. Consens,et al. Having a ChuQL at XML on the Cloud , 2011, AMW.

[7] Din J. Wasem,et al. Mining of Massive Datasets , 2014 .

[8] Sanjay Ghemawat,et al. MapReduce: Simplified Data Processing on Large Clusters , 2004, OSDI.

[9] Dario Colazzo,et al. Processing XML queries and updates on map/reduce clusters , 2013, EDBT '13.

[10] Manolis Gergatsoulis,et al. Distributed Processing of XPath Queries Using MapReduce , 2013, ADBIS.

[11] Jianzhong Li,et al. Partial Evaluation for Distributed XPath Query Processing and Beyond , 2012, TODS.