An efficient algorithm for solving the partial sum query problem

DOI10.1016/S0020-0255(01)00106-2MaRDI QIDQ1602518zbMATH OpenFDO

Authors Akhil Kumar

Publication date 23 June 2002

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0020-0255(01)00106-2

zbMATH Keywords

online analytical processing databases

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• On the Complexity of Maintaining Partial Sums
• Tight bounds for the partial-sums problem
• Cell-probe lower bounds for succinct partial sums
• Optimal Biweighted Binary Trees and the Complexity of Maintaining Partial Sums
• Computing partial data cubes for parallel data warehousing applications

Cites work

• scientific article; zbMATH DE number 3672160 (Why is no real title available?)
• scientific article; zbMATH DE number 42687 (Why is no real title available?)
• On the covering radius of codes

Cited in

(7)

• scientific article; zbMATH DE number 2086301 (Why is no real title available?)
• Optimal Biweighted Binary Trees and the Complexity of Maintaining Partial Sums
• Efficient lineage for SUM aggregate queries
• An efficient sum query algorithm for distance-based locally dominating functions
• Algorithms for provisioning queries and analytics
• Internal masked prefix sums and its connection to fully internal measurement queries
• Quest for fast partial search algorithm

This page was built for publication: An efficient algorithm for solving the partial sum query problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1602518)