{"id":"https://openalex.org/W2161971058","doi":"https://doi.org/10.1109/icdew.2008.4498379","title":"A general and efficient algorithm for “top” queries","display_name":"A general and efficient algorithm for “top” queries","publication_year":2008,"publication_date":"2008-04-01","ids":{"openalex":"https://openalex.org/W2161971058","doi":"https://doi.org/10.1109/icdew.2008.4498379","mag":"2161971058"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/icdew.2008.4498379","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-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/A5041862671","display_name":"Goetz Graefe","orcid":"https://orcid.org/0000-0003-0194-6466"},"institutions":[{"id":"https://openalex.org/I1324840837","display_name":"Hewlett-Packard (United States)","ror":"https://ror.org/059rn9488","country_code":"US","type":"funder","lineage":["https://openalex.org/I1324840837"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Goetz Graefe","raw_affiliation_strings":["Hewlett Packard Laboratories, Palo Alto, CA, USA"],"affiliations":[{"raw_affiliation_string":"Hewlett Packard Laboratories, Palo Alto, CA, USA","institution_ids":["https://openalex.org/I1324840837"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5041862671"],"corresponding_institution_ids":["https://openalex.org/I1324840837"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":1,"citation_normalized_percentile":{"value":0.210665,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":63,"max":70},"biblio":{"volume":null,"issue":null,"first_page":"548","last_page":"555"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":1.0,"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":1.0,"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.9999,"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.9985,"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/merge-sort","display_name":"Merge sort","score":0.7771405},{"id":"https://openalex.org/keywords/merge","display_name":"Merge (version control)","score":0.74441564},{"id":"https://openalex.org/keywords/merge-algorithm","display_name":"Merge algorithm","score":0.5173654}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8140383},{"id":"https://openalex.org/C35555965","wikidata":"https://www.wikidata.org/wiki/Q189057","display_name":"Merge sort","level":4,"score":0.7771405},{"id":"https://openalex.org/C197129107","wikidata":"https://www.wikidata.org/wiki/Q1921621","display_name":"Merge (version control)","level":2,"score":0.74441564},{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.6602154},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5828644},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.53925925},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.5235419},{"id":"https://openalex.org/C140086265","wikidata":"https://www.wikidata.org/wiki/Q11341754","display_name":"Merge algorithm","level":4,"score":0.5173654},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3806106},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.27111864},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.22947806},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.109086215}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/icdew.2008.4498379","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":8,"referenced_works":["https://openalex.org/W106849758","https://openalex.org/W1495105959","https://openalex.org/W1974796034","https://openalex.org/W2020191321","https://openalex.org/W2110160586","https://openalex.org/W2133900260","https://openalex.org/W2148322068","https://openalex.org/W2158237121"],"related_works":["https://openalex.org/W3038595913","https://openalex.org/W2977813765","https://openalex.org/W2356015003","https://openalex.org/W2165167056","https://openalex.org/W2102143009","https://openalex.org/W2074050947","https://openalex.org/W1997715509","https://openalex.org/W1989067202","https://openalex.org/W1852882392","https://openalex.org/W1822668896"],"abstract_inverted_index":{"\"Top":[0],"K\"":[1],"queries":[2],"reduce":[3,72],"a":[4,31,51],"query":[5],"result":[6,22],"to":[7,27,62,68,77],"the":[8,12,21,38,73],"most":[9,13],"interesting":[10],"or":[11],"urgent":[14],"items.":[15],"In":[16],"many":[17],"cases,":[18],"e.g.,":[19],"when":[20],"size":[23],"is":[24,50],"unbounded":[25],"due":[26],"duplicate":[28],"key":[29],"values,":[30],"\"top\"":[32,63],"operation":[33],"cannot":[34],"be":[35],"implemented":[36],"using":[37],"standard":[39],"algorithm":[40],"based":[41],"on":[42,79],"an":[43],"in-memory":[44],"priority":[45],"queue.":[46],"The":[47],"default":[48],"alternative":[49],"full":[52],"sort.":[53],"External":[54],"merge":[55],"sort":[56],"admits":[57],"multiple":[58],"novel":[59],"optimizations":[60],"specific":[61],"operations.":[64],"These":[65],"are":[66],"simple":[67],"implement":[69],"yet":[70],"greatly":[71],"data":[74],"volume":[75],"written":[76],"runs":[78],"temporary":[80],"storage.":[81],"Experiments":[82],"demonstrate":[83],"substantial":[84],"performance":[85],"improvements,":[86],"in":[87],"one":[88],"case":[89],"exceeding":[90],"three":[91],"orders":[92],"of":[93],"magnitude.":[94]},"abstract_inverted_index_v3":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2161971058","counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2025-04-17T21:42:46.659038","created_date":"2016-06-24"}