[{"_1":2,"_3":-5,"_4":-5},"loaderData",{"_5":6,"_7":8,"_9":10},"actionData","errors","root",{"_271":272},"routes/_layout",{"_11":198},"routes/entity.$type.$id",{"_11":12,"_13":14,"_15":16,"_17":18,"_19":20,"_21":22,"_23":24,"_25":26,"_27":28},"dehydratedState",{"_73":74,"_75":76},"type","paper","id","paper_W2099797738","section","technologies","entity",{"_15":16,"_29":30,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":38,"_39":-5,"_40":41,"_42":43,"_44":45,"_46":47,"_48":-5,"_49":50,"_51":30,"_52":53,"_54":55,"_56":57,"_58":59,"_60":61,"_62":-5,"_63":64,"_65":-5,"_66":67,"_68":30,"_69":-5},"canonical","https://www.hugmap.com/entity/paper/paper_W2099797738/technologies","siteBaseUrl","https://www.hugmap.com","sectionCount",1,"jsonLd","{\"@context\":\"https://schema.org\",\"@graph\":[{\"name\":\"Evaluating top- k queries over web-accessible databases\",\"url\":\"https://www.hugmap.com/entity/paper/paper_W2099797738/technologies\",\"@type\":\"ScholarlyArticle\",\"headline\":\"Evaluating top- k queries over web-accessible databases\",\"datePublished\":\"2004-06-01\",\"isPartOf\":{\"@type\":\"Periodical\",\"name\":\"ACM Transactions on Database Systems\"}},{\"@type\":\"CollectionPage\",\"name\":\"Evaluating top- k queries over web-accessible databases 相关技术\",\"description\":\"Evaluating top- k queries over web-accessible databases 在 HugMap 中的相关技术，共 1 条，含结构化关联信息与详情链接。\",\"url\":\"https://www.hugmap.com/entity/paper/paper_W2099797738/technologies\",\"inLanguage\":\"zh-CN\"},{\"@type\":\"BreadcrumbList\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"首页\",\"item\":\"https://www.hugmap.com/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"论文\",\"item\":\"https://www.hugmap.com/search?type=paper\"},{\"@type\":\"ListItem\",\"position\":3,\"name\":\"Evaluating top- k queries over web-accessible databases\",\"item\":\"https://www.hugmap.com/entity/paper/paper_W2099797738\"},{\"@type\":\"ListItem\",\"position\":4,\"name\":\"相关技术\",\"item\":\"https://www.hugmap.com/entity/paper/paper_W2099797738/technologies\"}]}]}","name","Evaluating top- k queries over web-accessible databases","nameZh","aliases","description","descriptionZh","status","active","externalIds","{\"openalex\":\"W2099797738\",\"doi\":\"10.1145/1005566.1005569\"}","properties","source","openalex","createdAt","2026-05-20T15:35:55.20038195","updatedAt","2026-05-20T15:38:21.186118186","doi","10.1145/1005566.1005569","arxivId","openalexId","W2099797738","title","abstractText","A query to a web search engine usually consists of a list of keywords, to which the search engine responds with the best or \"top\" k pages for the query. This top- k query model is prevalent over multimedia collections in general, but also over plain relational data for certain applications. For example, consider a relation with information on available restaurants, including their location, price range for one diner, and overall food rating. A user who queries such a relation might simply specify the user's location and target price range, and expect in return the best 10 restaurants in terms of some combination of proximity to the user, closeness of match to the target price range, and overall food rating. Processing top- k queries efficiently is challenging for a number of reasons. One critical such reason is that, in many web applications, the relation attributes might not be available other than through external web-accessible form interfaces, which we will have to query repeatedly for a potentially large set of candidate objects. In this article, we study how to process top- k queries efficiently in this setting, where the attributes for which users specify target values might be handled by external, autonomous sources with a variety of access interfaces. We present a sequential algorithm for processing such queries, but observe that any sequential top- k query processing strategy is bound to require unnecessarily long query processing times, since web accesses exhibit high and variable latency. Fortunately, web sources can be probed in parallel, and each source can typically process concurrent requests, although sources may impose some restrictions on the type and number of probes that they are willing to accept. We adapt our sequential query processing technique and introduce an efficient algorithm that maximizes source-access parallelism to minimize query response time, while satisfying source-access constraints. We evaluate our techniques experimentally using both synthetic and real web-accessible data and show that parallel algorithms can be significantly more efficient than their sequential counterparts.","publishedDate","2004-06-01","publishedYear",2004,"venue","ACM Transactions on Database Systems","citationCount",326,"authors","keywords",[70,71,72],"pdfUrl","topVenue",false,"displayName","displayDescription","Data Management and Algorithms","Advanced Database Systems and Queries","Web Data Mining and Analysis","mutations",[],"queries",[77],{"_78":79,"_80":81,"_82":83,"_84":85},"dehydratedAt",1782443739166,"state",{"_87":88,"_89":26,"_90":91,"_92":-5,"_93":94,"_95":94,"_96":94,"_97":-5,"_98":-5,"_99":67,"_35":100,"_101":102},"queryKey",[86,19,14,16],"queryHash","[\"portal\",\"entity\",\"paper\",\"paper_W2099797738\"]","portal","data",{"_19":20,"_103":104,"_105":106,"_107":108,"_109":110,"_18":111,"_62":112},"dataUpdateCount","dataUpdatedAt",1782443739165,"error","errorUpdateCount",0,"errorUpdatedAt","fetchFailureCount","fetchFailureReason","fetchMeta","isInvalidated","success","fetchStatus","idle","entityType","Paper","taxonomies",[157,158,159,160],"events",[],"articles",[],[142],[113,114,115],{"_15":137,"_29":138,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":139,"_39":-5,"_40":41,"_42":140,"_44":141,"_121":-5,"_51":-5,"_123":-5,"_124":-5,"_125":-5,"_60":-5,"_126":-5,"_127":-5,"_128":-5,"_129":-5,"_130":-5,"_68":138,"_69":-5},{"_15":131,"_29":132,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":133,"_39":-5,"_40":41,"_42":134,"_44":135,"_121":136,"_51":-5,"_123":-5,"_124":-5,"_125":-5,"_60":-5,"_126":-5,"_127":-5,"_128":-5,"_129":-5,"_130":-5,"_68":132,"_69":-5},{"_15":116,"_29":117,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":118,"_39":-5,"_40":41,"_42":119,"_44":120,"_121":122,"_51":-5,"_123":-5,"_124":-5,"_125":-5,"_60":-5,"_126":-5,"_127":-5,"_128":-5,"_129":-5,"_130":-5,"_68":117,"_69":-5},"person_A5033884176","Amélie Marian","{\"openalex\":\"A5033884176\",\"orcid\":\"0000-0002-5111-8186\"}","2026-05-19T10:37:58.181649666","2026-05-21T22:37:51.21907872","orcid","0000-0002-5111-8186","affiliation","researchArea","paperCount","homepage","linkedin","twitter","github","hindex","person_A5103027305","Nicolas Bruno","{\"openalex\":\"A5103027305\",\"orcid\":\"0009-0007-3951-0998\"}","2026-05-14T18:33:34.217070216","2026-05-22T15:00:11.203316436","0009-0007-3951-0998","person_A5080063580","Luis Gravano","{\"openalex\":\"A5080063580\"}","2026-05-14T10:28:59.180344614","2026-05-23T04:24:20.514099",{"_15":143,"_29":70,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":144,"_39":-5,"_40":145,"_42":146,"_44":147,"_148":149,"_150":151,"_152":-5,"_153":154,"_155":-5,"_125":-5,"_156":-5,"_68":70,"_69":-5},"tech_oa_T11106","{\"taxonomy_id\":\"tax_rd_T11106\"}","openalex_topics","2026-05-17T09:00:11.245194282","2026-05-17T09:00:11.245197583","techType","algorithm","domain","Physical Sciences","proposedYear","maturityLevel","growing","wikipediaUrl","patentCount",{"_15":191,"_29":192,"_31":-5,"_32":-5,"_33":193,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":194,"_42":-5,"_44":-5,"_165":195,"_167":-5,"_168":26,"_170":196,"_172":197,"_174":94,"_175":67,"_177":94,"_178":-5,"_68":192,"_69":193},{"_15":185,"_29":70,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":186,"_39":-5,"_40":41,"_42":187,"_44":188,"_165":166,"_167":-5,"_168":169,"_170":189,"_172":190,"_174":94,"_175":176,"_177":94,"_178":-5,"_68":70,"_69":-5},{"_15":179,"_29":71,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":180,"_39":-5,"_40":41,"_42":181,"_44":182,"_165":166,"_167":-5,"_168":169,"_170":183,"_172":184,"_174":94,"_175":176,"_177":94,"_178":-5,"_68":71,"_69":-5},{"_15":161,"_29":72,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":162,"_39":-5,"_40":41,"_42":163,"_44":164,"_165":166,"_167":-5,"_168":169,"_170":171,"_172":173,"_174":94,"_175":176,"_177":94,"_178":-5,"_68":72,"_69":-5},"tax_rd_T12016","{\"openalex_topic\":\"T12016\"}","2026-05-14T00:38:18.220781991","2026-05-23T12:04:06.264991444","taxonomyType","RESEARCH_DOMAIN","code","level",3,"parentId","tax_rd_1710","path","Physical Sciences/Computer Science/Information Systems/Web Data Mining and Analysis","sortOrder","isLeaf",true,"entityCount","children","tax_rd_T10317","{\"openalex_topic\":\"T10317\"}","2026-05-14T00:29:44.682811103","2026-05-23T12:36:59.234266799","tax_rd_1705","Physical Sciences/Computer Science/Computer Networks and Communications/Advanced Database Systems and Queries","tax_rd_T11106","{\"openalex_topic\":\"T11106\"}","2026-05-14T00:29:16.292968991","2026-05-23T12:38:06.251863399","tax_rd_1711","Physical Sciences/Computer Science/Signal Processing/Data Management and Algorithms","tax_ind_enterprise","企业软件","Enterprise Software","manual","INDUSTRY","tax_ind_root","科技行业/企业软件",{"_73":199,"_75":200},[],[201],{"_78":202,"_80":203,"_82":204,"_84":205},1782443738200,{"_87":207,"_89":26,"_90":202,"_92":-5,"_93":94,"_95":94,"_96":94,"_97":-5,"_98":-5,"_99":67,"_35":100,"_101":102},[86,206],"[\"portal\",\"industries\"]","industries",[208,209,210,211,212,213,214,215,216,217,218,219],{"_15":264,"_29":265,"_31":-5,"_32":266,"_33":267,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":194,"_42":-5,"_44":-5,"_165":195,"_167":-5,"_168":26,"_170":196,"_172":268,"_174":94,"_175":67,"_177":94,"_178":-5,"_68":265,"_69":267},{"_15":260,"_29":261,"_31":-5,"_32":-5,"_33":262,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":194,"_42":-5,"_44":-5,"_165":195,"_167":-5,"_168":26,"_170":196,"_172":263,"_174":94,"_175":67,"_177":94,"_178":-5,"_68":261,"_69":262},{"_15":254,"_29":255,"_31":-5,"_32":256,"_33":257,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":194,"_42":-5,"_44":-5,"_165":195,"_167":-5,"_168":26,"_170":196,"_172":258,"_174":94,"_175":67,"_177":94,"_178":-5,"_68":255,"_69":257},{"_15":250,"_29":251,"_31":-5,"_32":-5,"_33":252,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":194,"_42":-5,"_44":-5,"_165":195,"_167":-5,"_168":26,"_170":196,"_172":253,"_174":94,"_175":67,"_177":94,"_178":-5,"_68":251,"_69":252},{"_15":191,"_29":192,"_31":-5,"_32":-5,"_33":193,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":194,"_42":-5,"_44":-5,"_165":195,"_167":-5,"_168":26,"_170":196,"_172":197,"_174":94,"_175":67,"_177":94,"_178":-5,"_68":192,"_69":193},{"_15":244,"_29":245,"_31":-5,"_32":246,"_33":247,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":194,"_42":-5,"_44":-5,"_165":195,"_167":-5,"_168":26,"_170":196,"_172":248,"_174":94,"_175":67,"_177":94,"_178":-5,"_68":245,"_69":247},{"_15":240,"_29":241,"_31":-5,"_32":-5,"_33":242,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":194,"_42":-5,"_44":-5,"_165":195,"_167":-5,"_168":26,"_170":196,"_172":243,"_174":94,"_175":176,"_177":94,"_178":-5,"_68":241,"_69":242},{"_15":236,"_29":237,"_31":-5,"_32":-5,"_33":238,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":194,"_42":-5,"_44":-5,"_165":195,"_167":-5,"_168":26,"_170":196,"_172":239,"_174":94,"_175":67,"_177":94,"_178":-5,"_68":237,"_69":238},{"_15":232,"_29":233,"_31":-5,"_32":-5,"_33":234,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":194,"_42":-5,"_44":-5,"_165":195,"_167":-5,"_168":26,"_170":196,"_172":235,"_174":94,"_175":67,"_177":94,"_178":-5,"_68":233,"_69":234},{"_15":228,"_29":229,"_31":-5,"_32":-5,"_33":230,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":194,"_42":-5,"_44":-5,"_165":195,"_167":-5,"_168":26,"_170":196,"_172":231,"_174":94,"_175":67,"_177":94,"_178":-5,"_68":229,"_69":230},{"_15":224,"_29":225,"_31":-5,"_32":-5,"_33":226,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":194,"_42":-5,"_44":-5,"_165":195,"_167":-5,"_168":26,"_170":196,"_172":227,"_174":94,"_175":67,"_177":94,"_178":-5,"_68":225,"_69":226},{"_15":220,"_29":221,"_31":-5,"_32":-5,"_33":222,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":194,"_42":-5,"_44":-5,"_165":195,"_167":-5,"_168":26,"_170":196,"_172":223,"_174":94,"_175":67,"_177":94,"_178":-5,"_68":221,"_69":222},"tax_ind_smartphone","智能手机","Smartphone","科技行业/智能手机","tax_ind_robot","机器人","Robotics","科技行业/机器人","tax_ind_wearable","智能穿戴","Smart Wearables","科技行业/智能穿戴","tax_ind_energy","新能源与智能制造","New Energy & Smart Manufacturing","科技行业/新能源与智能制造","tax_ind_biotech","生物科技","Biotech","科技行业/生物科技","tax_ind_quantum","量子计算","Quantum Computing","科技行业/量子计算","tax_ind_blockchain","区块链",[249],"Blockchain","科技行业/区块链","Web3","tax_ind_security","网络安全","Cybersecurity","科技行业/网络安全","tax_ind_semi","半导体",[259],"Semiconductor","科技行业/半导体","芯片","tax_ind_cloud","云计算","Cloud Computing","科技行业/云计算","tax_ind_ai","人工智能",[269,270],"Artificial Intelligence","科技行业/人工智能","AI","AI 技术","env",{"_273":24},"SITE_BASE_URL"]

Evaluating top- <i>k</i> queries over web-accessible databases 论文

Evaluating top- <i>k</i> queries over web-accessible databases · 相关技术

相关技术