Efficient Multidimensional Top-k Query Processing in Wireless Multihop Networks
Efficient Multidimensional Top-k Query Processing in Wireless Multihop Networks
复制标题
DOI：
10.1155/2015/657431
复制
发表时间：
2015-01
期刊：
影响因子：
--
通讯作者：
Daichi Amagata;Yuya Sasaki;T. Hara;S. Nishio
中科院分区：
文献类型：
--
作者：
Daichi Amagata;Yuya Sasaki;T. Hara;S. Nishio
顶层查询作为检索最优数据对象的查询，一直受到人们的关注.一个新出现的挑战是在无线分布式网络中支持高效的顶层查询处理。在这项研究中，我们研究了如何在无线多跳网络中有效地处理多维顶级查询。多维顶级查询的一个主要挑战是，不同用户的答案通常是不同的，因为每个用户都有一个独特的偏好和搜索范围。同时，期望无线网络减少不必要的业务，即使用户发出具有他们自己的独特偏好的顶级查询。因此，我们针对上述问题，提出了一种无线多跳网络中的顶层查询处理方法，称为TOPTO。该算法提出了一种新的多维查询处理聚类方案，并在保证用户指定搜索范围的前提下，基于聚类对查询进行路由。此外，该算法采用动态阈值方法来抑制不必要的查询传输，这些查询传输对顶层数据检索没有贡献。在真实的和合成数据上的大量实验表明，在流量和延迟方面，该方法优于现有方法。
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’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.