Due to the ubiquitous use of spatial data applications and the large amounts of such data
these applications use, the processing of large-scale distance joins in distributed systems is …

Given two spatial data sets A and B, a top-k spatial join retrieves the k objects from A or B
that intersect the largest number of objects from the other data set. Depending on the …

Efficient and effective processing of the distance-based join query (DJQ) is of great
importance in spatial databases due to the wide area of applications that may address such …

Efficient processing of distance-based queries (DBQs) is of great importance in spatial
databases due to the wide area of applications that may address such queries. The most …

Iceberg queries, commonly used for decision support, find groups whose aggregate values
are above or below a threshold. In practice, iceberg queries are often posed over complex …

Distance queries, including distance-range queries, k-nearest neighbors search, and
distance joins, are very popular in spatial databases. However, they have been studied …

This paper introduces and solves a novel type of spatial queries, namely, Optimal-Location-
Selection (OLS) search, which has many applications in real life. Given a data object set …

Let a tuple of n objects obeying a query graph (QG) be called the n-tuple. The “D _distance-
value” of this n-tuple is the value of a linear function of distances of the n objects that make …

We present a system, Perada, for parallel perturbation analysis of database queries.
Perturbation analysis considers the results of a query evaluated with (a typically large …

Distance join queries are used in many modern applications, such as spatial databases,
spatiotemporal databases and data mining. One of the most common distance join queries …