Practical Trade-Offs for the Prefix-Sum Problem

06/25/2020 ∙ by Giulio Ermanno Pibiri, et al. ∙ 0

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.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 16

Code Repositories

psds

Prefix-Sum Data Structures in C++. This is the code for the paper "Practical Trade-Offs for the Prefix-Sum Problem" by Giulio Ermanno Pibiri and Rossano Venturini, https://arxiv.org/abs/2006.14552.


view repo
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.