Top-k spatial joins

被引：20

作者：

Zhu, ML

Papadias, D

Zhang, J

Lee, DL

机构：

[1] Hong Kong Univ Sci & Technol, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China

[2] Nanyang Technol Univ, Comp Engn Sch, Div Informat Syst, Singapore 2263, Singapore

来源：

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING | 2005年 / 17卷 / 04期

关键词：

database; spatial database; spatial joins;

D O I：

10.1109/TKDE.2005.65

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

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 application requirements, there exist several variations of the problem. For instance, B may be a point data set, and the goal may be to retrieve the regions of A that contain the maximum number of points. The processing of such queries with conventional spatial join algorithms is expensive. However, several improvements are possible based on the fact that we only require a small subset of the result ( instead of all intersection/containments pairs). In this paper, we propose output-sensitive algorithms for top-k spatial joins that utilize a variety of optimizations for reducing the overhead.

引用

页码：567 / 579

页数：13