Top-k query processing for replicated data in moible peer to peer networks
Top-k query processing for replicated data in moible peer to peer networks
复制标题
移动对等网络中复制数据的 Top-k 查询处理
DOI：
10.1016/j.jss.2013.10.043
复制
发表时间：
2014
期刊：
影响因子：
--
通讯作者：
Shojiro Nishio
中科院分区：
文献类型：
--
作者：
Yuya Sasaki;Takahiro Hara;Shojiro Nishio
在移动自组织点对点（M-P2P）网络中，由于节点高度资源约束，使用top-k查询检索数据项是有效的，其中数据项按特定属性的分数排序，查询发出节点获取得分最高的数据项。但是，当发生网络分区时，发出查询的节点无法连接到某些具有top-k查询结果中包含的数据项的节点，从而降低了查询结果的准确性。为了解决这个问题，数据复制是一种很有前途的方法。但是，如果每个节点在不考虑其他节点持有的副本的情况下发送响应查询的自己的数据项（副本），则相同的数据项将通过长路径多次发送回发出查询的节点，这将导致流量增加。本文提出了一种考虑M-P2P网络中数据复制的top-k查询处理方法。这种方法抑制了相同数据项通过长路径的重复传输。此外，中间节点停止按需传输查询消息。
In mobile ad hoc peer to peer (M-P2P) networks, since nodes are highly resource constrained, it is effective to retrieve data items using a top-k query, in which data items are ordered by the score of a particular attribute and the query-issuing node acquires data items with thekhighest scores. However, when network partitioning occurs, the query-issuing node cannot connect to some nodes having data items included in the top-k query result, and thus, the accuracy of the query result decreases. To solve this problem, data replication is a promising approach. However, if each node sends back its own data items (replicas) responding to a query without considering replicas held by others, same data items are sent back to the query-issuing node more than once through long paths, which results in increase of traffic. In this paper, we propose a top-k query processing method considering data replication in M-P2P networks. This method suppresses duplicate transmissions of same data items through long paths. Moreover, an intermediate node stops transmitting a query message on-demand.