Hao, W., Matsuzaki, K.: A partial-tree-based approach for XPath query on large XML trees. In: Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data (SIGMOD 2002), pp. Grust, T.: Accelerating XPath location steps. 69–77 (2013)ĭean, J., Ghemawat, S.: MapReduce: simplified data processing on large clusters. In: Proceedings of the 17th East European Conference on Advances in Databases and Information Systems (ADBIS 2013), Part II, pp. 37(4), 32:1–32:43 (2012)ĭamigos, M., Gergatsoulis, M., Plitsos, S.: Distributed processing of XPath queries using MapReduce. Ĭong, G., Fan, W., Kementsietsidis, A., Li, J., Liu, X.: Partial evaluation for distributed XPath query processing and beyond.
2737–2739 (2012)Ĭhoi, H., Lee, K.-H., Lee, Y.-J.: Parallel labeling of massive XML data with MapReduce. In: Proceedings of the 21st ACM International Conference on Information and Knowledge Management (CIKM 2012), pp. 164–173 (2015)Ĭhoi, H., Lee, K.H., Kim, S.H., Lee, Y.J., Moon, B.: HadoopXML: a suite for parallel processing of massive XML data with multiple twig pattern queries. In: Proceedings of 2015 IEEE International Conference on Big Data, pp. 705–716 (2005)Ĭarman, E.P., Westmann, T., Borkar, V.R., Carey, M.J., Tsotras, V.J.: A scalable parallel XQuery processor.
In: Proceedings of the 21st International Conference on Data Engineering (ICDE 2005), pp. 45(3), 399–434 (2015)īrantner, M., Helmer, S., Kanne, C.C., Moerkotte, G.: Full-fledged algebraic XPath processing in Natix. 141–152 (2002)Īrroyuelo, D., et al.: Fast in-memory XPath search using compressed indexes. In: Proceedings of the 12th International Conference on Data Engineering, pp. KeywordsĪl-Khalifa, S., Jagadish, H., Koudas, N., Patel, J.M., Srivastava, D., Wu, Y.: Structural joins: a primitive for efficient XML query pattern matching. The absolute execution time over 358 GB of XML data averagely is only seconds by using 32 EC2 instances. Experiment results show that our implementation outperforms a start-of-the-art XML database BaseX in both absolute loading time and execution time for the target queries. Our implementation uses two index sets to accelerate the evaluation of structural relationships among nodes, making it highly efficient for processing very large XML documents regarding three important classes of XPath queries: backward, order-aware and predicate-containing queries. In this study, we implemented a tree-shaped data structure called partial tree that is intrinsically suitable for large XML document processing with multiple computers.
Although XML processing has been intensively studied in recent years, designing efficient implementations for evaluating XPath queries on XML documents remains a challenge in case XML documents are very large.
0 kommentar(er)
