Data Series Indexing Gone Parallel

Data series similarity search is an important operation and at the core of several analysis tasks and applications related to data series collections. Despite the fact that data series indexes enable fast similarity search, all existing indexes can only answer queries of a single length (fixed at index construction time), which is a severe limitation. In this work, we propose ULISSE, the first data series index structure designed for answering similarity search queries of variable length (within some range). Our contribution is twofold. First, we introduce a novel representation technique, which effectively and succinctly summarizes multiple sequences of different length. Based on the proposed index, we describe efficient algorithms for approximate and exact similarity search, combining disk based index visits and in-memory sequential scans. Our approach supports non Z-normalized and Z-normalized sequences, and can be used with no changes with both Euclidean Distance and Dynamic Time Warping, for answering both k-NN andrange queries. We experimentally evaluate our approach using several synthetic and real datasets. The results show that ULISSE is several times, and up to orders of magnitude more efficient in terms of both space and time cost, when compared to competing approaches. (Paper published in VLDBJ 2020) 1 Introduction Motivation. Data sequences are one of the most common data types, and they are present in almost every scientific and

show abstract

ParIS+: Data Series Indexing on Multi-core Architectures

Peng

Fatourou

Palpanas

2020

IEEE Trans. Knowl. Data Eng.

Self Cite

View full text Add to dashboard Cite

Data series similarity search is a core operation for several data series analysis applications across many different domains. Nevertheless, even state-of-the-art techniques cannot provide the time performance required for large data series collections. We propose ParIS and ParIS+, the first disk-based data series indices carefully designed to inherently take advantage of multi-core architectures, in order to accelerate similarity search processing times. Our experiments demonstrate that ParIS+ completely removes the CPU latency during index construction for disk-resident data, and for exact query answering is up to 1 order of magnitude faster than the current state of the art index scan method, and up to 3 orders of magnitude faster than the optimized serial scan method. ParIS+ (which is an evolution of the ADS+ index) owes its efficiency to the effective use of multi-core and multi-socket architectures, in order to distribute and execute in parallel both index construction and query answering, and to the exploitation of the Single Instruction Multiple Data (SIMD) capabilities of modern CPUs, in order to further parallelize the execution of instructions inside each core. 1 introduction [Motivation] An increasing number of applications across many diverse domains continuously produce very large amounts

show abstract

Data Series Indexing Gone Parallel

Cited by 3 publications

References 29 publications

Design and Implementation of Key-Value Database for Ship Virtual Test Platform Based on Distributed System

Design and Implementation of Key-Value Database for Ship Virtual Test Platform Based on Distributed System

Scalable data series subsequence matching with ULISSE

ParIS+: Data Series Indexing on Multi-core Architectures

Contact Info

Product

Resources

About