An efficient processing of range-MIN/MAX queries over data cube
From MaRDI portal
Publication:1818815
DOI10.1016/S0020-0255(98)10035-XzbMath0951.68563OpenAlexW2127961206MaRDI QIDQ1818815
Yoon Joon Lee, Myoung Ho Kim, Dong Wook Kim, 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
Database theory (68P15) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)
Related Items (3)
OPTIMAL RANGE MAX DATACUBE FOR FIXED DIMENSIONS ⋮ A cubic-wise balance approach for privacy preservation in data cubes. ⋮ The RD-tree: A structure for processing Partial-MAX/MIN queries in OLAP
This page was built for publication: An efficient processing of range-MIN/MAX queries over data cube