{"id":"https://openalex.org/W2142521817","doi":"https://doi.org/10.1145/1316902.1316912","title":"Load balancing distributed inverted files","display_name":"Load balancing distributed inverted files","publication_year":2007,"publication_date":"2007-11-09","ids":{"openalex":"https://openalex.org/W2142521817","doi":"https://doi.org/10.1145/1316902.1316912","mag":"2142521817"},"language":"en","primary_location":{"id":"doi:10.1145/1316902.1316912","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1316902.1316912","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 9th annual ACM international workshop on Web information and data management","raw_type":"proceedings-article"},"type":"article","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/A5044981704","display_name":"Mauricio Mar\u0131\u0301n","orcid":"https://orcid.org/0000-0003-0662-7149"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Mauricio Marin","raw_affiliation_strings":["Yahoo! Research, Santiago, Chile"],"affiliations":[{"raw_affiliation_string":"Yahoo! Research, Santiago, Chile","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002414096","display_name":"Carlos E. G\u00f3mez","orcid":"https://orcid.org/0000-0002-5202-1167"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Carlos Gomez","raw_affiliation_strings":["Yahoo! Research, Santiago, Chile"],"affiliations":[{"raw_affiliation_string":"Yahoo! Research, Santiago, Chile","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5044981704"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.9253,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.87700816,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"57","last_page":"64"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9995999932289124,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9984999895095825,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/computer-science","display_name":"Computer science","score":0.8764758110046387},{"id":"https://openalex.org/keywords/load-balancing","display_name":"Load balancing (electrical power)","score":0.7275319695472717},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.718246579170227},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.6026077270507812},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5533657670021057},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5162920355796814},{"id":"https://openalex.org/keywords/search-engine","display_name":"Search engine","score":0.47163984179496765},{"id":"https://openalex.org/keywords/execution-time","display_name":"Execution time","score":0.4712522327899933},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3882351815700531},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.1509423553943634},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.13270685076713562},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.11910852789878845}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8764758110046387},{"id":"https://openalex.org/C138959212","wikidata":"https://www.wikidata.org/wiki/Q1806783","display_name":"Load balancing (electrical power)","level":3,"score":0.7275319695472717},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.718246579170227},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.6026077270507812},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5533657670021057},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5162920355796814},{"id":"https://openalex.org/C97854310","wikidata":"https://www.wikidata.org/wiki/Q19541","display_name":"Search engine","level":2,"score":0.47163984179496765},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.4712522327899933},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3882351815700531},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.1509423553943634},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.13270685076713562},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.11910852789878845},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1316902.1316912","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1316902.1316912","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 9th annual ACM international workshop on Web information and data management","raw_type":"proceedings-article"}],"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/W1580948603","https://openalex.org/W1973797056","https://openalex.org/W1977838253","https://openalex.org/W2043862089","https://openalex.org/W2045271686","https://openalex.org/W2063435439","https://openalex.org/W2076655037","https://openalex.org/W2104680817","https://openalex.org/W2138662031","https://openalex.org/W2611804663"],"related_works":["https://openalex.org/W2280422768","https://openalex.org/W3143197806","https://openalex.org/W4252555497","https://openalex.org/W3121175838","https://openalex.org/W3016293053","https://openalex.org/W1690653314","https://openalex.org/W2401723157","https://openalex.org/W2065055572","https://openalex.org/W2784269775","https://openalex.org/W2952904874"],"abstract_inverted_index":{"This":[0,90],"paper":[1],"present":[2],"a":[3,24,34,81,102],"comparison":[4],"of":[5,12,26,41,80,96,157],"scheduling":[6],"algorithms":[7,27,47],"applied":[8],"to":[9,37,51,70,135,149],"the":[10,15,30,39,62,78,86,98,108,120,127,154],"context":[11],"load":[13,59,129],"balancing":[14,130],"query":[16,42,122],"traffic":[17],"on":[18,77],"distributed":[19],"inverted":[20],"files.":[21],"We":[22,32,56,124],"implemented":[23],"number":[25],"taken":[28],"from":[29],"literature.":[31],"propose":[33],"novel":[35],"method":[36,74,140],"formulate":[38],"cost":[40],"processing":[43,97],"so":[44],"that":[45,126],"these":[46],"can":[48,68,113,141],"be":[49,142],"used":[50,143],"schedule":[52,150],"queries":[53,99,151],"onto":[54,153],"processors.":[55],"avoid":[57],"measuring":[58],"balance":[60],"at":[61,85],"search":[63,111,158],"engine":[64,112],"side":[65],"because":[66],"this":[67],"lead":[69],"imprecise":[71],"evaluation.":[72],"Our":[73,139],"is":[75],"based":[76],"simulation":[79,91],"bulk-synchronous":[82],"parallel":[83],"computer":[84],"broker":[87,109,147],"machine":[88],"side.":[89],"determines":[92],"an":[93],"optimal":[94],"way":[95],"and":[100,110],"provides":[101],"stable":[103],"baseline":[104],"upon":[105],"which":[106],"both":[107],"tune":[114],"their":[115],"operation":[116],"in":[117,144],"accordance":[118],"with":[119],"observed":[121],"traffic.":[123],"conclude":[125],"simplest":[128],"heuristics":[131],"are":[132],"good":[133],"enough":[134],"achieve":[136],"efficient":[137],"performance.":[138],"practice":[145],"by":[146],"machines":[148],"efficiently":[152],"cluster":[155],"processors":[156],"engines.":[159]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}