Managing uncertainty in Moving Objects Databases

被引:166
作者
Trajcevski, G [1 ]
Wolfson, O
Hinrichs, K
Chamberlain, S
机构
[1] Northwestern Univ, Dept Elect & Comp Engn, Evanston, IL 60208 USA
[2] Univ Illinois, Dept Comp Sci, Chicago, IL 60607 USA
[3] Univ Munster, Inst Informat, FB 10, D-48149 Munster, Germany
[4] USA, Res Lab, Aberdeen Proving Ground, MD 21005 USA
来源
ACM TRANSACTIONS ON DATABASE SYSTEMS | 2004年 / 29卷 / 03期
关键词
algorithms; Moving Objects Databases;
D O I
10.1145/1016028.1016030
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This article addresses the problem of managing Moving Objects Databases (MODs) which capture the inherent imprecision of the information about the moving object's location at a given time. We deal systematically with the issues of constructing and representing the trajectories of moving objects and querying the MOD. We propose to model an uncertain trajectory as a three-dimensional (3D) cylindrical body and we introduce a set of novel but natural spatio-temporal operators which capture the uncertainty and are used to express spatio-temporal range queries. We devise and analyze algorithms for processing the operators and demonstrate that the model incorporates the uncertainty in a manner which enables efficient querying, thus striking a balance between the modeling power and computational efficiency. We address some implementation aspects which we experienced in our DOMINO project, as a part of which the operators that we introduce have been implemented. We also report on some experimental observations of a practical relevance.
引用
收藏
页码:463 / 507
页数:45
相关论文
共 65 条
[1]  
AGARWAL AK, 2000, P 19 INT ACM C PRINC, P175
[2]   PARTITIONING ARRANGEMENTS OF LINES .2. APPLICATIONS [J].
AGARWAL, PK .
DISCRETE & COMPUTATIONAL GEOMETRY, 1990, 5 (06) :533-573
[3]   PARTITIONING ARRANGEMENTS OF LINES .1. AN EFFICIENT DETERMINISTIC ALGORITHM [J].
AGARWAL, PK .
DISCRETE & COMPUTATIONAL GEOMETRY, 1990, 5 (05) :449-483
[4]   Polygon decomposition for efficient construction of Minkowski sums [J].
Agarwal, PK ;
Flato, E ;
Halperin, D .
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2002, 21 (1-2) :39-61
[5]  
[Anonymous], 2000, Computational Geometry in C
[6]   Reporting red-blue intersections between two sets of connected line segments [J].
Basch, J ;
Guibas, LJ ;
Ramkumar, GD .
ALGORITHMICA, 2003, 35 (01) :1-20
[7]  
BASCH J, 2004, COMMUNICATION
[8]  
BENTLEY JL, 1979, IEEE T COMPUT, V28, P643, DOI 10.1109/TC.1979.1675432
[9]  
BRUNDICK FS, 1997, P JOINT SERV COMB ID
[10]  
CAO H, 2003, P DIALM POMC JOINT W