Top-k query processing for replicated data in mobile peer to peer networks

• Published in: The Journal of systems and software Vol. 92; pp. 45 - 58
• Main Authors: Sasaki, Yuya, Hara, Takahiro, Nishio, Shojiro
• Format: Journal Article
• Language: English
• Published: New York Elsevier Inc 01.06.2014; Elsevier Sequoia S.A
• Subjects: Computer programs; Data replication; Data transmission; Information processing; Information retrieval; Mathematical problems; Messages; Mobile peer to peer network; Networks; Peer to peer computing; Query processing; Reproduction; Social networks; Studies; Top-k query; Transmission; Mobile peer to peer network; Data replication; Top-k query
• ISSN: 0164-1212; 1873-1228
• DOI: 10.1016/j.jss.2013.10.043

•A top-k query processing for replicated data in M-P2P networks is proposed.•This method suppresses duplicate transmissions of same data through long paths.•An intermediate node stops transmitting a query message on-demand.•The simulation result shows that our proposed method achieves high performance. 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.