paperbot · PL 论文追踪

全部论文 待读 收藏

P2 Y-Map: A Multi-Encoder Y-Architecture for Predicting Performance-Aware Object-Relational Mappings

Y-Map:一种用于预测性能感知对象关系映射的多编码器 Y 架构
ICSE Proceedings of the 2026 IEEE/ACM 48th International Conference on Software Engineering2026匹配度 3/10 · 论文属于机器学习与程序语言交叉,但核心是 ORM schema 性能预测与选型,并非用户关注的静态分析、浮点程序分析或贝叶斯程序分析;LLM 仅作为代码嵌入特征,未涉及利用 LLM/Agent 改进程序分析或验证。引用 2 inbox
Sasan Azizian, Ayoub Hazrati, Artin Azizian, Elham Rastegari
crossref: 2026-09-12

AI 速览

一句话:Y-Map 用神经-符号回归离线预测 ORM schema 的插入延迟、查询延迟与内存,实现免基准测试的帕累托式选型。

选择高性能的对象关系映射(ORM)需在插入延迟、查询延迟和内存占用等多个冲突目标间权衡。实践中 ORM 框架通常采用固定启发式规则、只输出单一 schema;而基于先验学习的方法往往把选型简化为二元帕累托成员分类,难以进行细粒度权衡推理。本文提出 Y-Map,一个神经-符号框架:它离线通过规范驱动的 schema 合成与基准测试构建监督数据,在融合的 schema 表示上训练回归模型,该表示将可解释的结构描述符与 GraphCodeBERT、CodeT5+ 和 LLaMA 的嵌入相结合。推理时无需执行数据库负载,即可预测候选 schema 的连续插入延迟、查询延迟与内存占用,从而支持无基准的帕累托式选择——小空间可穷举打分,大空间可预算受限搜索。在九个基准对象模型上,Y-Map 相比代表性的基于基准测试的基线提升了权衡质量并降低了推理成本,展示了符号有效性保证与学习式性能预测相结合用于实用性能感知 schema 设计的前景。

问题
ORM 映射选型需在插入延迟、查询延迟与内存等多目标间权衡,但现有框架依赖固定启发式只产生单一 schema,基于学习的既有方法又把选择退化为二元帕累托成员分类,缺乏细粒度权衡能力。
方法
Y-Map 是神经-符号框架:离线以规范驱动的 schema 合成与基准测试生成监督数据,再用融合 schema 表示(可解释结构描述符加 GraphCodeBERT、CodeT5+、LLaMA 嵌入)训练回归模型,推理时不执行数据库负载即可预测连续性能指标。
评估
在九个基准对象模型上,与一个代表性的基于基准测试的基线相比,评估其权衡质量与推理成本;结果显示 Y-Map 提升了权衡质量并降低了推理开销。
原文摘要(Abstract)

Selecting high-performance object-relational mappings (ORMs) requires balancing competing objectives, such as insert and query latency and memory usage. In practice, ORM frameworks typically apply fixed heuristics and emit a single schema. At the same time, prior-learning-based approaches often reduce selection to binary Pareto membership classification, thereby limiting fine-grained tradeoff reasoning. We present Y-Map, a neural–symbolic framework that predicts continuous performance metrics for the ORM schema candidates without executing database workloads during inference. Y-Map constructs supervised training data offline via specification-driven schema synthesis and benchmarking, then learns a regression model over fused schema representations that combine interpretable structural descriptors with embeddings from GraphCodeBERT, CodeT5+, and LLaMA. By predicting continuous insert latency, query latency, and memory usage for candidate schemas, Y-Map enables benchmark-free Pareto-style selection, supporting exhaustive scoring in small spaces and budgeted search in larger ones. Across nine benchmark object models, Y-Map improves tradeoff quality and reduces inference cost relative to a representative benchmarking-based baseline, demonstrating the promise of combining symbolic validity guarantees with learned performance prediction for a practical performance-aware schema design.

链接与引用

DOI 原文 · PDF(开放获取) ·

BibTeX
@inproceedings{paperbot11579,
  title = {Y-Map: A Multi-Encoder Y-Architecture for Predicting Performance-Aware Object-Relational Mappings},
  author = {Sasan Azizian and Ayoub Hazrati and Artin Azizian and Elham Rastegari},
  booktitle = {ICSE},
  year = {2026},
  doi = {10.1145/3774748.3795662}
}