Spatial queries in dynamic environments

被引:45
作者
Tao, YF
Papadias, D
机构
[1] City Univ Hong Kong, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China
[2] Hong Kong Univ Sci & Technol, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China
来源
ACM TRANSACTIONS ON DATABASE SYSTEMS | 2003年 / 28卷 / 02期
关键词
algorithms; database; spatio-temporal; time-parameterized; continuous;
D O I
10.1145/777943.777944
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Conventional spatial queries are usually meaningless in dynamic environments since their results may be invalidated as soon as the query or data objects move. In this paper we formulate two novel query types, time parameterized and continuous queries, applicable in such environments. A time-parameterized query retrieves the actual result at the time when the query is issued, the expiry time of the result given the current motion of the query and database objects, and the change that causes the expiration. A continuous query retrieves tuples of the form < result, interval>, where each result is accompanied by a future interval, during which it is valid. We study time-parameterized and continuous versions of the most common spatial queries (i.e., window queries, nearest neighbors, spatial joins), proposing efficient processing algorithms and accurate cost models.
引用
收藏
页码:101 / 139
页数:39
相关论文
共 32 条
  • [1] Acharya S, 1999, SIGMOD RECORD, VOL 28, NO 2 - JUNE 1999, P13, DOI 10.1145/304181.304184
  • [2] AGARWAL PK, 2000, P 19 ACM S PRINC DAT, P175, DOI DOI 10.1145/335168.335220
  • [3] [Anonymous], P 28 INT C VER LARG
  • [4] BECKMANN N, 1990, SIGMOD REC, V19, P322, DOI 10.1145/93605.98741
  • [5] Nearest neighbor and reverse nearest neighbor queries for moving objects
    Benetis, R
    Jensen, CS
    Karciauskas, G
    Saltenis, S
    [J]. IDEAS 2002: INTERNATIONAL DATABASE ENGINEERING AND APPLICATIONS SYMPOSIUM, PROCEEDINGS, 2002, : 44 - 53
  • [6] Berchtold S., 1997, Proceedings of the Sixteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, PODS 1997, P78, DOI 10.1145/263661.263671
  • [7] BERCHTOLD S, 2001, P 8 INT C DAT THEOR, P435
  • [8] Bliujute R., 1998, Proceedings of the Twenty-Fourth International Conference on Very-Large Databases, P345
  • [9] A cost model for query processing in high dimensional data spaces
    Böhm, C
    [J]. ACM TRANSACTIONS ON DATABASE SYSTEMS, 2000, 25 (02): : 129 - 178
  • [10] BRINKHOFF T, 1993, P ACM SIGMOD INT C M, P237