Fast subsequence search on time series data

Yuhong Li, Bo Tang, Leong Hou U, Man Lung Yiu, Zhiguo Gong

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

4 Citations (Scopus)

Abstract

Many applications on time series data require solving the subsequence search problem, which has been extensively studied in the database and data mining communities. These applications are computation bound rather than disk I/O bound. In this work, we further propose effective and cheap lower-bounds to reduce the computation cost of the subsequence search problem. Experimental studies show that the proposed lower-bounds can boost the performance of the state-of-the-art solution by up to an order of magnitude.
Original languageEnglish
Title of host publicationAdvances in Database Technology - EDBT 2017
Subtitle of host publication20th International Conference on Extending Database Technology, Proceedings
PublisherOpenProceedings.org
Pages514-517
Number of pages4
Volume2017-March
ISBN (Electronic)9783893180738
DOIs
Publication statusPublished - 1 Jan 2017
Event20th International Conference on Extending Database Technology, EDBT 2017 - Venice, Italy
Duration: 21 Mar 201724 Mar 2017

Conference

Conference20th International Conference on Extending Database Technology, EDBT 2017
CountryItaly
CityVenice
Period21/03/1724/03/17

ASJC Scopus subject areas

  • Information Systems
  • Software
  • Computer Science Applications

Cite this