Practical Trade-Offs for the Prefix-Sum Problem
Data Structures and Algorithms
2022-02-08 v3
Abstract
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.
Keywords
Cite
@article{arxiv.2006.14552,
title = {Practical Trade-Offs for the Prefix-Sum Problem},
author = {Giulio Ermanno Pibiri and Rossano Venturini},
journal= {arXiv preprint arXiv:2006.14552},
year = {2022}
}
Comments
Accepted by "Software: Practice and Experience", 2020