Calculating aggregates with range-encoded bit-sliced index

DOI10.1007/3-540-45675-9_8MaRDI QIDQ4707947zbMATH OpenFDO

Authors Kashif Bhutta

Publication date 12 June 2003

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/2412/24120043.htm

Mathematics Subject Classification ID

Database theory (68P15) Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies and applications (68U99)

Recommendations

• Efficient execution of range-aggregate queries in data warehouse environments
• Index structures for data warehouses
• Efficient aggregation algorithms on very large compressed data warehouses
• Indexing for summary queries, theory and practice
• Bitmap indices for speeding up high-dimensional data analysis

Cited in

(4)

• COMBAT: a new bitmap index coding algorithm for big data
• Bitmap indices for speeding up high-dimensional data analysis
• Efficient execution of range-aggregate queries in data warehouse environments
• Extending the Macsum aggregation to interval-valued inputs

This page was built for publication: Calculating aggregates with range-encoded bit-sliced index

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