Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

DHDSearch: A Framework for Batch Time Series Searching on MapReduce

  • Conference paper
  • First Online:
Database Systems for Advanced Applications (DASFAA 2019)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 11448))

Included in the following conference series:

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).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. 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)

    Google Scholar 

  2. 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

    Chapter  Google Scholar 

  3. 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)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Qiuhong Li .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

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)

Publish with us

Policies and ethics