Efficient execution of range-aggregate queries in data warehouse environments

DOI10.1007/3-540-45581-7_23MaRDI QIDQ4473483zbMATH OpenFDO

Authors Seokjin Hong, Byoungho Song, Sukho Lee

Publication date 4 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2224/22240299.htm

Mathematics Subject Classification ID

Database theory (68P15) Computing methodologies and applications (68U99)

Recommendations

• Index structures for data warehouses
• Orthogonal range queries in OLAP
• scientific article; zbMATH DE number 1792111
• Calculating aggregates with range-encoded bit-sliced index
• CRB-tree: An efficient indexing scheme for range-aggregate queries

Cited in

(6)

• Index structures for data warehouses
• Efficient external memory structures for range-aggregate queries
• Indexing for summary queries, theory and practice
• CRB-tree: An efficient indexing scheme for range-aggregate queries
• Efficient lineage for SUM aggregate queries
• Calculating aggregates with range-encoded bit-sliced index

This page was built for publication: Efficient execution of range-aggregate queries in data warehouse environments

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