activity
20162026
most citedSeries2Graph: Graph-based Subsequence Anomaly Detection for Time Series

99 citations · 441 across the 67 of their papers we have counts for

collaborators
Showing 2024 · cs.DBShow all

7 papers · 2 filters

cs.DB2024★ 5 cited

DumpyOS: A Data-Adaptive Multi-ary Index for Scalable Data Series Similarity Search

Zeyu Wang, Qitong Wang, Peng Wang +2

Data series indexes are necessary for managing and analyzing the increasing amounts of data series collections that are nowadays available. These indexes support both exact and app…

cs.DB2024

Fast and Exact Similarity Search in less than a Blink of an Eye

Patrick Schäfer, Jakob Brand, Ulf Leser +2

Similarity search is a fundamental operation for analyzing data series (DS), which are ordered sequences of real values. To enhance efficiency, summarization techniques are employe…

cs.DB2024

Data Quality Awareness: A Journey from Traditional Data Management to Data Science Systems

Sijie Dong, Soror Sahri, Themis Palpanas

Artificial intelligence (AI) has transformed various fields, significantly impacting our daily lives. A major factor in AI success is high-quality data. In this paper, we present a…

cs.DB2024

Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search

Jiuqi Wei, Xiaodong Lee, Zhenyu Liao +2

Approximate Nearest Neighbor (ANN) search in high-dimensional Euclidean spaces is a fundamental problem with a wide range of applications. However, there is currently no ANN method…

cs.DB2024

-Hardness: A Query Hardness Measure for Graph-Based ANN Indexes

Zeyu Wang, Qitong Wang, Xiaoxing Cheng +3

Graph-based indexes have been widely employed to accelerate approximate similarity search of high-dimensional vectors. However, the performance of graph indexes to answer different…

cs.DB2024★ 24 cited

DET-LSH: A Locality-Sensitive Hashing Scheme with Dynamic Encoding Tree for Approximate Nearest Neighbor Search

Jiuqi Wei, Botao Peng, Xiaodong Lee +1

Locality-sensitive hashing (LSH) is a well-known solution for approximate nearest neighbor (ANN) search in high-dimensional spaces due to its robust theoretical guarantee on query…