Query Cost Model Calibration in Confidential Virtual Machines

• URL: http://arxiv.org/abs/2606.26385v1
• Date: Wed, 24 Jun 2026 21:11:17 GMT
• Title: Query Cost Model Calibration in Confidential Virtual Machines
• Abstract summary: We show that analytical queries in such CVMs often suffer substantial overhead, and prior database work has largely stopped at these slowdowns rather than optimizing them.<n>We propose a lightweight CVM-aware cost calibration model to address this problem.<n>Experiments show that the calibration significantly narrows the KVM/CVM performance gap, recovering up to 48 percent performance and even outperforming the KVM baseline on some workloads.
• Score: 9.420554351854593
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: With the growing adoption of Confidential Computing, running databases in confidential virtual machines (CVMs) such as AMD SEV-SNP has become an attractive way to protect sensitive cloud data with minimal changes to legacy DBMSs. However, analytical queries in such CVMs often suffer substantial overhead, and prior database work has largely stopped at benchmarking these slowdowns rather than optimizing them. We show that this problem stems from a hardware-software mismatch: query optimizers still rely on KVM-oriented (non-encrypted VM) cost assumptions that no longer hold in CVMs. To address this, we propose a lightweight CVM-aware cost calibration. It models two dominant sources of optimizer-facing overhead: data movement and RMP-related translation using simple physical proxies already available to the optimizer. Experiments show that the calibration significantly narrows the KVM/CVM performance gap, recovering up to 48 percent performance and even outperforming the KVM baseline on some workloads.

Related papers

• DPC-VQA: Decoupling Quality Perception and Residual Calibration for Video Quality Assessment [49.02765249211074]
  multimodal large language models (MLLMs) have shown promising performance on video quality assessment (VQA) tasks.<n>Adapting them to new scenarios remains expensive due to large-scale retraining and costly mean opinion score (MOS) annotations.<n>We propose DPC-VQA, a decoupling perception and calibration framework for video quality assessment.
  arXiv  Detail & Related papers  (2026-04-14T14:40:23Z)
• Tiny Inference-Time Scaling with Latent Verifiers [56.696619768584675]
  Verifier on Hidden States ( VHS) operates on intermediate hidden representations of Diffusion Transformer (DiT) single-step generators.<n> VHS analyzes generator features without decoding to pixel space, thereby reducing the per-candidate verification cost.<n> VHS achieves a +2.7% improvement on GenEval at the same inference-time budget.
  arXiv  Detail & Related papers  (2026-03-23T19:00:02Z)
• Empirical Recipes for Efficient and Compact Vision-Language Models [54.92440500651415]
  Vision-language models (VLMs) in resource-constrained settings demand low latency and high throughput.<n>We conduct an empirical end-to-end efficiency analysis and systematically profile inference to identify the dominant bottlenecks.<n>We develop optimization recipes tailored to compact VLMs that substantially reduce latency while preserving accuracy.
  arXiv  Detail & Related papers  (2026-03-17T17:17:40Z)
• Towards VM Rescheduling Optimization Through Deep Reinforcement Learning [9.4293010682986]
  We develop a reinforcement learning system for VM rescheduling, VM2RL, which incorporates a set of customized techniques.<n>Our results show that VM2RL can achieve a performance comparable to the optimal solution but with a running time of seconds.
  arXiv  Detail & Related papers  (2025-05-23T00:30:53Z)
• Enhancing Robustness and Efficiency of Least Square Twin SVM via Granular Computing [0.2999888908665658]
  In the domain of machine learning, least square twin support vector machine (LSTSVM) stands out as one of the state-of-the-art models.<n>LSTSVM suffers from sensitivity to noise and inversions, overlooking the principle and instability in resampling.<n>We propose the robust granular ball LSTSVM (GBLSTSVM), which is trained using granular balls instead of original data points.
  arXiv  Detail & Related papers  (2024-10-22T18:13:01Z)
• CORM: Cache Optimization with Recent Message for Large Language Model Inference [57.109354287786154]
  We introduce an innovative method for optimizing the KV cache, which considerably minimizes its memory footprint. CORM, a KV cache eviction policy, dynamically retains essential key-value pairs for inference without the need for model fine-tuning. Our validation shows that CORM reduces the inference memory usage of KV cache by up to 70% with negligible performance degradation across six tasks in LongBench.
  arXiv  Detail & Related papers  (2024-04-24T16:11:54Z)
• A Safe Screening Rule with Bi-level Optimization of $\nu$ Support Vector Machine [15.096652880354199]
  We propose a safe screening rule with bi-level optimization for $nu$-SVM. Our SRBO-$nu$-SVM is strictly deduced by integrating the Karush-Kuhn-Tucker conditions. We also develop an efficient dual coordinate descent method (DCDM) to further improve computational speed.
  arXiv  Detail & Related papers  (2024-03-04T06:55:57Z)
• SpotServe: Serving Generative Large Language Models on Preemptible Instances [64.18638174004151]
  SpotServe is the first distributed large language models serving system on preemptible instances. We show that SpotServe can reduce the P99 tail latency by 2.4 - 9.1x compared with the best existing LLM serving systems. We also show that SpotServe can leverage the price advantage of preemptive instances, saving 54% monetary cost compared with only using on-demand instances.
  arXiv  Detail & Related papers  (2023-11-27T06:31:17Z)
• Combination of Convolutional Neural Network and Gated Recurrent Unit for Energy Aware Resource Allocation [0.0]
  Cloud computing service models have experienced rapid growth and inefficient resource usage is one of the greatest causes of high energy consumption in cloud data centers. Resource allocation in cloud data centers aiming to reduce energy consumption has been conducted using live migration of Virtual Machines (VMs) and their consolidation into the small number of Physical Machines (PMs) To solve this issue, can be classified according to the pattern of user requests into sensitive or insensitive classes to latency, and thereafter suitable VM can be selected for migration.
  arXiv  Detail & Related papers  (2021-06-23T05:57:51Z)
• AML-SVM: Adaptive Multilevel Learning with Support Vector Machines [0.0]
  This paper proposes an adaptive multilevel learning framework for the nonlinear SVM. It improves the classification quality across the refinement process, and leverages multi-threaded parallel processing for better performance.
  arXiv  Detail & Related papers  (2020-11-05T00:17:02Z)
• On Coresets for Support Vector Machines [61.928187390362176]
  A coreset is a small, representative subset of the original data points. We show that our algorithm can be used to extend the applicability of any off-the-shelf SVM solver to streaming, distributed, and dynamic data settings.
  arXiv  Detail & Related papers  (2020-02-15T23:25:12Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.