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

Information Sciences

Volumn 146, Issue 1-4, 2002, Pages 137-149

  Yang, Woo Suk ^a   Chung, Yon Dohn ^a   Kim, Myoung Ho ^a  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

Databases; OLAP; Partial max min query; Query processing

Indexed keywords

ALGORITHMS; DATA REDUCTION; DATA STRUCTURES; DATA WAREHOUSES; DECISION MAKING; ONLINE SYSTEMS; SORTING; TREES (MATHEMATICS);

ONLINE ANALYTICAL PROCESSING (OLAP); RANK DECISION TREES (RD-TREES);

QUERY LANGUAGES;

EID: 0036799469     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0255(02)00184-6     Document Type: Article

References (6)

1. Codd E.F., Codd S.B., Salley C.T. Beyond decision support. Computer World. 27(30):1993.
2. Gray J., Bosworth A., Layman A., Pirahesh Data Cube: a relational aggregation operator generalizing group-by, cross-tabs and sub-totals. Proceedings of Very Large Data Bases Conference. 1995;358-369.
3. Ho C.T., Agrawal R., Megiddo N., Srikant R. Range queries in OLAP data cubes. Proceedings of ACM SIGMOD Conference. 1997;73-88.
4. Ho C.T., Bruck J., Agrawal R. Partial-Sum Queries in OLAP Data Cubes Using Covering Codes. Proceedings of ACM PODS Conference. 1997;228-237.
5. Kim D.W., Kim M.H., Lee Y.J. An efficient processing of range min/max queries over data cube. Information Science. 1998;223-237.
6. P. O'Neil, D. Quass, Improved Query Performance with Variant Indexes, in: Proceedings of ACM SIGMOD Conference, 1997