Processing distance join queries with constraints

被引：0

作者：

Papadopoulos, Apostolos N. ^{[1
]}

Nanopoulos, Alexandros ^{[1
]}

Manolopoulos, Yannis ^{[1
]}

机构：

[1] Data Engineering Research Laboratory, Department of Informatics, Aristotle University, Thessaloniki 54124, Greece

来源：

Computer Journal | 2006年 / 49卷 / 03期

关键词：

Distance join queries are used in many modern applications; such as spatial databases; spatio-temporal databases and data mining. One of the most common distance join queries is the closest-pair query (CPQ). Given two datasets DA and DB the CPQ retrieves the pair (a; b); where a ∈ DA and b ∈ DB; having the smallest distance between all pairs of objects. An extension to this problem is to generate the k closest pairs of objects (k-CPQ). In several cases spatial constraints are applied; and object pairs that are retrieved must also satisfy these constraints. Although the application of spatial constraints seems natural towards a more focused search; only recently they have been studied for the CPQ problem with the restriction that DA = DB. In this work; we focus on constrained closest-pair queries; between two distinct datasets DA and DB; where objects from DA must be enclosed by a spatial region R. Several algorithms are presented and evaluated using real-life and synthetic datasets. Among them; a heap-based method enhanced with batch capabilities outperforms the other approaches as it is demonstrated by an extensive performance evaluation. © 2006 Oxford University Press;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

Journal article (JA)

引用

页码：281 / 296