Skip to main content
Article thumbnail
Location of Repository

Distance join queries of multiple inputs in spatial databases

By Antonio Corral, Yannis Manolopoulos, Yannis Theodoridis, Michael Vassilakopoulos and Department Of

Abstract

Abstract. Let a tuple of n objects obeying a query graph (QG) be called the n-tuple. The “Ddistance-value ” of this n-tuple is the value of a linear function of distances of the n objects that make up this n-tuple, according to the edges of the QG. This paper addresses the problem of finding the Kn-tuples between n spatial datasets that have the smallest Ddistancevalues, the so-called K-Multi-Way Distance Join Query (K-MWDJQ), where each set is indexed by an R-tree-based structure. This query can be viewed as an extension of K-Closest-Pairs Query (K-CPQ) [4] for n inputs. In addition, a recursive non-incremental branch-and-bound algorithm following a Depth-First search for processing synchronously all inputs without producing any intermediate result is proposed. Enhanced pruning techniques are also applied to the n R-trees nodes in order to reduce the total response time of the query, and a global LRU buffer is used to reduce the number of disk accesses. Finally, an experimental study of the proposed algorithm using real spatial datasets is presented. Keywords: Spatial databases, Distance join queries, R-trees, Performance study

Year: 2009
OAI identifier: oai:CiteSeerX.psu:10.1.1.134.5276
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://isl.cs.unipi.gr/db/pubs... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.