TSseek approximates time series as line segments and regex queries as bounding rectangles, then uses a distributed spatial index (TSseek-X) to support efficient exact whole-matching and subsequence-matching queries.
Data structures and algorithms for nearest neighbor search in general metric spaces,
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Large-scale HPC evaluation of Qdrant, Milvus, and Weaviate reveals that workload patterns limit scaling and extra cores can reduce throughput, exposing a cloud-to-HPC design mismatch.
citing papers explorer
-
TSseek: Regular Expression-Based Similarity Search for Distributed Time Series Datasets
TSseek approximates time series as line segments and regex queries as bounding rectangles, then uses a distributed spatial index (TSseek-X) to support efficient exact whole-matching and subsequence-matching queries.
-
When More Cores Hurts: The Vector Database Scaling Paradox in HPC
Large-scale HPC evaluation of Qdrant, Milvus, and Weaviate reveals that workload patterns limit scaling and extra cores can reduce throughput, exposing a cloud-to-HPC design mismatch.