Top-k query processing for replicated data in mobile peer to peer networks |
| |
| Affiliation: | 1. State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China;2. School of Computer Science & Informatics, Cardiff University, Cardiff, Wales, UK;1. State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing 210093, China;2. School of Computer Engineering, Nanyang Technological University, Blk N4-02c-110, Nanyang Avenue 639798, Singapore;1. Medical School of Nanjing University, Nanjing, China;2. National Institute of Healthcare Data Science at Nanjing University, Nanjing, China;3. School of Mathematics and Statistics, Xi’an Jiaotong University, Shanxi, China;4. Department of Psychiatry and Behavioral Sciences and the Department of Computer Science, Stanford University, CA, USA;5. State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China;6. Department of Radiology, Nanjing Drum Tower Hospital, Nanjing University Medical School, Nanjing, China;7. School of Biomedical Engineering, ShanghaiTech University, Shanghai, China;8. Department of Research and Development, Shanghai United Imaging Intelligence Co., Ltd., Shanghai, China;9. Department of Artificial Intelligence, Korea University, Seoul 02841, Republic of Korea |
| |
| Abstract: | 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 the k highest 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. |
| |
| Keywords: | Top-k query Mobile peer to peer network Data replication |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
