Showing cs.DBShow all
3 papers · 1 filter
cs.DB2025
SHINE: A Scalable HNSW Index in Disaggregated Memory
Manuel Widmoser, Daniel Kocher, Nikolaus Augsten
Approximate nearest neighbor (ANN) search is a fundamental problem in computer science for which in-memory graph-based methods, such as Hierarchical Navigable Small World (HNSW), p…
cs.DB2023
KOIOS: Top-k Semantic Overlap Set Search
Pranay Mundra, Jianhao Zhang, Fatemeh Nargesian +1
We study the top-k set similarity search problem using semantic overlap. While vanilla overlap requires exact matches between set elements, semantic overlap allows elements that ar…
cs.DB2023
FINEX: A Fast Index for Exact & Flexible Density-Based Clustering (Extended Version with Proofs)*
Konstantin Emil Thiel, Daniel Kocher, Nikolaus Augsten +3
Density-based clustering aims to find groups of similar objects (i.e., clusters) in a given dataset. Applications include, e.g., process mining and anomaly detection. It comes with…