Partial-sum queries in OLAP data cubes using covering codes

DOI10.1109/12.737680zbMath1391.94888OpenAlexW2171921705MaRDI QIDQ4571490

Jehoshua Bruck, Rakesh Agrawal, Ching-Tien Ho

Publication date: 9 July 2018

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://authors.library.caltech.edu/5583/

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Related Items (2)

Upper bounds on the length function for covering codes with covering radius \(R\) and codimension \(tR+1\) ⋮ Dynamic orthogonal range queries in OLAP.

This page was built for publication: Partial-sum queries in OLAP data cubes using covering codes