Live briefing
Everything about Bitmap index
Database indexing technique
A bitmap index is a special kind of database index that uses bitmaps. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Bitmap indexA 5-minute orientation
- Skim a recent paper: Reduced Hierarchical Bitmap Index (R-HBI) for Efficient Data Scheduling in a Wireless Broadcasting EnvironmentInfluential work since 2022
- Pick up a classic book: Digital planetThe most-reprinted book on the subject
- Read the landmark paper: Sorting improves word-aligned bitmap indexesCited 76 times
- Go sideways: Data orientationA closely related topic
- Go sideways: Patrick O'NeilA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Sorting improves word-aligned bitmap indexes
Bitmap index design and evaluation
A survey of bitmap index compression algorithms for Big Data
Efficient Iceberg Query Evaluation Using Compressed Bitmap Index
Money laundering regulatory risk evaluation using Bitmap Index-based Decision Tree
Optimizing bitmap index encoding for high performance queries
An FPGA-Based Hardware Accelerator for Energy-Efficient Bitmap Index Creation
CUBIT: Concurrent Updatable Bitmap Indexing
🆕 Influential since 2022
Reduced Hierarchical Bitmap Index (R-HBI) for Efficient Data Scheduling in a Wireless Broadcasting Environment
RABIT: Efficient Range Queries with Bitmap Indexing
BIFM: an effective similar payload attribution approach for cybercriminal detection using bitmap index table and fuzzy matching
PERBANDINGAN TEKNIK INDEXING BITMAP DAN B-TREE PADA ORACLE DATABASE
Automatic Selection of Bitmap Join Indexes in Data Warehouses Using CFPGrowth++ Algorithm
📚 Books worth reading
Digital planetGeorge Beekman, Ben Beekman · 2011
Getting it right in printMark Gatter · 2004
Essential Flash 5.0 fastFiaz Hussain · 2001
Raster imaging and digital typography IIInternational Conference on Raster Imaging and Digital Typography (2nd 1991 Boston, Mass.) · 1991
The Art Of OS/2 Warp ProgrammingKatheleen Panov, Larry Salomon Jr., Arthur Panov · 1995
Managing gigabytesI. H. Witten · 1994
Multidimensional databases and data warehousingChristian S. Jensen · 2010
New Perspectives Computer Concepts 2016 Enhanced, ComprehensiveJune Jamrich Parsons · 2016
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Data orientation Data orientation is the representation of tabular data in a linear memory model such as in-disk or in-memory. The two most common representations are column-ori…
- Patrick O'Neil Patrick Eugene O'Neil (1942 – September 20, 2019) was an American computer scientist, an expert on databases, and a professor of computer science at the…
- Sargable In relational databases, a condition (or predicate) in a query is said to be sargable if the DBMS engine can take advantage of an index to speed up the…
- Color Cell Compression Color Cell Compression is a lossy image compression algorithm developed by Campbell et al., in 1986, which can be considered an early forerunner of modern…
- MonetDB MonetDB is an open-source column-oriented relational database management system (RDBMS) originally developed at the Centrum Wiskunde & Informatica (CWI)…
- Streaming algorithm In computer science, streaming algorithms process input data streams as a sequence of items, typically making just one pass (or a few passes) through the…
- Log-structured merge-tree In computer science, the log-structured merge-tree (also known as LSM tree, or LSMT) is a data structure with performance characteristics that make it…
- Succinct data structure In computer science, a succinct data structure is a data structure which uses an amount of space that is "close" to the information-theoretic lower bound…