首页|期刊导航|计算机工程与应用|双利普希茨网络和区间锁增强的学习型索引

双利普希茨网络和区间锁增强的学习型索引OA

BLELI:Bi-Lipschitz Network and Interval Lock Enhanced Learned Index

中文摘要英文摘要

学习型索引通过拟合键到位置的映射关系加速查询,已成为研究热点.主流方法通常采用分段线性函数提升拟合精度,但在复杂数据分布下需大量分段,导致索引规模膨胀、重训练频繁、查询性能下降;部分研究引入分布转换策略缓解该问题,但现有方法训练与转换开销较高、稳定性差.为解决上述问题,提出双利普希茨网络和区间锁增强的学习型索引(bi-Lipschitz network and interval lock enhanced learned index,BLELI),通过三项措施构建高效索引:(1)基于双利普希茨网络构建分布转换器——BiLipTransformer,具备天然单射性,内部结合直通网络使其在浅层架构高效捕捉数据特征,可平滑控制输入对输出的扰动以提升转换稳定性.(2)在BiLipTransformer的训练过程中,通过积分二次约束与凯莱变换加快收敛,且基于概率积分变换将目标分布设为均匀分布,减少后续拟合冲突.(3)结合模型节点和桶节点构建索引结构——PreciseSeekIndex,在局部插入引发重训练时,通过区间锁机制解决全局阻塞问题.实验表明,与传统索引结构(B+树)及典型学习型索引(RMI、ALEX、LIPP、NFL)相比,BLELI在多数据集和负载下吞吐量平均提升2.05倍,P99尾部延迟平均降低53.58%,有效突破了复杂数据分布下的性能与稳定性瓶颈,为索引的高效部署提供了鲁棒性解决方案.

Learned indexes accelerate query processing by fitting the mapping between keys and positions,and have become a research hotspot.Mainstream methods employ piece-wise linear functions to improve fitting quality.However,when handling complex data distributions,they require a large number of segments,leading to index size inflation,fre-quent retraining,and degraded query performance.Some studies introduce distribution transformation to mitigate this issue,but existing methods suffer from high training and transformation overheads as well as limited stability.To address these challenges,this paper proposes BLELI(bi-Lipschitz network and interval lock enhanced learned index),which con-structs an efficient index through three key mechanisms:(1)BiLipTransformer,a bi-Lipschitz network-based distribution transformer that is inherently injective,incorporates cross-layer connections to capture features even in shallow architec-tures,and allows smooth control of input-output perturbations to improve transformation stability.(2)Training optimiza-tion leverages integral quadratic constraints and Cayley transform-based parameterization to accelerate convergence.Fur-thermore,it adopts the probability integral transform theorem to target a uniform distribution,reducing conflicts in down-stream fitting.(3)PreciseSeekIndex is an index structure combining model nodes and bucket nodes,which uses the interval lock mechanism to resolve global blocking when local insertions trigger retraining.Experimental results demonstrate that,compared with traditional index structure(B+Tree)and representative learned indexes(RMI,ALEX,LIPP,NFL),BLELI achieves an average 2.05×improvement in throughput and a 53.58%reduction in P99 tail latency across multiple datasets and workloads,effectively overcoming performance and stability bottlenecks under complex data distributions and pro-viding a robust solution for efficient index deployment.

余新涛;陈刚

武汉大学 国家网络安全学院 空天信息安全与可信计算教育部重点实验室,武汉 430072武汉大学 国家网络安全学院 空天信息安全与可信计算教育部重点实验室,武汉 430072

信息技术与安全科学

学习型索引分布转换双利普希茨网络概率积分变换区间锁

learned indexdistribution transformationbi-Lipschitz networkprobability integral transform theoreminterval lock

《计算机工程与应用》 2026 (17)

105-117,13

国家自然科学基金(U1936107).

10.3778/j.issn.1002-8331.2508-0106

评论