Abstract
We present DHDSearch, a framework for distributed batch time series searching on MapReduce. DHDSearch is based on a two-layer DHDTree. The upper DHDTree serves as a route tree to distribute the time series. While the lower DHDTrees serve the batch searching in parallel. Compared with traditional time series searching methods, DHDSearch has better scalability and efficiency.
The work is supported by National Natural Science Foundation of China (U1509213), Shanghai Software and Integrated Circuit Industry Development Project (170512), National Key Research and Development Program (Grant Nos. 2016YFE0100300, 2016YFB1000700).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Camerra, A., Palpanas, T., Shieh, J., Keogh, E.J.: isax 2.0: Indexing and mining one billion time series. In: ICDM, pp. 58–67 (2010)
Li, Q., et al.: Clustering time series utilizing a dimension hierarchical decomposition approach. In: Candan, S., Chen, L., Pedersen, T.B., Chang, L., Hua, W. (eds.) DASFAA 2017. LNCS, vol. 10177, pp. 247–261. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-55753-3_16
Wang, Y., Wang, P., Pei, J., Wang, W., Huang, S.: A data-adaptive and dynamic segmentation index for whole matching on time series. PVLDB 6(10), 793–804 (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Li, Z., Li, Q., Wang, W., Wang, Y., Liu, Y. (2019). DHDSearch: A Framework for Batch Time Series Searching on MapReduce. In: Li, G., Yang, J., Gama, J., Natwichai, J., Tong, Y. (eds) Database Systems for Advanced Applications. DASFAA 2019. Lecture Notes in Computer Science(), vol 11448. Springer, Cham. https://doi.org/10.1007/978-3-030-18590-9_88
Download citation
DOI: https://doi.org/10.1007/978-3-030-18590-9_88
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-18589-3
Online ISBN: 978-3-030-18590-9
eBook Packages: Computer ScienceComputer Science (R0)