{"id":"https://openalex.org/W2771723090","doi":"https://doi.org/10.1145/3166072.3166073","title":"Early Termination Heuristics for Score-at-a-Time Index Traversal","display_name":"Early Termination Heuristics for Score-at-a-Time Index Traversal","publication_year":2017,"publication_date":"2017-12-07","ids":{"openalex":"https://openalex.org/W2771723090","doi":"https://doi.org/10.1145/3166072.3166073","mag":"2771723090"},"language":"en","primary_location":{"id":"doi:10.1145/3166072.3166073","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3166072.3166073","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 22nd Australasian Document Computing Symposium","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://figshare.com/articles/conference_contribution/Early_Termination_Heuristics_for_Score-at-a-Time_Index_Traversal/27403890","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5070739676","display_name":"Joel Mackenzie","orcid":"https://orcid.org/0000-0001-7992-4633"},"institutions":[{"id":"https://openalex.org/I82951845","display_name":"RMIT University","ror":"https://ror.org/04ttjf776","country_code":"AU","type":"education","lineage":["https://openalex.org/I82951845"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Joel Mackenzie","raw_affiliation_strings":["RMIT University, Melbourne, Australia"],"affiliations":[{"raw_affiliation_string":"RMIT University, Melbourne, Australia","institution_ids":["https://openalex.org/I82951845"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085925326","display_name":"Falk Scholer","orcid":"https://orcid.org/0000-0001-9094-0810"},"institutions":[{"id":"https://openalex.org/I82951845","display_name":"RMIT University","ror":"https://ror.org/04ttjf776","country_code":"AU","type":"education","lineage":["https://openalex.org/I82951845"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Falk Scholer","raw_affiliation_strings":["RMIT University, Melbourne, Australia"],"affiliations":[{"raw_affiliation_string":"RMIT University, Melbourne, Australia","institution_ids":["https://openalex.org/I82951845"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070937840","display_name":"J. Shane Culpepper","orcid":"https://orcid.org/0000-0002-1902-9087"},"institutions":[{"id":"https://openalex.org/I82951845","display_name":"RMIT University","ror":"https://ror.org/04ttjf776","country_code":"AU","type":"education","lineage":["https://openalex.org/I82951845"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"J. Shane Culpepper","raw_affiliation_strings":["RMIT University, Melbourne, Australia"],"affiliations":[{"raw_affiliation_string":"RMIT University, Melbourne, Australia","institution_ids":["https://openalex.org/I82951845"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5070739676"],"corresponding_institution_ids":["https://openalex.org/I82951845"],"apc_list":null,"apc_paid":null,"fwci":1.3158,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.84070744,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9997000098228455,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9997000098228455,"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/T11106","display_name":"Data Management and Algorithms","score":0.9997000098228455,"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/T11719","display_name":"Data Quality and Management","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.9818950891494751},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.856920599937439},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8246361017227173},{"id":"https://openalex.org/keywords/thread","display_name":"Thread (computing)","score":0.544853925704956},{"id":"https://openalex.org/keywords/multithreading","display_name":"Multithreading","score":0.5003771781921387},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.49011215567588806},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33517295122146606},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.251329243183136},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.14246755838394165},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.11139976978302002}],"concepts":[{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.9818950891494751},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.856920599937439},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8246361017227173},{"id":"https://openalex.org/C138101251","wikidata":"https://www.wikidata.org/wiki/Q213092","display_name":"Thread (computing)","level":2,"score":0.544853925704956},{"id":"https://openalex.org/C201410400","wikidata":"https://www.wikidata.org/wiki/Q1064412","display_name":"Multithreading","level":3,"score":0.5003771781921387},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.49011215567588806},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33517295122146606},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.251329243183136},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.14246755838394165},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.11139976978302002}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3166072.3166073","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3166072.3166073","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 22nd Australasian Document Computing Symposium","raw_type":"proceedings-article"},{"id":"pmh:oai:figshare.com:article/27403890","is_oa":true,"landing_page_url":"https://figshare.com/articles/conference_contribution/Early_Termination_Heuristics_for_Score-at-a-Time_Index_Traversal/27403890","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"}],"best_oa_location":{"id":"pmh:oai:figshare.com:article/27403890","is_oa":true,"landing_page_url":"https://figshare.com/articles/conference_contribution/Early_Termination_Heuristics_for_Score-at-a-Time_Index_Traversal/27403890","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W40096148","https://openalex.org/W1980344365","https://openalex.org/W1982063824","https://openalex.org/W1984918470","https://openalex.org/W1991360400","https://openalex.org/W1994915827","https://openalex.org/W1996930216","https://openalex.org/W2016078760","https://openalex.org/W2048955106","https://openalex.org/W2053448995","https://openalex.org/W2063094735","https://openalex.org/W2063694594","https://openalex.org/W2065472179","https://openalex.org/W2073965851","https://openalex.org/W2098674631","https://openalex.org/W2112508839","https://openalex.org/W2123006679","https://openalex.org/W2125203709","https://openalex.org/W2135050452","https://openalex.org/W2139230733","https://openalex.org/W2152628009","https://openalex.org/W2154610494","https://openalex.org/W2168006621","https://openalex.org/W2188152546","https://openalex.org/W2388783363","https://openalex.org/W2510609312","https://openalex.org/W2559503456","https://openalex.org/W2581544830","https://openalex.org/W2586017539","https://openalex.org/W2739751635","https://openalex.org/W2740342782","https://openalex.org/W2742124187","https://openalex.org/W4243218899"],"related_works":["https://openalex.org/W2115561485","https://openalex.org/W1985089255","https://openalex.org/W2010970156","https://openalex.org/W2153202644","https://openalex.org/W2105895556","https://openalex.org/W2733115356","https://openalex.org/W2377593213","https://openalex.org/W4235861380","https://openalex.org/W2106625514","https://openalex.org/W1993191611"],"abstract_inverted_index":{"Score-at-a-Time":[0,31],"index":[1],"traversal":[2,32,47],"is":[3],"a":[4,29,91],"query":[5],"processing":[6,85],"approach":[7],"which":[8,27,79],"supports":[9],"early":[10,60,72],"termination":[11,61,73],"in":[12],"order":[13],"to":[14,34],"balance":[15],"efficiency":[16,51],"and":[17,52,75],"effectiveness":[18,53],"trade-offs.":[19],"In":[20,63],"this":[21],"work,":[22],"we":[23,65],"explore":[24,66],"new":[25],"techniques":[26],"extend":[28],"modern":[30],"algorithm":[33],"allow":[35],"for":[36,70],"parallel":[37,46],"postings":[38],"traversal.":[39],"We":[40],"show":[41],"that":[42],"careful":[43],"integration":[44],"of":[45],"can":[48],"improve":[49],"both":[50],"when":[54],"compared":[55],"with":[56,89],"current":[57],"single":[58,92],"threaded":[59],"approaches.":[62],"addition,":[64],"the":[67],"various":[68],"trade-offs":[69],"differing":[71],"heuristics,":[74],"propose":[76],"hybrid":[77],"systems":[78],"parallelize":[80],"long":[81],"running":[82,87],"queries,":[83],"while":[84],"short":[86],"queries":[88],"only":[90],"thread.":[93]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}