{"id":"https://openalex.org/W2150551589","doi":"https://doi.org/10.4304/jcp.9.9.2000-2006","title":"Efficient Top-k Query Processing Algorithms in Highly Distributed Environments","display_name":"Efficient Top-k Query Processing Algorithms in Highly Distributed Environments","publication_year":2014,"publication_date":"2014-08-15","ids":{"openalex":"https://openalex.org/W2150551589","doi":"https://doi.org/10.4304/jcp.9.9.2000-2006","mag":"2150551589"},"language":"en","primary_location":{"id":"doi:10.4304/jcp.9.9.2000-2006","is_oa":false,"landing_page_url":"https://doi.org/10.4304/jcp.9.9.2000-2006","pdf_url":null,"source":{"id":"https://openalex.org/S77894049","display_name":"Journal of Computers","issn_l":"1796-203X","issn":["1796-203X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318660","host_organization_name":"Academy Publisher","host_organization_lineage":["https://openalex.org/P4310318660"],"host_organization_lineage_names":["Academy Publisher"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computers","raw_type":"journal-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/A5045496091","display_name":"Qiming Fang","orcid":"https://orcid.org/0000-0002-6326-8616"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Qiming Fang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5101678397","display_name":"Guangwen Yang","orcid":"https://orcid.org/0000-0002-8673-8254"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Guangwen Yang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8846,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.76385638,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"9","issue":"9","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998000264167786,"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.9998000264167786,"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.9941999912261963,"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.9916999936103821,"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.7789998650550842},{"id":"https://openalex.org/keywords/query-optimization","display_name":"Query optimization","score":0.5014066696166992},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43931156396865845},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.1794523298740387}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7789998650550842},{"id":"https://openalex.org/C157692150","wikidata":"https://www.wikidata.org/wiki/Q2919848","display_name":"Query optimization","level":2,"score":0.5014066696166992},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43931156396865845},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.1794523298740387}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.4304/jcp.9.9.2000-2006","is_oa":false,"landing_page_url":"https://doi.org/10.4304/jcp.9.9.2000-2006","pdf_url":null,"source":{"id":"https://openalex.org/S77894049","display_name":"Journal of Computers","issn_l":"1796-203X","issn":["1796-203X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318660","host_organization_name":"Academy Publisher","host_organization_lineage":["https://openalex.org/P4310318660"],"host_organization_lineage_names":["Academy Publisher"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computers","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W167356240","https://openalex.org/W1483763945","https://openalex.org/W1522069067","https://openalex.org/W1544095808","https://openalex.org/W1881615225","https://openalex.org/W1965952235","https://openalex.org/W1970387893","https://openalex.org/W1970779762","https://openalex.org/W2009688537","https://openalex.org/W2010096232","https://openalex.org/W2020919487","https://openalex.org/W2116391761","https://openalex.org/W2116400826","https://openalex.org/W2124838580","https://openalex.org/W2133406951","https://openalex.org/W2134206624","https://openalex.org/W2137628386","https://openalex.org/W2155831564","https://openalex.org/W2156192553","https://openalex.org/W2156632255","https://openalex.org/W2158851632","https://openalex.org/W2167898414","https://openalex.org/W2167917855","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2317200988","https://openalex.org/W2376932109","https://openalex.org/W2382290278","https://openalex.org/W2350741829"],"abstract_inverted_index":{"Efficient":[0],"top-":[1,131,138],"k":[2,132,139],"query":[4,56,159],"processing":[5],"in":[6,158],"highly":[7],"distributed":[8],"environments":[9,192],"is":[10,36,67,114],"a":[11],"valuable":[12],"but":[13],"challenging":[14],"research":[15],"topic.":[16],"This":[17],"paper":[18],"focuses":[19],"on":[20,38],"the":[21,40,51,55,70,82,92,101,117,129,155,178],"problem":[22],"over":[23],"vertically":[24],"partitioned":[25],"data":[26,41,78,96,156,172],"and":[27,43,62,89,109,167,174,183,185],"aims":[28],"to":[29,49,127],"propose":[30],"more":[31],"efficient":[32],"algorithms..":[33],"The":[34],"effort":[35],"put":[37],"limiting":[39],"transferred":[42,157,173],"communication":[44,52,102,124,148],"round":[45,103,125,149],"trips":[46,104,126],"among":[47],"nodes":[48],"reduce":[50,154],"cost":[53],"of":[54,84,94],"processing.":[57,160],"Two":[58],"novel":[59],"algorithms,":[60],"BulkDBPA":[61,66,80,166],"4RUT,":[63],"are":[64],"proposed.":[65],"derived":[68],"from":[69,87],"centralized":[71],"algorithm":[72,118],"BPA2":[73,88],"which":[74,120,151],"requires":[75,122],"very":[76],"low":[77,95],"access.":[79],"borrows":[81],"idea":[83],"best":[85],"position":[86],"so":[90],"has":[91,187],"advantage":[93],"transferred.":[97],"It":[98],"further":[99],"reduces":[100],"by":[105,116,144],"utilizing":[106],"bulk":[107,110],"read":[108],"transfer":[111],"mechanism.":[112],"4RUT":[113,135,168],"inspired":[115],"TPUT":[119,184],"only":[121],"three":[123],"get":[128],"exact":[130],"results.":[134],"improves":[136],"its":[137,188],"lower":[141],"bound":[142],"estimate":[143],"introducing":[145],"one":[146],"additional":[147],"trip,":[150],"can":[152],"subsequently":[153],"Experimental":[161],"results":[162],"show":[163],"that":[164],"both":[165],"require":[169],"much":[170],"less":[171],"response":[175],"time":[176],"than":[177],"competitors":[179],"including":[180],"Simple":[181],"Algorithm":[182],"each":[186],"own":[189],"suitable":[190],"application":[191],"respectively.":[193]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}