- 期刊
Analysis of Parallel Query Processing Algorithms for Semi-structured Data
若您是本文的作者，可授權文章由華藝線上圖書館中協助推廣。
並列摘要
Semi-structured data can be described by a labelled directed graph. Query costs on semi-structured data could be very high due to the sequential processing of path matching in a graph shape data structure. In this paper two types of parallel path-based query processing methods are introduced for improving the system performance. The first type includes three parallel version of pointer chasing methods based on the principle of message-driven computation. In the second type of method, the pre-fetch technique is used to achieve a low communication cost and a high degree of parallelisation.
延伸閱讀
- Zhang, Y. (2010). Evaluating continuous probabilistic queries over constantly-evolving data [master's thesis, The University of Hong Kong]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0029-1812201200018569
- Zhen, C., & Zhang, Y. (2019). A Survey of Data Preprocessing in Data Mining. International Core Journal of Engineering, 5(9), 133-137. https://doi.org/10.6919/ICJE.201908_5(9).0020
- Hsu, P. Y., Wang, J. L., & Chen, Y. L. (1997). A Structural Approach to Specify Data Transformations in Data Warehouses. 資訊管理研究, 1(2), 83-102. https://doi.org/10.6188/JEB.1997.1(2).05
- Te, C. H. (2015). In-memory query system for scientific datasets [master's thesis, National Tsing Hua University]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0016-0312201510301622
- Jia, Y. B., Fan, H. D., Zhang, Q., Li, X., & Xia, G. H. (2012). An Improved Classification Algorithm for Structured Data Based on Secondary Data Processing. Research Journal of Applied Sciences, Engineering and Technology, 4(11), 1500-1503. https://www.airitilibrary.com/Article/Detail?DocID=20407467-201206-201510230012-201510230012-1500-1503