OPTIMAL RANGE MAX DATACUBE FOR FIXED DIMENSIONS

DOI10.1142/S0129054104002741zbMath1098.68037OpenAlexW1982235167MaRDI QIDQ4667924

Chung Keung Poon

Publication date: 18 April 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054104002741

zbMATH Keywords

data warehouseon-line analytical processing

Mathematics Subject Classification ID

Database theory (68P15)

Cites Work

• Multidimensional divide-and-conquer
• Dynamic orthogonal range queries in OLAP.
• An efficient processing of range-MIN/MAX queries over data cube
• Lower bounds for orthogonal range searching: I. The reporting case
• Lower bounds for orthogonal range searching: part II. The arithmetic model
• Efficiency of a Good But Not Linear Set Union Algorithm
• A Functional Approach to Data Structures and Its Use in Multidimensional Searching

This page was built for publication: OPTIMAL RANGE MAX DATACUBE FOR FIXED DIMENSIONS