activity
20182026
most citedSchema-agnostic Progressive Entity Resolution (extended version)

64 citations · 248 across the 56 of their papers we have counts for

collaborators
Showing cs.DBShow all

33 papers · 1 filter

cs.DB2026

Time-Decayed Vector Search in the Rhythm of TANGO: Jointly Modeling Semantic Similarity and Temporal Freshness

Jiuqi Wei, Qiyao Luo, Quanqing Xu +2

Vector search typically measures relevance through semantic similarity under a fixed scoring function. However, in a growing range of applications, relevance may evolve over time,…

cs.DB2026

AgenticER: the next frontier in Entity Resolution

George Papadakis, Panos Korovesis, Manolis Koubarakis +1

Entity Resolution (ER) is a fundamental problem in data management, playing a critical role in tasks like data cleaning and knowledge graph construction. The existing ER approaches…

cs.DB20262 cited

Evaluating and Generating Query Workloads for High Dimensional Vector Similarity Search

Matteo Ceccarello, Alexandra Levchenko, Ioana Ileana +1

Similarity search lies at the heart of many modern applications, ranging from databases to deep learning to data series analysis. As such, a vast effort has been invested in develo…

cs.DB202613 cited

SEAnet: A Deep Learning Architecture for Data Series Similarity Search

Qitong Wang, Themis Palpanas

A key operation for massive data series collection analysis is similarity search. According to recent studies, SAX-based indexes offer state-of-the-art performance for similarity s…

cs.DB2026

PDET-LSH: Scalable In-Memory Indexing for High-Dimensional Approximate Nearest Neighbor Search with Quality Guarantees

Jiuqi Wei, Xiaodong Lee, Botao Peng +3

Locality-sensitive hashing (LSH) is a well-known solution for approximate nearest neighbor (ANN) search with theoretical guarantees. Traditional LSH-based methods mainly focus on i…

cs.DB2026

TaCo: Data-adaptive and Query-aware Subspace Collision for High-dimensional Approximate Nearest Neighbor Search

Jiuqi Wei, Zhenyu Liao, Ruoyu Han +3

Approximate Nearest Neighbor Search (ANNS) in high-dimensional Euclidean spaces is a fundamental problem with broad applications. Subspace Collision is a newly proposed ANNS framew…