Given an integer array A, the prefix-sum problem is to answer sum(i) queries that return the sum of the elements in A[0..i], knowing that the integers in A can be changed. It is a classic problem in data structure design with a wide range of applications in computing from coding to databases. In this work, we propose and compare several and practical solutions to this problem, showing that new trade-offs between the performance of queries and updates can be achieved on modern hardware.

中文翻译：

---

前缀和问题的实际权衡

给定一个整数数组 A，前缀和问题是回答 sum(i) 查询，这些查询返回 A[0..i] 中元素的总和，知道 A 中的整数可以改变。它是数据结构设计中的一个经典问题，在从编码到数据库的计算中有着广泛的应用。在这项工作中，我们针对这个问题提出并比较了几种实用的解决方案，表明可以在现代硬件上实现查询和更新性能之间的新权衡。