首页    期刊浏览 2024年07月07日 星期日
登录注册

文章基本信息

  • 标题:Efficient Multidimensional Top-<svg xmlns:xlink="http://www.w3.org/1999/xlink" xmlns="http://www.w3.org/2000/svg" style="vertical-align:-0.2811995pt" id="M1" height="13.056pt" version="1.1" viewBox="-0.0657574 -12.7748 9.16067 13.056" width="9.16067pt"><g transform="matrix(.018,0,0,-0.018,0,0)"><path id="g113-108" d="M480 416C480 431 465 448 438 448C388 448 312 383 252 330C217 299 188 273 155 237H153L257 680C262 700 263 712 253 712C240 712 183 684 97 674L92 648L126 647C166 646 172 645 163 606L23 -6L29 -12C51 -5 77 2 107 8C115 62 130 128 142 180C153 193 179 220 204 241C231 170 259 106 288 54C317 0 336 -12 358 -12C381 -12 423 2 477 80L460 100C434 74 408 54 398 54C385 54 374 65 351 107C326 154 282 241 263 299C296 332 351 377 403 377C424 377 436 372 445 368C449 366 456 368 462 375C472 386 480 402 480 416Z"/></g></svg> Query Processing in Wireless Multihop Networks
  • 本地全文:下载
  • 作者:Daichi Amagata ; Yuya Sasaki ; Takahiro Hara
  • 期刊名称:Mobile Information Systems
  • 印刷版ISSN:1574-017X
  • 出版年度:2015
  • 卷号:2015
  • DOI:10.1155/2015/657431
  • 出版社:Hindawi Publishing Corporation
  • 摘要:Top- queries, which retrieve the most preferable data objects, have been receiving much attention. An emerging challenge is to support efficient top- query processing in a wireless distributed network. In this study, we investigated how to process multidimensional top- queries efficiently in a wireless multihop network. A major challenge for multidimensional top- queries is that answers for different users are typically different, because each user has a unique preference and search range. Meanwhile, it is desirable for wireless networks to reduce unnecessary traffic even if users issue top- queries with their own unique preferences. Therefore, we address the above problem and propose a top- query processing method in wireless multihop networks, called ClusTo. ClusTo performs a novel clustering scheme for multidimensional top- query processing and routes queries based on the cluster while guaranteeing the user&#x2019;s specified search range. Moreover, ClusTo takes a dynamic threshold approach to suppress unnecessary query transmissions to nodes which do not contribute to top- data retrieval. Extensive experiments on both real and synthetic data have demonstrated that ClusTo outperforms existing methods in terms of traffic and delay.
国家哲学社会科学文献中心版权所有