China
Africa
Explore chapters and articles related to this topic
A novel P2P information retrieval framework using locality-sensitive hashing and B+ tree
Published in Amir Hussain, Mirjana Ivanovic, Electronics, Communications and Networks IV, 2015
The Skip Graph system (Aspnes & Shah 2007) uses a tree structure rather than consistent hashing to the overlay, and it adopts a graph structure into the system since the tree structure has a single point of failure. González-Beltrán et al. (2008) proposed a range query method by making use of the skip graphs. However, replacing the consistent hashing by a tree-based structure adds further complexity both in terms of theory and load balancing.
Securing top-k query processing in two-tiered sensor networks
Published in Connection Science, 2021
Xiaoyan Kui, Jiannan Feng, Xinran Zhou, Huakun Du, Xia Deng, Ping Zhong, Xingpo Ma
The data-division-based technique is mainly used to secure range queries: the range of the sensed data is divided into adjacent data intervals, each of which is assigned a unique digital ID. Sensor nodes collect the sensed data items and put them into the corresponding interval based on the data size; then, using the symmetric key shared by the sensor nodes and Sink to encrypt the sensed data belonging to the same interval. After that, the encrypted data and the interval ID will be sent to a nearby storage node. During the procedure of range query processing, the minimum interval set which covers the query range will be worked out first based on the range in the query; then, those sets of interval will be sent to the corresponding storage nodes. When the data storage nodes receives those sets, they send the encrypted data in the corresponding interval to Sink. Using the data-division based technique; many algorithms are able to achieve data privacy preservation (Chen & Liu, 2010; Sheng & Li, 2010; Shi et al., 2009, 2011; Yu et al., 2011; Zhang et al., 2009). However, they are mainly fit for range queries. If the data-division-based technique is used to secure top-k queries, the data storage nodes are only able to return all the sensed data in a interval, and they cannot return the exact qualified top-k data accurately and brings a large communication cost.