The RD-tree: A structure for processing Partial-MAX/MIN queries in OLAP

DOI10.1016/S0020-0255(02)00184-6zbMath1033.68561OpenAlexW2069266187MaRDI QIDQ1857028

Yon Dohn Chung, Myoung Ho Kim, Woo Suk Yang

Publication date: 11 February 2003

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0255(02)00184-6

zbMATH Keywords

OLAPquery processingdatabasespartial-max/min query

Mathematics Subject Classification ID

Database theory (68P15) Computing methodologies and applications (68U99) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Data structures (68P05) Information storage and retrieval of data (68P20)

Cites Work

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

This page was built for publication: The RD-tree: A structure for processing Partial-MAX/MIN queries in OLAP