Imagen de Portada

CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Zhang, Ziyu, Wei, Yuanhao, Engels, Joshua, Shun, Julian
Formato:	Preprint
Publicado:	2025
Materias:	Databases Distributed, Parallel, and Cluster Computing Data Structures and Algorithms Information Retrieval
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

PECANN: Parallel Efficient Clustering with Graph-Based Approximate Nearest Neighbor Search
por: Yu, Shangdi, et al.
Publicado: (2023)

On the Effectiveness of Graph Reordering for Accelerating Approximate Nearest Neighbor Search on GPU
por: Oguri, Yutaro, et al.
Publicado: (2025)

CAGRA: Highly Parallel Graph Construction and Approximate Nearest Neighbor Search for GPUs
por: Ootomo, Hiroyuki, et al.
Publicado: (2023)

TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge Graphs
por: Dhulipala, Laxman, et al.
Publicado: (2023)

Towards Scalable and Practical Batch-Dynamic Connectivity
por: De Man, Quinten, et al.
Publicado: (2024)

Access Control for Information-Theoretically Secure Key-Document Stores
por: Li, Yin, et al.
Publicado: (2025)

Harmonic Decomposition in Data Sketches
por: Wang, Dingyu
Publicado: (2024)

JumpBackHash: Say Goodbye to the Modulo Operation to Distribute Keys Uniformly to Buckets
por: Ertl, Otmar
Publicado: (2024)

Auditable Shared Objects: From Registers to Synchronization Primitives
por: Attiya, Hagit, et al.
Publicado: (2025)

GPU-RMQ: Accelerating Range Minimum Queries on Modern GPUs
por: Kreis, Lara, et al.
Publicado: (2026)

Approximate Nearest Neighbor Search with Window Filters
por: Engels, Joshua, et al.
Publicado: (2024)

Parallel Two-Stage Approach for Joint Symbolic Approximation of Time Series
por: Chen, Xinye
Publicado: (2023)

Parallel Algorithms for Hierarchical Nucleus Decomposition
por: Shi, Jessica, et al.
Publicado: (2023)

PiPNN: Ultra-Scalable Graph-Based Nearest Neighbor Indexing
por: Rubel, Tobias, et al.
Publicado: (2026)

Parallel $k$-Core Decomposition with Batched Updates and Asynchronous Reads
por: Liu, Quanquan C., et al.
Publicado: (2024)

Setchain Algorithms for Blockchain Scalability
por: Karmegam, Arivarasan, et al.
Publicado: (2025)

Parallel $k$d-tree with Batch Updates
por: Men, Ziyang, et al.
Publicado: (2024)

Distributed Approximation Algorithms for Minimum Dominating Set in Locally Nice Graphs
por: Bonamy, Marthe, et al.
Publicado: (2025)

Improved Deterministic Distributed Maximum Weight Independent Set Approximation in Sparse Graphs
por: Gil, Yuval
Publicado: (2024)

Õptimal Fault-Tolerant Labeling for Reachability and Approximate Distances in Directed Planar Graphs
por: Boneh, Itai, et al.
Publicado: (2025)

On the Randomized Locality of Matching Problems in Regular Graphs
por: Khoury, Seri, et al.
Publicado: (2025)

A $(3+\varepsilon)$-Approximate Correlation Clustering Algorithm in Dynamic Streams
por: Cambus, Mélanie, et al.
Publicado: (2022)

Brief Announcement: Distributed Unconstrained Local Search for Multilevel Graph Partitioning
por: Sanders, Peter, et al.
Publicado: (2024)

Round and Communication Efficient Graph Coloring
por: Chang, Yi-Jun, et al.
Publicado: (2024)

Scalable Graph Indexing using GPUs for Approximate Nearest Neighbor Search
por: Li, Zhonggen, et al.
Publicado: (2025)

DGAP: Efficient Dynamic Graph Analysis on Persistent Memory
por: Islam, Abdullah Al Raqibul, et al.
Publicado: (2024)

Efficient Dynamic MaxFlow Computation on GPUs
por: Kannappan, Shruthi, et al.
Publicado: (2025)

Parallel and (Nearly) Work-Efficient Dynamic Programming
por: Ding, Xiangyun, et al.
Publicado: (2024)

To Store or Not to Store: a graph theoretical approach for Dataset Versioning
por: Guo, Anxin, et al.
Publicado: (2024)

FliX: Flipped-Indexing for Scalable GPU Queries and Updates
por: Kharal, Rosina, et al.
Publicado: (2026)

On Efficient Approximate Aggregate Nearest Neighbor Queries over Learned Representations
por: Wang, Carrie, et al.
Publicado: (2025)

Local Density and its Distributed Approximation
por: Christiansen, Aleksander Bjørn, et al.
Publicado: (2024)

Massively Parallel Algorithms for Approximate Shortest Paths
por: Dory, Michal, et al.
Publicado: (2024)

Congested Clique Counting for Local Gibbs Distributions
por: Sobel, Joshua Z.
Publicado: (2025)

Benchmarking Filtered Approximate Nearest Neighbor Search Algorithms on Transformer-based Embedding Vectors
por: Iff, Patrick, et al.
Publicado: (2025)

Informative Trains: A Memory-Efficient Journey to a Self-Stabilizing Leader Election Algorithm in Anonymous Graphs
por: Blin, Lelia, et al.
Publicado: (2026)

Improved All-Pairs Approximate Shortest Paths in Congested Clique
por: Bui, Hong Duc, et al.
Publicado: (2024)

Improved Approximation Bounds for Minimum Weight Cycle in the CONGEST Model
por: Manoharan, Vignesh, et al.
Publicado: (2023)

Distributed-Memory Parallel Algorithms for Fixed-Radius Near Neighbor Graph Construction
por: Raulet, Gabriel, et al.
Publicado: (2025)

Multi-Agent Online Graph Exploration on Cycles and Tadpole Graphs
por: Akker, Erik van den, et al.
Publicado: (2024)