{"id":"https://openalex.org/W2760310717","doi":"https://doi.org/10.1145/3121050.3121094","title":"Upper Bound Approximation for BlockMaxWand","display_name":"Upper Bound Approximation for BlockMaxWand","publication_year":2017,"publication_date":"2017-09-29","ids":{"openalex":"https://openalex.org/W2760310717","doi":"https://doi.org/10.1145/3121050.3121094","mag":"2760310717"},"language":"en","primary_location":{"id":"doi:10.1145/3121050.3121094","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3121050.3121094","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM SIGIR International Conference on Theory of Information Retrieval","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://openportal.isti.cnr.it/doc?id=people______::55d26c6dbcf999c31f630e9e48028b66","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5057643560","display_name":"Craig Macdonald","orcid":"https://orcid.org/0000-0003-3143-279X"},"institutions":[{"id":"https://openalex.org/I7882870","display_name":"University of Glasgow","ror":"https://ror.org/00vtgdb53","country_code":"GB","type":"education","lineage":["https://openalex.org/I7882870"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Craig Macdonald","raw_affiliation_strings":["University of Glasgow, Glasgow, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Glasgow, Glasgow, United Kingdom","institution_ids":["https://openalex.org/I7882870"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018894843","display_name":"Nicola Tonellotto","orcid":"https://orcid.org/0000-0002-7427-1001"},"institutions":[{"id":"https://openalex.org/I122991210","display_name":"Istituto di Scienza e Tecnologie dell'Informazione \"Alessandro Faedo\"","ror":"https://ror.org/05kacka20","country_code":"IT","type":"facility","lineage":["https://openalex.org/I122991210","https://openalex.org/I4210155236"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Nicola Tonellotto","raw_affiliation_strings":["ISTI-CNR, Pisa, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ISTI-CNR, Pisa, Italy","institution_ids":["https://openalex.org/I122991210"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"273","last_page":"276"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9990000128746033,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9990000128746033,"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"}},{"id":"https://openalex.org/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9980000257492065,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.8482149839401245},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.7180152535438538},{"id":"https://openalex.org/keywords/inverted-index","display_name":"Inverted index","score":0.6439107060432434},{"id":"https://openalex.org/keywords/weighting","display_name":"Weighting","score":0.6280823945999146},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.6122093796730042},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5928130149841309},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.5544713735580444},{"id":"https://openalex.org/keywords/index","display_name":"Index (typography)","score":0.5127192735671997},{"id":"https://openalex.org/keywords/search-engine","display_name":"Search engine","score":0.4318729043006897},{"id":"https://openalex.org/keywords/term","display_name":"Term (time)","score":0.4217016100883484},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4183313846588135},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4045090675354004},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39861607551574707},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3942699730396271},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3325377106666565},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.24021315574645996},{"id":"https://openalex.org/keywords/search-engine-indexing","display_name":"Search engine indexing","score":0.15411797165870667}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.8482149839401245},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.7180152535438538},{"id":"https://openalex.org/C130590232","wikidata":"https://www.wikidata.org/wiki/Q1671754","display_name":"Inverted index","level":3,"score":0.6439107060432434},{"id":"https://openalex.org/C183115368","wikidata":"https://www.wikidata.org/wiki/Q856577","display_name":"Weighting","level":2,"score":0.6280823945999146},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.6122093796730042},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5928130149841309},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.5544713735580444},{"id":"https://openalex.org/C2777382242","wikidata":"https://www.wikidata.org/wiki/Q6017816","display_name":"Index (typography)","level":2,"score":0.5127192735671997},{"id":"https://openalex.org/C97854310","wikidata":"https://www.wikidata.org/wiki/Q19541","display_name":"Search engine","level":2,"score":0.4318729043006897},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.4217016100883484},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4183313846588135},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4045090675354004},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39861607551574707},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3942699730396271},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3325377106666565},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.24021315574645996},{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.15411797165870667},{"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/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0},{"id":"https://openalex.org/C126838900","wikidata":"https://www.wikidata.org/wiki/Q77604","display_name":"Radiology","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/3121050.3121094","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3121050.3121094","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM SIGIR International Conference on Theory of Information Retrieval","raw_type":"proceedings-article"},{"id":"pmh:oai:eprints.gla.ac.uk:145572","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4210235606","display_name":"ENLIGHTEN (Jurnal Bimbingan dan Konseling Islam)","issn_l":"2622-8912","issn":["2622-8912","2622-8920"],"is_oa":false,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Conference Proceedings"},{"id":"pmh:oai:arpi.unipi.it:11568/1014173","is_oa":false,"landing_page_url":"http://hdl.handle.net/11568/1014173","pdf_url":null,"source":{"id":"https://openalex.org/S4377196265","display_name":"CINECA IRIS Institutial research information system (University of Pisa)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I108290504","host_organization_name":"University of Pisa","host_organization_lineage":["https://openalex.org/I108290504"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:dnet:people______::55d26c6dbcf999c31f630e9e48028b66","is_oa":true,"landing_page_url":"https://openportal.isti.cnr.it/doc?id=people______::55d26c6dbcf999c31f630e9e48028b66","pdf_url":null,"source":{"id":"https://openalex.org/S7407055261","display_name":"ISTI Open Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ICTIR 2017 - 3rd ACM International Conference on the Theory of Information Retrieval, pp. 273\u2013276, Amsterdam, The Netherlands, 1-4 October, 2017","raw_type":"http://purl.org/coar/resource_type/c_5794"}],"best_oa_location":{"id":"pmh:oai:dnet:people______::55d26c6dbcf999c31f630e9e48028b66","is_oa":true,"landing_page_url":"https://openportal.isti.cnr.it/doc?id=people______::55d26c6dbcf999c31f630e9e48028b66","pdf_url":null,"source":{"id":"https://openalex.org/S7407055261","display_name":"ISTI Open Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ICTIR 2017 - 3rd ACM International Conference on the Theory of Information Retrieval, pp. 273\u2013276, Amsterdam, The Netherlands, 1-4 October, 2017","raw_type":"http://purl.org/coar/resource_type/c_5794"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1980344365","https://openalex.org/W1987007212","https://openalex.org/W1994922945","https://openalex.org/W1997214779","https://openalex.org/W2032866865","https://openalex.org/W2063694594","https://openalex.org/W2134195052","https://openalex.org/W2134557008","https://openalex.org/W2154610494","https://openalex.org/W2586017539","https://openalex.org/W4243218899"],"related_works":["https://openalex.org/W2147422606","https://openalex.org/W2117332447","https://openalex.org/W3023238803","https://openalex.org/W2168596199","https://openalex.org/W2078251464","https://openalex.org/W3034912391","https://openalex.org/W2942018441","https://openalex.org/W4288365146","https://openalex.org/W2413339343","https://openalex.org/W2043150166"],"abstract_inverted_index":{"BlockMaxWand":[0],"is":[1],"a":[2,51,103],"recent":[3],"advance":[4],"on":[5,30,93,128],"the":[6,32,36,47,71,94],"Wand":[7,84,117,143],"dynamic":[8],"pruning":[9],"technique,":[10],"which":[11,77],"allows":[12],"efficient":[13,88],"retrieval":[14,89],"without":[15],"any":[16],"effectiveness":[17],"degradation":[18],"to":[19,154],"rank":[20],"K.":[21],"However,":[22],"while":[23],"BMW":[24,111,133],"uses":[25],"docid-sorted":[26],"indices,":[27],"it":[28],"relies":[29],"recording":[31],"upper":[33,120,129,136,146],"bound":[34],"of":[35,44,73,152],"term":[37],"weighting":[38],"model":[39],"scores":[40],"for":[41,83,90,150],"each":[42],"block":[43],"postings":[45],"in":[46,56,86,148],"inverted":[48],"index.":[49],"Such":[50],"requirement":[52],"can":[53,138],"be":[54,64],"disadvantageous":[55],"situations":[57],"such":[58],"as":[59],"when":[60,118],"an":[61],"index":[62],"must":[63],"updated.":[65],"In":[66],"this":[67],"work,":[68],"we":[69],"examine":[70],"appropriateness":[72],"upper-bound":[74],"approximation":[75],"--":[76,85],"have":[78],"previously":[79],"been":[80],"shown":[81],"suitable":[82],"providing":[87],"BMW.":[91],"Experiments":[92],"ClueWeb12":[95],"category":[96],"B13":[97],"corpus":[98],"using":[99],"5000":[100],"queries":[101,151],"from":[102],"real":[104],"search":[105],"engine's":[106],"query":[107],"log":[108],"demonstrate":[109],"that":[110],"still":[112],"provides":[113],"bene":[114],"ts":[115],"w.r.t.":[116,142],"approximate":[119,135],"bounds":[121,130,137],"are":[122,131],"used,":[123],"and":[124],"that,":[125],"if":[126],"approximations":[127],"tight,":[132],"with":[134,144],"provide":[139],"efficiency":[140],"gains":[141],"exact":[145],"bounds,":[147],"particular":[149],"short":[153],"medium":[155],"length.":[156]},"counts_by_year":[{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2017-10-06T00:00:00"}