Abstract
It is one of most important challenges in information services based on location to support a huge number of clients to process the NN query for a given query point. A scheme of NN query processing based on wireless data broadcasting is an effective way to overcome the challenge. In this paper, we propose an indexing scheme NSPI (Non-uniform Space Partition Index) for quick NN search over wireless data broadcasting. For implementing the aim, we use a non-uniform spatial partition and provide an index based on the partition for equidistance between indexes on the wireless channel. The index scheme enables the clients to process NN quickly by lessening the time for the clients to meet the index on the channel. To show the effectiveness of the proposed scheme, we compare the access time and tuning time of the clients with existing indexing schemes by simulation studies. The proposed NSPI shows shorter access time than the other existing scheme. Also, NSPI outperforms in the aspect of tuning time than the others.
Highlights
The advanced information technologies blast the interest and needs to various information services and explode the number of clients requesting information through high speed networks
We propose Non-uniform Space Partition Index (NSPI) in the distributed scheme, targeting to support the clients to search nearest neighbor (NN) to a given query point in the wireless spatial data broadcast environment
To support for clients to search NN efficiently, we propose Non-uniform Space Partition Index (NSPI)
Summary
The advanced information technologies blast the interest and needs to various information services and explode the number of clients requesting information through high speed networks. We propose Non-uniform Space Partition Index (NSPI) in the distributed scheme, targeting to support the clients to search NN to a given query point in the wireless spatial data broadcast environment. 3.1 Non-uniform Space Partition In order to reduce the access time of the client in the wireless spatial data broadcast environment using the distributed index, it is critical to keep equi-distances on the broadcasting channel between the indexing tables holding the information on the broadcasting time of each data item. In the proposed scheme using the non-uniform space partition, the broadcast server transmits the index information with two kinds of indexing tables, IDXcell andIDXdata, that provide the distribution of data items over the data space Sdata and data broadcast time, individually. Algorithm 1 shows the procedure for searching NN using the distributed index based on the non-uniform space partition
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
