Leveraging I/O Stalls for Efficient Scheduling in ANNS
Fuente:
arXiv
Guardado en:
| Autores principales: | Zhang, Juncheng, Ren, Yuanming, Li, Yongkun, Lee, Patrick P. C. |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
Decoupling Vector Data and Index Storage for Space Efficiency
por: Ren, Yuanming, et al.
Publicado: (2026)
por: Ren, Yuanming, et al.
Publicado: (2026)
Breaking the Storage-Compute Bottleneck in Billion-Scale ANNS: A GPU-Driven Asynchronous I/O Framework
por: Xiao, Yang, et al.
Publicado: (2025)
por: Xiao, Yang, et al.
Publicado: (2025)
Accelerating Graph Indexing for ANNS on Modern CPUs
por: Wang, Mengzhao, et al.
Publicado: (2025)
por: Wang, Mengzhao, et al.
Publicado: (2025)
CS-PQ: Cache-Friendly SIMD Product Quantization for Large-Scale ANNS Index Construction
por: Ma, Y. T., et al.
Publicado: (2026)
por: Ma, Y. T., et al.
Publicado: (2026)
GPU-Accelerated ANNS: Quantized for Speed, Built for Change
por: McCoy, Hunter, et al.
Publicado: (2026)
por: McCoy, Hunter, et al.
Publicado: (2026)
U-HNSW: An Efficient Graph-based Solution to ANNS Under Universal Lp Metrics
por: Wang, Huayi, et al.
Publicado: (2026)
por: Wang, Huayi, et al.
Publicado: (2026)
GRAB-ANNS: High-Throughput Indexing and Hybrid Search via GPU-Native Bucketing
por: Zhao, Xinkui, et al.
Publicado: (2026)
por: Zhao, Xinkui, et al.
Publicado: (2026)
FusionANNS: An Efficient CPU/GPU Cooperative Processing Architecture for Billion-scale Approximate Nearest Neighbor Search
por: Tian, Bing, et al.
Publicado: (2024)
por: Tian, Bing, et al.
Publicado: (2024)
SpANNS: Optimizing Approximate Nearest Neighbor Search for Sparse Vectors Using Near Memory Processing
por: Zhang, Tianqi, et al.
Publicado: (2026)
por: Zhang, Tianqi, et al.
Publicado: (2026)
FOCUS: Boosting Schema-aware Access for KV Stores via Hierarchical Data Management
por: Liu, Zhen, et al.
Publicado: (2025)
por: Liu, Zhen, et al.
Publicado: (2025)
Avoiding Thread Stalls and Switches in Key-Value Stores: New Latch-Free Techniques and More
por: Lomet, David, et al.
Publicado: (2026)
por: Lomet, David, et al.
Publicado: (2026)
PoneglyphDB: Efficient Non-interactive Zero-Knowledge Proofs for Arbitrary SQL-Query Verification
por: Gu, Binbin, et al.
Publicado: (2024)
por: Gu, Binbin, et al.
Publicado: (2024)
GateANN: I/O-Efficient Filtered Vector Search on SSDs
por: Lee, Nakyung, et al.
Publicado: (2026)
por: Lee, Nakyung, et al.
Publicado: (2026)
Efficient Row-Level Lineage Leveraging Predicate Pushdown
por: Lin, Yin, et al.
Publicado: (2024)
por: Lin, Yin, et al.
Publicado: (2024)
GoVector: An I/O-Efficient Caching Strategy for High-Dimensional Vector Nearest Neighbor Search
por: Zhou, Yijie, et al.
Publicado: (2025)
por: Zhou, Yijie, et al.
Publicado: (2025)
ForeSight: A Predictive-Scheduling Deterministic Database
por: Huang, Junfang, et al.
Publicado: (2025)
por: Huang, Junfang, et al.
Publicado: (2025)
BoostER: Leveraging Large Language Models for Enhancing Entity Resolution
por: Li, Huahang, et al.
Publicado: (2024)
por: Li, Huahang, et al.
Publicado: (2024)
Scheduling of Intermittent Query Processing
por: Chandrasekaran, Saranya, et al.
Publicado: (2023)
por: Chandrasekaran, Saranya, et al.
Publicado: (2023)
Brook-2PL: Tolerating High Contention Workloads with A Deadlock-Free Two-Phase Locking Protocol
por: Habibi, Farzad, et al.
Publicado: (2025)
por: Habibi, Farzad, et al.
Publicado: (2025)
ZipLLM: Efficient LLM Storage via Model-Aware Synergistic Data Deduplication and Compression
por: Wang, Zirui, et al.
Publicado: (2025)
por: Wang, Zirui, et al.
Publicado: (2025)
LIVE: Learnable Monotonic Vertex Embedding for Efficient Exact Subgraph Matching (Technical Report)
por: Ye, Yutong, et al.
Publicado: (2026)
por: Ye, Yutong, et al.
Publicado: (2026)
MobileRAG: A Fast, Memory-Efficient, and Energy-Efficient Method for On-Device RAG
por: Park, Taehwan, et al.
Publicado: (2025)
por: Park, Taehwan, et al.
Publicado: (2025)
UPER: Efficient Utility-driven Partially-ordered Episode Rule Mining
por: Lin, Hong, et al.
Publicado: (2026)
por: Lin, Hong, et al.
Publicado: (2026)
Elastic Scheduling of Intermittent Query Processing in a Cluster Environment
por: Chandrasekaran, Saranya, et al.
Publicado: (2026)
por: Chandrasekaran, Saranya, et al.
Publicado: (2026)
CARPO: Leveraging Listwise Learning-to-Rank for Context-Aware Query Plan Optimization
por: Zhou, Wenrui, et al.
Publicado: (2025)
por: Zhou, Wenrui, et al.
Publicado: (2025)
Prompt-Matcher: Leveraging Large Models to Reduce Uncertainty in Schema Matching Results
por: Feng, Longyu, et al.
Publicado: (2024)
por: Feng, Longyu, et al.
Publicado: (2024)
Efficient Query Repair for Aggregate Constraints
por: Algarni, Shatha, et al.
Publicado: (2025)
por: Algarni, Shatha, et al.
Publicado: (2025)
AutoCE: An Accurate and Efficient Model Advisor for Learned Cardinality Estimation
por: Zhang, Jintao, et al.
Publicado: (2024)
por: Zhang, Jintao, et al.
Publicado: (2024)
HEXGEN-FLOW: Optimizing LLM Inference Request Scheduling for Agentic Text-to-SQL
por: Peng, You, et al.
Publicado: (2025)
por: Peng, You, et al.
Publicado: (2025)
TxnSails: Achieving Serializable Transaction Scheduling with Self-Adaptive Isolation Level Selection
por: Zhuang, Qiyu, et al.
Publicado: (2025)
por: Zhuang, Qiyu, et al.
Publicado: (2025)
An Efficient Proximity Graph-based Approach to Table Union Search
por: Xie, Yiming, et al.
Publicado: (2025)
por: Xie, Yiming, et al.
Publicado: (2025)
The "I" in FAIR: Translating from Interoperability in Principle to Interoperation in Practice
por: Morris, Evan, et al.
Publicado: (2026)
por: Morris, Evan, et al.
Publicado: (2026)
Leveraging Large Language Models for Enhanced Process Model Comprehension
por: Kourani, Humam, et al.
Publicado: (2024)
por: Kourani, Humam, et al.
Publicado: (2024)
SLSM : An Efficient Strategy for Lazy Schema Migration on Shared-Nothing Databases
por: Zeng, Zhilin, et al.
Publicado: (2024)
por: Zeng, Zhilin, et al.
Publicado: (2024)
Intelligent Transaction Scheduling via Conflict Prediction in OLTP DBMS
por: Zhang, Tieying, et al.
Publicado: (2024)
por: Zhang, Tieying, et al.
Publicado: (2024)
I/O Optimizations for Graph-Based Disk-Resident Approximate Nearest Neighbor Search: A Design Space Exploration
por: Li, Liang, et al.
Publicado: (2026)
por: Li, Liang, et al.
Publicado: (2026)
Seeing the Trees for the Forest: Leveraging Tree-Shaped Substructures in Property Graphs
por: Arturi, Daniel Aarao Reis, et al.
Publicado: (2026)
por: Arturi, Daniel Aarao Reis, et al.
Publicado: (2026)
FIER: Fine-Grained and Efficient KV Cache Retrieval for Long-context LLM Inference
por: Wang, Dongwei, et al.
Publicado: (2025)
por: Wang, Dongwei, et al.
Publicado: (2025)
Improving Database Performance by Application-side Transaction Merging
por: Ren, Xueyuan, et al.
Publicado: (2026)
por: Ren, Xueyuan, et al.
Publicado: (2026)
Batch-Schedule-Execute: On Optimizing Concurrent Deterministic Scheduling for Blockchains (Extended Version)
por: Hay, Yaron, et al.
Publicado: (2024)
por: Hay, Yaron, et al.
Publicado: (2024)
Ejemplares similares
-
Decoupling Vector Data and Index Storage for Space Efficiency
por: Ren, Yuanming, et al.
Publicado: (2026) -
Breaking the Storage-Compute Bottleneck in Billion-Scale ANNS: A GPU-Driven Asynchronous I/O Framework
por: Xiao, Yang, et al.
Publicado: (2025) -
Accelerating Graph Indexing for ANNS on Modern CPUs
por: Wang, Mengzhao, et al.
Publicado: (2025) -
CS-PQ: Cache-Friendly SIMD Product Quantization for Large-Scale ANNS Index Construction
por: Ma, Y. T., et al.
Publicado: (2026) -
GPU-Accelerated ANNS: Quantized for Speed, Built for Change
por: McCoy, Hunter, et al.
Publicado: (2026)