前缀和问题的实用折衷
Practical Trade-Offs for the Prefix-Sum Problem
摘要：
给定一个整数数组A，前缀和问题是回答sum（i）查询，返回A[0..知道A中的整数是可以改变的。它是数据结构设计中的经典问题，在从编码到数据库的计算中有着广泛的应用。在这项工作中，我们提出并比较了几个和实际的解决方案，这个问题，显示查询和更新的性能之间的新的权衡可以实现现代硬件。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
