Affiliation:
1. Liaoning University, China
Abstract
In order to solve the problem of storage and query for massive XML data, a method of efficient storage and parallel query for a massive volume of XML data with Hadoop is proposed. This method can store massive XML data in Hadoop and the massive XML data is divided into many XML data blocks and loaded on HDFS. The parallel query method of massive XML data is proposed, which uses parallel XPath queries based on multiple predicate selection, and the results of parallel query can satisfy the requirement of query given by the user. In this chapter, the map logic algorithm and the reduce logic algorithm based on parallel XPath queries based using MapReduce programming model are proposed, and the parallel query processing of massive XML data is realized. In addition, the method of MapReduce query optimization based on multiple predicate selection is proposed to reduce the data transfer volume of the system and improve the performance of the system. Finally, the effectiveness of the proposed method is verified by experiment.
Reference34 articles.
1. Afrati, F. N., Damigos, M., & Gergatsoulis, M. (2015). Lower bounds on the communication of XPath queries in MapReduce. In Proceedings of the Workshops of the EDBT/ICDT Joint Conference (pp. 38-41). Brussels, Belgium: CEUR-WS.
2. Parallel Prime Number Labeling of Large XML Data Using MapReduce
3. A dynamic and parallel approach for repetitive prime labeling of XML with MapReduce
4. Distributed XML filtering using Hadoop framework.;P.Antonellis;Proceedings of the Algorithmic Aspects of Cloud Computing First International Workshop,2015
5. Bairoch, A., Apweiler, R., Wu, C. H., Barker, W. C., Boeckmann, B., Ferro, S., … Yeh, L. L. (2005). The universal protein resource (UniProt). Nucleic Acids Research, 33, 154-159.