Bitmap indices for speeding up high-dimensional data analysis

DOI10.1007/3-540-46146-9_87MaRDI QIDQ4410738zbMATH OpenFDO

Authors Kurt Stockinger

Publication date 3 July 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/2453/24530881.htm

Mathematics Subject Classification ID

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

Recommendations

• Bitmap Index-Based Decision Trees
• A data mining approach for efficient selection bitmap join index
• COMBAT: a new bitmap index coding algorithm for big data
• High-dimensional indexing. Transformational approaches to high-dimensional range and similarity searches
• Calculating aggregates with range-encoded bit-sliced index

Cited in

(5)

• COMBAT: a new bitmap index coding algorithm for big data
• Calculating aggregates with range-encoded bit-sliced index
• Bitmap Index-Based Decision Trees
• GPU-PLWAH: GPU-based implementation of the PLWAH algorithm for compressing bitmaps
• A data mining approach for efficient selection bitmap join index

This page was built for publication: Bitmap indices for speeding up high-dimensional data analysis

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