An efficient algorithm for solving the partial sum query problem

Research output: Contribution to journalArticle

1 Scopus citations

Abstract

We address the problem: given n data values, how many partial sums must be stored so that partial sums of any other combination of these n values can be calculated in one arithmetic operation from the stored values. This problem has application in online analytical processing (OLAP) databases [Gray et al., Proc. 12th Int. Conf. Data Eng. (1996)] where it is called the partial sum aggregation query. It can also be used to generate the entire power set of n values efficiently. In this paper, we derive lower bounds for this problem, devise an efficient algorithm to solve it and show that our heuristic comes reasonably close to the lower bound.

Original languageEnglish (US)
Pages (from-to)245-258
Number of pages14
JournalInformation Sciences
Volume137
Issue number1-4
DOIs
StatePublished - Sep 1 2001

All Science Journal Classification (ASJC) codes

  • Software
  • Control and Systems Engineering
  • Theoretical Computer Science
  • Computer Science Applications
  • Information Systems and Management
  • Artificial Intelligence

Fingerprint Dive into the research topics of 'An efficient algorithm for solving the partial sum query problem'. Together they form a unique fingerprint.

  • Cite this