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

DOI10.1016/S0020-0255(02)00184-6MaRDI QIDQ1857028zbMATH OpenOpenAlexFDO

Authors Woo Suk Yang, Yon Dohn Chung, Myoung Ho Kim

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

databasesquery processingOLAPpartial-max/min query

Mathematics Subject Classification ID

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

Recommendations

• An efficient processing of range-MIN/MAX queries over data cube
• scientific article; zbMATH DE number 2080483
• Improving the Performance of OLAP Queries Using Families of Statistics Trees
• Dynamic orthogonal range queries in OLAP.
• scientific article; zbMATH DE number 1945878

Cites work

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

Cited in

(2)

• Improving the Performance of OLAP Queries Using Families of Statistics Trees
• scientific article; zbMATH DE number 1945878 (Why is no real title available?)

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

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