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 practical solutions to this problem, showing that new trade-offs between the performance of queries and updates can be achieved on modern hardware
Data warehouses contain data consolidated from several operational databases and provide the histori...
We present randomized algorithms that solve subset sum and knapsack instances with n items in O∗ (20...
The problem of answering rank/select queries over a bitmap is of utmost importance for many succinct...
Given an integer array A, the prefix-sum problem is to answer sum(i) queries that return the sum of ...
In this paper we study the Prefix Sum problem introduced by Fredman. We show that it is possible to ...
AbstractThe prefix-sum operation, which returns all prefix sums on a sequence of numbers, plays an i...
Prefix sums are key building blocks in the implementation of many concurrent software applications, ...
We consider the well-studied partial sums problem in succint space where one is to maintain an array...
Data mining and related applications often rely on extensive range sum queries and thus, it is impor...
Abstract: "Experienced algorithm designers rely heavily on a set of building blocks and on the tools...
A partial-sum query obtains the summation over a set of specified cells of a data cube. We establish...
Parallel prefix computation is perhaps the most frequently used subroutine in parallel algorithms to...
Data warehouses contain data consolidated from several operational databases and provide the histori...
We present randomized algorithms that solve subset sum and knapsack instances with n items in O∗ (20...
The problem of answering rank/select queries over a bitmap is of utmost importance for many succinct...
Given an integer array A, the prefix-sum problem is to answer sum(i) queries that return the sum of ...
In this paper we study the Prefix Sum problem introduced by Fredman. We show that it is possible to ...
AbstractThe prefix-sum operation, which returns all prefix sums on a sequence of numbers, plays an i...
Prefix sums are key building blocks in the implementation of many concurrent software applications, ...
We consider the well-studied partial sums problem in succint space where one is to maintain an array...
Data mining and related applications often rely on extensive range sum queries and thus, it is impor...
Abstract: "Experienced algorithm designers rely heavily on a set of building blocks and on the tools...
A partial-sum query obtains the summation over a set of specified cells of a data cube. We establish...
Parallel prefix computation is perhaps the most frequently used subroutine in parallel algorithms to...
Data warehouses contain data consolidated from several operational databases and provide the histori...
We present randomized algorithms that solve subset sum and knapsack instances with n items in O∗ (20...
The problem of answering rank/select queries over a bitmap is of utmost importance for many succinct...
DOI
Add to ORKG