:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Song, Ziwen, Wang, Bin, Yang, Xiaochun, Zhang, Junhua
Format:	Preprint
Publié:	2026
Sujets:	Databases
Accès en ligne:	https://arxiv.org/abs/2605.05787
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

OrchANN: A Unified I/O Orchestration Framework for Skewed Out-of-Core Vector Search
par: Huan, Chengying, et autres
Publié: (2025)

Disk-Resident Graph ANN Search: An Experimental Evaluation
par: Chen, Xiaoyu, et autres
Publié: (2026)

TRIM: Accelerating High-Dimensional Vector Similarity Search with Enhanced Triangle-Inequality-Based Pruning
par: Song, Yitong, et autres
Publié: (2025)

Fiber-Navigable Search: A Geometric Approach to Filtered ANN
par: Dang, Thuong
Publié: (2026)

Exploring the Meaningfulness of Nearest Neighbor Search in High-Dimensional Space
par: Chen, Zhonghan, et autres
Publié: (2024)

RAIRS: Optimizing Redundant Assignment and List Layout for IVF-Based ANN Search
par: Yang, Zehai, et autres
Publié: (2026)

Low-Latency Sliding Window Connectivity
par: Zhang, Chao, et autres
Publié: (2024)

Coordination-Free Lane Partitioning for Convergent ANN Search
par: Kugblenu, Carl, et autres
Publié: (2025)

GeoLayer: Towards Low-Latency and Cost-Efficient Geo-Distributed Graph Stores with Layered Graph
par: Yao, Feng, et autres
Publié: (2025)

Milliscale: Fast Commit on Low-Latency Object Storage
par: Zhou, Jiatang, et autres
Publié: (2026)

PipeANN-Filter: An Efficient Filtered Vector Search System on SSD
par: Guo, Hao, et autres
Publié: (2026)

GateANN: I/O-Efficient Filtered Vector Search on SSDs
par: Lee, Nakyung, et autres
Publié: (2026)

Cost-Effective, Low Latency Vector Search with Azure Cosmos DB
par: Upreti, Nitish, et autres
Publié: (2025)

Heuristic Search Space Partitioning for Low-Latency Multi-Tenant Cloud Queries
par: Pathak, Prashant Kumar, et autres
Publié: (2026)

GoVector: An I/O-Efficient Caching Strategy for High-Dimensional Vector Nearest Neighbor Search
par: Zhou, Yijie, et autres
Publié: (2025)

Gorgeous: Revisiting the Data Layout for Disk-Resident High-Dimensional Vector Search
par: Yin, Peiqi, et autres
Publié: (2025)

Privacy-Preserving Approximate Nearest Neighbor Search on High-Dimensional Data
par: Liu, Yingfan, et autres
Publié: (2025)

A Topology-Aware Localized Update Strategy for Graph-Based ANN Index
par: Yu, Song, et autres
Publié: (2025)

FusedANN: Convexified Hybrid ANN via Attribute-Vector Fusion
par: Heidari, Alireza, et autres
Publié: (2025)

Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Neighbor Search
par: Gao, Jianyang, et autres
Publié: (2024)

LIRA: A Learning-based Query-aware Partition Framework for Large-scale ANN Search
par: Zeng, Ximu, et autres
Publié: (2025)

DGAI: Decoupled On-Disk Graph-Based ANN Index for Efficient Updates and Queries
par: Lou, Jiahao, et autres
Publié: (2025)

PDET-LSH: Scalable In-Memory Indexing for High-Dimensional Approximate Nearest Neighbor Search with Quality Guarantees
par: Wei, Jiuqi, et autres
Publié: (2026)

$\boldsymbol{Steiner}$-Hardness: A Query Hardness Measure for Graph-Based ANN Indexes
par: Wang, Zeyu, et autres
Publié: (2024)

Efficient Filtered-ANN via Learning-based Query Planning
par: Gan, Zhuocheng, et autres
Publié: (2026)

Bringing Data Transformations Near-Memory for Low-Latency Analytics in HTAP Environments
par: Bernhardt, Arthur, et autres
Publié: (2026)

CALL: Context-Aware Low-Latency Retrieval in Disk-Based Vector Databases
par: Jeong, Yeonwoo, et autres
Publié: (2025)

BMTree: Designing, Learning, and Updating Piecewise Space-Filling Curves for Multi-Dimensional Data Indexing
par: Li, Jiangneng, et autres
Publié: (2025)

ScaleGANN: Accelerate Large-Scale ANN Indexing by Cost-effective Cloud GPUs
par: Lu, Lan, et autres
Publié: (2026)

CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search
par: Zhang, Ziyu, et autres
Publié: (2025)

Vortex: Hosting ML Inference and Knowledge Retrieval Services With Tight Latency and Throughput Requirements
par: Yang, Yuting, et autres
Publié: (2025)

Accelerating Historical K-Core Search in Temporal Graphs
par: Ma, Zhuo, et autres
Publié: (2025)

Dimensionality-Reduction Techniques for Approximate Nearest Neighbor Search: A Survey and Evaluation
par: Wang, Zeyu, et autres
Publié: (2024)

LHGstore: An In-Memory Learned Graph Storage for Fast Updates and Analytics
par: Qiao, Pengpeng, et autres
Publié: (2026)

Efficient Data-aware Distance Comparison Operations for High-Dimensional Approximate Nearest Neighbor Search
par: Deng, Liwei, et autres
Publié: (2024)

ACGraph: An Efficient Asynchronous Out-of-Core Graph Processing Framework
par: Chen, Dechuang, et autres
Publié: (2025)

Low-Latency Stateful Stream Processing through Timely and Accurate Prefetching
par: Zapridou, Eleni, et autres
Publié: (2026)

Curator: Efficient Vector Search with Low-Selectivity Filters
par: Jin, Yicheng, et autres
Publié: (2026)

UREM: A High-performance Unified and Resilient Enhancement Method for Multi- and High-Dimensional Indexes
par: Sheng, Ming, et autres
Publié: (2025)

QuIVer: Rethinking ANN Graph Topology via Training-Free Binary Quantization
par: Xiao, Wenxuan, et autres
Publié: (2026)