Abstract Distance-based Join Queries (DJQs) have multiple applications in spatial
databases, Geographic Information Systems, and other areas. The K Closest Pairs Query …

Abstract Efficient processing of Distance-Based Join Queries (DBJQs) in spatial databases
is of paramount importance in many application domains. The most representative and …

Given two object sets PP and QQ, a k-closest pair (k CP)(k CP) query finds kk closest object
pairs from P * QP× Q. This operation is common in many real-life applications such as GIS …

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 …

Given two datasets P and Q, the K Closest Pair Query (K CPQ) finds the K closest pairs of
objects from P * Q. It is an operation widely adopted by many spatial and GIS applications …

In this contribution, a simple and efficient algorithm for the closest-pair problem in E 1 is
described using the preprocessing based on exponent bucketing and exponent windowing …

Given two sets of nodes P and Q on a road network, a k-Closest Pairs Query (k-CPQ) finds
the pairs from P× Q which have the k smallest network distances. Although this problem has …

A major part of the interface to a database is made up of the queries that can be addressed
to this database and answered (processed) in an efficient way, contributing to the quality of …

Compact data structures can represent data with usually a much smaller memory footprint
than its plain representation. In addition to maintaining the data in a form that uses less …

Graphs are widespread in many real-life practical applications. One of a graph's
fundamental and popular researches is investigating the relations between two given …