Efficient processing of subsequence matching with the Euclidean metric in time-series databases

DOI10.1016/J.IPL.2004.02.014zbMATH Open1178.68197OpenAlexW2033820702MaRDI QIDQ2390262FDOQ2390262

Authors: Sang Wook Kim, Dae-Hyun Park, Heon-Gil Lee 

Publication date: 21 July 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2004.02.014

zbMATH Keywords

data miningdatabasessubsequence matchingtime-series databases

Mathematics Subject Classification ID

Database theory (68P15)

Cited In (1)

• Using multiple indexes for efficient subsequence matching in time-series databases

This page was built for publication: Efficient processing of subsequence matching with the Euclidean metric in time-series databases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2390262)