Approximately processing aggregate range queries on remote spatial databases
by Hideki Sato; Ryoichi Narita
International Journal of Knowledge and Web Intelligence (IJKWI), Vol. 4, No. 4, 2013

Abstract: Processing aggregate range queries on remote spatial databases suffers from accessing huge and/or large number of databases that operate autonomously and simple and/or restrictive web API interfaces. To overcome these difficulties, this paper applies a revised version of regular polygon-based search algorithm (RPSA) to approximately search aggregate range query results over remote spatial databases. The algorithm requests a series of k-NN queries to obtain aggregate range query results. The query point of a subsequent k-NN query is chosen from among the vertices of a regular polygon inscribed in a previously searched circle. Experimental results show that precision is over 0.97 with regard to sum range query results and NOR is at most 4.3. On the other hand, precision is over 0.87 with regard to maximum range query results and NOR is at most 4.9.

Online publication date: Sat, 26-Jul-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Knowledge and Web Intelligence (IJKWI):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com