{"id":"https://openalex.org/W2116400826","doi":"https://doi.org/10.1145/1011767.1011798","title":"Efficient top-K query calculation in distributed networks","display_name":"Efficient top-K query calculation in distributed networks","publication_year":2004,"publication_date":"2004-07-25","ids":{"openalex":"https://openalex.org/W2116400826","doi":"https://doi.org/10.1145/1011767.1011798","mag":"2116400826"},"language":"en","primary_location":{"id":"doi:10.1145/1011767.1011798","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1011767.1011798","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing","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/A5057942346","display_name":"Pei Cao","orcid":"https://orcid.org/0000-0003-4768-4844"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Pei Cao","raw_affiliation_strings":["Stanford University, Stanford, CA"],"affiliations":[{"raw_affiliation_string":"Stanford University, Stanford, CA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100407628","display_name":"Zhe Wang","orcid":"https://orcid.org/0000-0002-6825-1063"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zhe Wang","raw_affiliation_strings":["Princeton University, Princeton, NJ"],"affiliations":[{"raw_affiliation_string":"Princeton University, Princeton, NJ","institution_ids":["https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5057942346"],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":14.2846,"has_fulltext":false,"cited_by_count":254,"citation_normalized_percentile":{"value":0.99352413,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"206","last_page":"215"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998999834060669,"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.9998999834060669,"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.9969000220298767,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9937999844551086,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7787479162216187},{"id":"https://openalex.org/keywords/query-optimization","display_name":"Query optimization","score":0.5485216379165649},{"id":"https://openalex.org/keywords/sargable","display_name":"Sargable","score":0.43721961975097656},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.32380157709121704},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.2814295291900635},{"id":"https://openalex.org/keywords/web-search-query","display_name":"Web search query","score":0.2632034420967102},{"id":"https://openalex.org/keywords/search-engine","display_name":"Search engine","score":0.16000857949256897}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7787479162216187},{"id":"https://openalex.org/C157692150","wikidata":"https://www.wikidata.org/wiki/Q2919848","display_name":"Query optimization","level":2,"score":0.5485216379165649},{"id":"https://openalex.org/C192939062","wikidata":"https://www.wikidata.org/wiki/Q104840822","display_name":"Sargable","level":4,"score":0.43721961975097656},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.32380157709121704},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.2814295291900635},{"id":"https://openalex.org/C164120249","wikidata":"https://www.wikidata.org/wiki/Q995982","display_name":"Web search query","level":3,"score":0.2632034420967102},{"id":"https://openalex.org/C97854310","wikidata":"https://www.wikidata.org/wiki/Q19541","display_name":"Search engine","level":2,"score":0.16000857949256897}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1011767.1011798","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1011767.1011798","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.83.8731","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.83.8731","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://crypto.stanford.edu/~cao/topk.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.85.546","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.85.546","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://134.208.3.165/ETWang/seminarfile/2005/0505Efficient top-K query calculation in distributed networks.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1488719427","https://openalex.org/W1977141583","https://openalex.org/W2003262311","https://openalex.org/W2020919487","https://openalex.org/W2023797161","https://openalex.org/W2086174602","https://openalex.org/W2099797738","https://openalex.org/W2112053513","https://openalex.org/W2134206624","https://openalex.org/W2141649964","https://openalex.org/W2156632255","https://openalex.org/W2164520297","https://openalex.org/W2666600683","https://openalex.org/W4255868445"],"related_works":["https://openalex.org/W2006459955","https://openalex.org/W2955368753","https://openalex.org/W3125756434","https://openalex.org/W2184296057","https://openalex.org/W2096359267","https://openalex.org/W203907944","https://openalex.org/W4386051213","https://openalex.org/W2992414350","https://openalex.org/W1819934925","https://openalex.org/W185198413"],"abstract_inverted_index":{"This":[0],"paper":[1,76],"presents":[2,77],"a":[3,21,48,123,140,148],"new":[4,49],"algorithm":[5,50],"to":[6,102,108,115,164],"answer":[7],"top-k":[8],"queries":[9],"(e.g.":[10],"\u201cfind":[11],"the":[12,16,28,39,91,94,127,157],"k":[13],"objects":[14],"with":[15],"highest":[17],"aggregate":[18],"values\u201d)":[19],"in":[20,68,131,151],"distributed":[22],"network.":[23],"Existing":[24],"algorithms":[25],"such":[26],"as":[27],"Threshold":[29],"Algorithm":[30],"[FLN01]":[31],"consume":[32],"an":[33],"excessive":[34],"amount":[35],"of":[36,41,72,80,93,105,129],"bandwidth":[37,59],"when":[38],"number":[40],"nodes,":[42],"m,":[43],"is":[44,113],"high.":[45],"We":[46],"propose":[47],"called":[51],"\u201cThree-Phase":[52],"Uniform":[53],"Threshold\u201d":[54],"(TPUT).":[55],"TPUT":[56,96,112,146],"reduces":[57,97],"network":[58,98,152],"consumption":[60],"by":[61,100,138],"pruning":[62,141],"away":[63],"ineligible":[64],"objects,":[65],"and":[66],"terminates":[67],"three":[69],"round-trips":[70],"regardless":[71],"data":[73,119,170],"input.":[74],"The":[75],"two":[78,103],"sets":[79],"results":[81],"about":[82],"TPUT.":[83],"First,":[84],"trace-driven":[85],"simulations":[86],"show":[87],"that,":[88],"depending":[89],"on":[90,118,126],"size":[92],"network,":[95],"traffic":[99],"one":[101],"orders":[104],"magnitude":[106],"compared":[107],"existing":[109],"algorithms.":[110],"Second,":[111],"proven":[114],"be":[116],"instance-optimal":[117],"series":[120,171],"that":[121,137],"satisfy":[122],"lower":[124],"bound":[125],"slope":[128],"decreases":[130],"values.":[132],"In":[133],"particular,":[134],"analysis":[135],"shows":[136],"using":[139],"parameter":[142],"\u03b1":[143],"<":[144],"1,":[145],"achieves":[147],"qualitative":[149],"reduction":[150],"traffic,":[153],"for":[154,169],"example,":[155],"lowering":[156],"optimality":[158],"ratio":[159],"from":[160],"O(m":[161,165],"\u2217":[162,166],"m)":[163,168],"\u221a":[167],"following":[172],"Zipf":[173],"distribution.":[174],"1":[175]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":12},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":12},{"year":2016,"cited_by_count":13},{"year":2015,"cited_by_count":17},{"year":2014,"cited_by_count":21},{"year":2013,"cited_by_count":15},{"year":2012,"cited_by_count":20}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}