Title: Approximately processing aggregate range queries on remote spatial databases

Authors: Hideki Sato; Ryoichi Narita

Addresses: School of Informatics, Daido University, 10-3 Takiharu-cho, Minami-ku, Nagoya, 457-8530, Japan ' Aichi Toho University, 3-11 Heiwagaoka, Meito-ku, Nagoya, 465-8515, Japan

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.

Keywords: aggregate range queries; sum range query; maximum range query; regular polygon-based search algorithm; RPSA; precision; number of requests; NOR; k-NN queries; remote spatial databases.

DOI: 10.1504/IJKWI.2013.060275

International Journal of Knowledge and Web Intelligence, 2013 Vol.4 No.4, pp.314 - 335

Published online: 26 Jul 2014 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article