{"id":"https://openalex.org/W2108277648","doi":"https://doi.org/10.1145/1099554.1099718","title":"Optimizing candidate check costs for bitmap indices","display_name":"Optimizing candidate check costs for bitmap indices","publication_year":2005,"publication_date":"2005-10-31","ids":{"openalex":"https://openalex.org/W2108277648","doi":"https://doi.org/10.1145/1099554.1099718","mag":"2108277648"},"language":"en","primary_location":{"id":"doi:10.1145/1099554.1099718","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1099554.1099718","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 14th ACM international conference on Information and knowledge management","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://escholarship.org/content/qt6vd813hf/qt6vd813hf.pdf?t=li5nwm","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5064469896","display_name":"Doron Rotem","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":"Doron Rotem","raw_affiliation_strings":["Lawrence Berkeley National Laboratory, University of California"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Lawrence Berkeley National Laboratory, University of California","institution_ids":["https://openalex.org/I148283060"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074825049","display_name":"Kurt Stockinger","orcid":"https://orcid.org/0000-0003-4034-4812"},"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":"Kurt Stockinger","raw_affiliation_strings":["Lawrence Berkeley National Laboratory, University of California"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Lawrence Berkeley National Laboratory, University of California","institution_ids":["https://openalex.org/I148283060"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043129695","display_name":"Kesheng Wu","orcid":"https://orcid.org/0000-0002-6907-3393"},"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, University of California"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Lawrence Berkeley National Laboratory, University of California","institution_ids":["https://openalex.org/I148283060"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.5363,"has_fulltext":true,"cited_by_count":46,"citation_normalized_percentile":{"value":0.95143571,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"648","last_page":"655"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9995999932289124,"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.9995999932289124,"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.9991999864578247,"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/T10215","display_name":"Semantic Web and Ontologies","score":0.9829000234603882,"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/bitmap","display_name":"Bitmap","score":0.8891462087631226},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7863330841064453},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.724015474319458},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6313368678092957},{"id":"https://openalex.org/keywords/index","display_name":"Index (typography)","score":0.5809558033943176},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.5676279067993164},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.4476088583469391},{"id":"https://openalex.org/keywords/result-set","display_name":"Result set","score":0.42178115248680115},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.38563674688339233},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.18650966882705688},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12845119833946228},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09206470847129822}],"concepts":[{"id":"https://openalex.org/C3115412","wikidata":"https://www.wikidata.org/wiki/Q1194708","display_name":"Bitmap","level":2,"score":0.8891462087631226},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7863330841064453},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.724015474319458},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6313368678092957},{"id":"https://openalex.org/C2777382242","wikidata":"https://www.wikidata.org/wiki/Q6017816","display_name":"Index (typography)","level":2,"score":0.5809558033943176},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.5676279067993164},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.4476088583469391},{"id":"https://openalex.org/C4969071","wikidata":"https://www.wikidata.org/wiki/Q7316353","display_name":"Result set","level":3,"score":0.42178115248680115},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.38563674688339233},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.18650966882705688},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12845119833946228},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09206470847129822},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/1099554.1099718","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1099554.1099718","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 14th ACM international conference on Information and knowledge management","raw_type":"proceedings-article"},{"id":"pmh:oai:escholarship.org/ark:/13030/qt6vd813hf","is_oa":true,"landing_page_url":"https://escholarship.org/uc/item/6vd813hf","pdf_url":"https://escholarship.org/content/qt6vd813hf/qt6vd813hf.pdf?t=li5nwm","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:info:ark/67531/metadc876947","is_oa":false,"landing_page_url":"https://digital.library.unt.edu/ark:/67531/metadc876947/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400792","display_name":"University of North Texas Digital Library (University of North Texas)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I123534392","host_organization_name":"University of North Texas","host_organization_lineage":["https://openalex.org/I123534392"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"The ACM Conference on Information and KnowledgeManagement (CIKM), Bremen, Germany, 31st October - 5th November,2005","raw_type":"Article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.60.7239","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.60.7239","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://sdm.lbl.gov/kurts/research/cikm2005-opt-binning.pdf","raw_type":"text"},{"id":"pmh:qt6vd813hf","is_oa":false,"landing_page_url":"http://www.escholarship.org/uc/item/6vd813hf","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":"Rotem, Doron; Stockinger, Kurt; &amp; Wu, Kesheng. (2005). Optimizing Candidate Check Costs for Bitmap Indices. Lawrence Berkeley National Laboratory. Lawrence Berkeley National Laboratory: Lawrence Berkeley National Laboratory. Retrieved from: http://www.escholarship.org/uc/item/6vd813hf","raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:escholarship.org/ark:/13030/qt6vd813hf","is_oa":true,"landing_page_url":"https://escholarship.org/uc/item/6vd813hf","pdf_url":"https://escholarship.org/content/qt6vd813hf/qt6vd813hf.pdf?t=li5nwm","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"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2108277648.pdf","grobid_xml":"https://content.openalex.org/works/W2108277648.grobid-xml"},"referenced_works_count":27,"referenced_works":["https://openalex.org/W199677694","https://openalex.org/W1501548698","https://openalex.org/W1527137792","https://openalex.org/W1553457043","https://openalex.org/W1561200998","https://openalex.org/W1575326507","https://openalex.org/W1576757369","https://openalex.org/W1704989917","https://openalex.org/W1964482959","https://openalex.org/W2006148350","https://openalex.org/W2008931591","https://openalex.org/W2072764742","https://openalex.org/W2085189503","https://openalex.org/W2096703709","https://openalex.org/W2111967617","https://openalex.org/W2117156932","https://openalex.org/W2117716920","https://openalex.org/W2171669671","https://openalex.org/W2341171179","https://openalex.org/W2603863857","https://openalex.org/W3142473493","https://openalex.org/W4206835082","https://openalex.org/W4245777329","https://openalex.org/W6633644953","https://openalex.org/W6637500425","https://openalex.org/W6677729785","https://openalex.org/W6704298589"],"related_works":["https://openalex.org/W2111883592","https://openalex.org/W1521353230","https://openalex.org/W2614201973","https://openalex.org/W1885345228","https://openalex.org/W2162405754","https://openalex.org/W1596397513","https://openalex.org/W4280566261","https://openalex.org/W2371443866","https://openalex.org/W2394099118","https://openalex.org/W2108277648"],"abstract_inverted_index":{"In":[0],"this":[1,49,90],"paper,":[2],"we":[3,109],"propose":[4],"a":[5,30,43,104,179],"new":[6],"strategy":[7],"for":[8],"optimizing":[9],"the":[10,17,37,74,85,92,98,113,119,124,138,151,174,184],"placement":[11],"of":[12,19,33,51,73,106,162,181],"bin":[13,125,139,171],"boundaries":[14,172],"to":[15,57,70,77,111,117,164],"minimize":[16,112],"cost":[18],"query":[20,100,186],"evaluation":[21],"using":[22,168],"bitmap":[23,44],"indices":[24],"with":[25,29,46,145],"binning.":[26,47],"For":[27,156],"attributes":[28],"large":[31],"number":[32],"distinct":[34],"values,":[35],"often":[36],"most":[38],"efficient":[39],"index":[40,45,52],"scheme":[41],"is":[42],"However,":[48],"type":[50],"may":[53],"not":[54],"be":[55],"able":[56],"fully":[58,64],"resolve":[59,65],"some":[60,146],"user":[61,107,148],"queries.":[62],"To":[63],"these":[66],"queries,":[67,108],"one":[68],"has":[69],"access":[71],"parts":[72],"original":[75],"data":[76],"check":[78,176],"whether":[79],"certain":[80],"candidate":[81,93,166,175],"records":[82],"actually":[83],"satisfy":[84],"specified":[86],"conditions.":[87],"We":[88,127,141],"call":[89],"procedure":[91],"check,":[94,167],"which":[95],"usually":[96],"dominates":[97],"total":[99,114,185],"processing":[101,187],"time.":[102],"Given":[103],"set":[105],"seek":[110],"time":[115,163,177,188],"required":[116],"an-swer":[118],"queries":[120,149,157],"by":[121,178,189],"optimally":[122],"placing":[123],"boundaries.":[126,140],"show":[128],"that":[129,158],"our":[130,143,169],"dynamic":[131],"programming":[132],"based":[133],"algorithm":[134],"can":[135],"efficiently":[136],"determine":[137],"verify":[142],"analysis":[144],"real":[147],"from":[150],"Sloan":[152],"Digital":[153],"Sky":[154],"Survey.":[155],"require":[159],"significant":[160],"amount":[161],"perform":[165],"optimal":[170],"reduces":[173],"factor":[180],"2":[182],"and":[183],"40%.":[190]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":4}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}
