Bitmap Indexing
Bitmap Indexing is a database indexing technique that represents the presence or absence of distinct attribute values in a relational table through bit vectors, enabling efficient set-oriented operations for query processing in online analytical processing environments.
136
Publications
9.7K
Citations
297
Authors
125
Institutions
Publications per year
2017–2026
12
Parents
136
Sequential PAttern mining using a bitmap representation
Jay Ayres, Jason Flannick, Johannes Gehrke et al. · 2002 · 1.1K citations
C-store: a column-oriented DBMS
Mike Stonebraker, Daniel J. Abadi, Adam Batkin et al. · 2005 · 928 citations
Improved query performance with variant indexes
Patrick E. O׳Neil, Dallan Quass · 1997 · 484 citations
Vivek Seshadri, Donghyuk Lee, Thomas Mullins et al. · 2017 · 428 citations
1–5 of 136
297
16
h-index
10
h-index
European Organization for Nuclear Research, Switzerland
10 publications · 435 citations
10
h-index
6
h-index
6
h-index
1–5 of 297
125

Lawrence Berkeley National Laboratory
Berkeley, United States
16 h-index
59 publications
3.9K citations
The Ohio State University
Columbus, United States
11 h-index
29 publications
834 citations
Université du Québec à Montréal
Montreal, Canada
7 h-index
11 publications
621 citations
University of Massachusetts Boston
Boston, United States
6 h-index
12 publications
3.6K citations
University of Wisconsin–Madison
Madison, United States
5 h-index
12 publications
1.4K citations
Microsoft (United States)
Redmond, United States
5 h-index
6 publications
662 citations

Cornell University
Ithaca, United States
5 h-index
15 publications
7K citations
University of New Brunswick
Fredericton, Canada
5 h-index
5 publications
248 citations
1–8 of 125
7 publications · 760 citations
7
h-index
4 publications · 277 citations
4
h-index
TODS · 4 publications · 508 citations
4
h-index
TKDE · 3 publications · 59 citations
3
h-index
TOG · 2 publications · 162 citations
2
h-index
1–5