Orthogonal range queries in OLAP

DOI10.1007/3-540-44503-X_23MaRDI QIDQ4473281zbMATH OpenFDO

Authors Chung Keung Poon

Publication date 4 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/1973/19730361.htm

Mathematics Subject Classification ID

Data structures (68P05) Database theory (68P15)

Recommendations

• Dynamic orthogonal range queries in OLAP.
• Range queries in dynamic OLAP data cubes
• OPTIMAL RANGE MAX DATACUBE FOR FIXED DIMENSIONS
• Optimal range max datacube for fixed dimensions
• Range top/bottom k queries in OLAP sparse data cubes

Cited in

(12)

• Dynamic orthogonal range queries in OLAP.
• An efficient processing of range-MIN/MAX queries over data cube
• The RD-tree: A structure for processing Partial-MAX/MIN queries in OLAP
• Efficient computation of hierarchical prefixcube
• Adaptive method for range top-k queries in OLAP data cubes
• Flexible data cubes for online aggregation
• Efficient execution of range-aggregate queries in data warehouse environments
• Range queries in dynamic OLAP data cubes
• Improving the performance of OLAP queries using families of statistics trees
• Range top/bottom k queries in OLAP sparse data cubes
• OPTIMAL RANGE MAX DATACUBE FOR FIXED DIMENSIONS
• Online aggregation on data cubes without auxiliary information

This page was built for publication: Orthogonal range queries in OLAP

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