{"id":"https://openalex.org/W303945963","doi":"https://doi.org/10.1145/1645953.1646083","title":"Efficient joins with compressed bitmap indexes","display_name":"Efficient joins with compressed bitmap indexes","publication_year":2009,"publication_date":"2009-11-02","ids":{"openalex":"https://openalex.org/W303945963","doi":"https://doi.org/10.1145/1645953.1646083","mag":"303945963"},"language":"en","primary_location":{"id":"doi:10.1145/1645953.1646083","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1645953.1646083","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 18th ACM conference on Information and knowledge management","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5057403059","display_name":"Kamesh Madduri","orcid":"https://orcid.org/0000-0003-4344-0957"},"institutions":[{"id":"https://openalex.org/I148283060","display_name":"Lawrence Berkeley National Laboratory","ror":"https://ror.org/02jbv0t02","country_code":"US","type":"facility","lineage":["https://openalex.org/I1330989302","https://openalex.org/I148283060","https://openalex.org/I39565521"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Kamesh Madduri","raw_affiliation_strings":["Lawrence Berkeley National Laboratory, Berkeley, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Lawrence Berkeley National Laboratory, Berkeley, CA, USA","institution_ids":["https://openalex.org/I148283060"]}]},{"author_position":"last","author":{"id":null,"display_name":"Kesheng Wu","orcid":null},"institutions":[{"id":"https://openalex.org/I148283060","display_name":"Lawrence Berkeley National Laboratory","ror":"https://ror.org/02jbv0t02","country_code":"US","type":"facility","lineage":["https://openalex.org/I1330989302","https://openalex.org/I148283060","https://openalex.org/I39565521"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kesheng Wu","raw_affiliation_strings":["Lawrence Berkeley National Laboratory, Berkeley, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Lawrence Berkeley National Laboratory, Berkeley, CA, USA","institution_ids":["https://openalex.org/I148283060"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5057403059"],"corresponding_institution_ids":["https://openalex.org/I148283060"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1017","last_page":"1026"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9950000047683716,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/joins","display_name":"Joins","score":0.8029701709747314},{"id":"https://openalex.org/keywords/tuple","display_name":"Tuple","score":0.7444250583648682},{"id":"https://openalex.org/keywords/bitmap","display_name":"Bitmap","score":0.724092423915863},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6625956296920776},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.6178326606750488},{"id":"https://openalex.org/keywords/hash-join","display_name":"Hash join","score":0.5094295144081116},{"id":"https://openalex.org/keywords/join","display_name":"Join (topology)","score":0.49480360746383667},{"id":"https://openalex.org/keywords/sort-merge-join","display_name":"Sort-merge join","score":0.4560719132423401},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41121572256088257},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.335304319858551},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29225945472717285},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.27451279759407043},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.1566576063632965},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.09510624408721924}],"concepts":[{"id":"https://openalex.org/C2778692605","wikidata":"https://www.wikidata.org/wiki/Q4041866","display_name":"Joins","level":2,"score":0.8029701709747314},{"id":"https://openalex.org/C118930307","wikidata":"https://www.wikidata.org/wiki/Q600590","display_name":"Tuple","level":2,"score":0.7444250583648682},{"id":"https://openalex.org/C3115412","wikidata":"https://www.wikidata.org/wiki/Q1194708","display_name":"Bitmap","level":2,"score":0.724092423915863},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6625956296920776},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.6178326606750488},{"id":"https://openalex.org/C188805328","wikidata":"https://www.wikidata.org/wiki/Q4060691","display_name":"Hash join","level":3,"score":0.5094295144081116},{"id":"https://openalex.org/C2776124973","wikidata":"https://www.wikidata.org/wiki/Q3183033","display_name":"Join (topology)","level":2,"score":0.49480360746383667},{"id":"https://openalex.org/C203570394","wikidata":"https://www.wikidata.org/wiki/Q4060688","display_name":"Sort-merge join","level":3,"score":0.4560719132423401},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41121572256088257},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.335304319858551},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29225945472717285},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.27451279759407043},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.1566576063632965},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.09510624408721924},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/1645953.1646083","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1645953.1646083","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 18th ACM conference on Information and knowledge management","raw_type":"proceedings-article"},{"id":"pmh:oai:escholarship.org/ark:/13030/qt3552s050","is_oa":false,"landing_page_url":"https://escholarship.org/uc/item/3552s050","pdf_url":null,"source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"article"},{"id":"pmh:qt3552s050","is_oa":false,"landing_page_url":"http://www.escholarship.org/uc/item/3552s050","pdf_url":null,"source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Madduri, Kamesh. (2010). Efficient Joins with Compressed Bitmap Indexes. Lawrence Berkeley National Laboratory. Lawrence Berkeley National Laboratory: Lawrence Berkeley National Laboratory. Retrieved from: http://www.escholarship.org/uc/item/3552s050","raw_type":"article"},{"id":"mag:303945963","is_oa":false,"landing_page_url":"https://escholarship.org/uc/item/3552s050.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S2764971142","display_name":"Lawrence Berkeley National Laboratory","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4320800592","host_organization_name":"United States Department of Energy","host_organization_lineage":["https://openalex.org/P4320800592"],"host_organization_lineage_names":["United States Department of Energy"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Lawrence Berkeley National Laboratory","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1516506771","https://openalex.org/W2006148350","https://openalex.org/W2015372451","https://openalex.org/W2117156932","https://openalex.org/W2136625956","https://openalex.org/W2140646908","https://openalex.org/W2156914755","https://openalex.org/W3002580249","https://openalex.org/W4246501542","https://openalex.org/W4252446498"],"related_works":["https://openalex.org/W2060892115","https://openalex.org/W2162941388","https://openalex.org/W1963817532","https://openalex.org/W2165420164","https://openalex.org/W2142669732","https://openalex.org/W2171669671","https://openalex.org/W1877188183","https://openalex.org/W2118491900","https://openalex.org/W2808587155","https://openalex.org/W1908699674","https://openalex.org/W2080461640","https://openalex.org/W2262699453","https://openalex.org/W2013520691","https://openalex.org/W1782779911","https://openalex.org/W1546993490","https://openalex.org/W2575701790","https://openalex.org/W2133639780","https://openalex.org/W2980013140","https://openalex.org/W2925517194","https://openalex.org/W3094986244"],"abstract_inverted_index":{"We":[0,25,130,200],"present":[1,131],"a":[2,32,37,132,160],"new":[3],"class":[4],"of":[5,17,42,48,51,60,85,99,110,115,124,135,162,176,210,220,226],"adaptive":[6],"algorithms":[7],"that":[8],"use":[9,66],"compressed":[10,67,211],"bitmap":[11,186,212],"indexes":[12,213],"to":[13,30,56,69,173],"speed":[14],"up":[15,172],"evaluation":[16],"the":[18,27,43,49,54,57,71,75,80,83,97,103,108,113,116,122,125,180,193,221],"range":[19,161],"join":[20,33,44,72,84,163,215],"query":[21,34,198],"in":[22,53,102,112],"relational":[23],"databases.":[24],"determine":[26],"best":[28,185],"strategy":[29],"process":[31],"based":[35],"on":[36,143],"fast":[38],"sub-linear":[39],"time":[40],"computation":[41],"selectivity":[45,164],"(the":[46],"ratio":[47],"number":[50,59,98,109],"tuples":[52,81,111],"result":[55,104],"total":[58],"possible":[61],"tuples).":[62],"In":[63],"addition,":[64],"we":[65],"bitmaps":[68],"represent":[70],"output":[73],"compactly:":[74],"space":[76],"requirement":[77],"for":[78,159,196,214],"storing":[79],"representing":[82],"two":[86,117],"relations":[87],"is":[88,96,107,121,171,189],"asymptotically":[89],"bounded":[90],"by":[91,204],"min(h;":[92],"n.cb),":[93],"where":[94],"h":[95],"tuple":[100],"pairs":[101],"relation,":[105],"n":[106],"smaller":[114],"relations,":[118],"and":[119,146,154,183,224],"cb":[120],"cardinality":[123],"larger":[126],"column":[127],"being":[128],"joined.":[129],"theoretical":[133],"analysis":[134],"our":[136,168,184],"algorithms,":[137],"as":[138,140],"well":[139],"experimental":[141],"results":[142],"large-scale":[144],"synthetic":[145],"real":[147],"data":[148],"sets.":[149],"Our":[150],"implementations":[151],"are":[152],"efficient,":[153],"consistently":[155],"outperform":[156],"well-known":[157],"approaches":[158],"factors.":[165],"For":[166],"instance,":[167],"count-only":[169],"algorithm":[170,188],"three":[174],"orders":[175],"magnitude":[177],"faster":[178,191],"than":[179,192],"sort-merge":[181,194],"approach,":[182],"index-based":[187],"1.2x-80x":[190],"algorithm,":[195],"various":[197],"instances.":[199],"achieve":[201],"these":[202],"speedups":[203],"exploiting":[205],"several":[206],"inherent":[207],"performance":[208],"advantages":[209],"processing:":[216],"an":[217],"implicit":[218],"partitioning":[219],"attributes,":[222],"space-efficiency,":[223],"tolerance":[225],"high-cardinality":[227],"relations.":[228]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}