An efficient processing of range-MIN/MAX queries over data cube

DOI10.1016/S0020-0255(98)10035-XMaRDI QIDQ1818815zbMATH OpenOpenAlexFDO

Authors Dongwook Kim, Myoung Ho Kim, Yoon Joon Lee, Eun-Jung Lee

Publication date 4 January 2000

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0020-0255(98)10035-x

zbMATH Keywords

decision support systemson-line analytical processing

Mathematics Subject Classification ID

Database theory (68P15) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)

Recommendations

• The RD-tree: A structure for processing Partial-MAX/MIN queries in OLAP
• scientific article; zbMATH DE number 2080483
• Dynamic orthogonal range queries in OLAP.
• Range queries in dynamic OLAP data cubes
• Adaptive method for range top-k queries in OLAP data cubes

Cited in

(5)

• The RD-tree: A structure for processing Partial-MAX/MIN queries in OLAP
• A cubic-wise balance approach for privacy preservation in data cubes.
• Adaptive method for range top-k queries in OLAP data cubes
• Optimal range max datacube for fixed dimensions
• OPTIMAL RANGE MAX DATACUBE FOR FIXED DIMENSIONS

This page was built for publication: An efficient processing of range-MIN/MAX queries over data cube

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