Spatio-temporal data reduction with deterministic error bounds

被引:115
作者
Cao, Hu [1 ]
Wolfson, Ouri
Trajcevski, Goce
机构
[1] Univ Illinois, Dept Comp Sci, Chicago, IL 60607 USA
[2] Northwestern Univ, Dept Elect Engn & Comp Sci, Evanston, IL 60208 USA
关键词
data reduction; line simplification; uncertainty; moving objects database;
D O I
10.1007/s00778-005-0163-7
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
A common way of storing spatio-temporal information about mobile devices is in the form of a 3D (2D geography + time) trajectory. We argue that when cellular phones and Personal Digital Assistants become location-aware, the size of the spatio-temporal information generated may prohibit efficient processing. We propose to adopt a technique studied in computer graphics, namely line-simplification, as an approximation technique to solve this problem. Line simplification will reduce the size of the trajectories. Line simplification uses a distance function in producing the trajectory approximation. We postulate the desiderata for such a distance-function: it should be sound, namely the error of the answers to spatio-temporal queries must be bounded. We analyze several distance functions, and prove that some are sound in this sense for some types of queries, while others are not. A distance function that is sound for all common spatio-temporal query types is introduced and analyzed. Then we propose an aging mechanism which gradually shrinks the size of the trajectories as time progresses. We also propose to adopt existing linguistic constructs to manage the uncertainty introduced by the trajectory approximation. Finally, we analyze experimentally the effectiveness of line-simplification in reducing the size of a trajectories database.
引用
收藏
页码:211 / 228
页数:18
相关论文
共 42 条
  • [1] Indexing Moving Points
    Agarwal, PK
    Arge, L
    Erickson, J
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2003, 66 (01) : 207 - 243
  • [2] Efficient algorithms for approximating polygonal chains
    Agarwal, PK
    Varadarajan, KR
    [J]. DISCRETE & COMPUTATIONAL GEOMETRY, 2000, 23 (02) : 273 - 291
  • [3] ALT H, 1996, DISCRETE GEOMETRIC S
  • [4] [Anonymous], 1987, Cartographica
  • [5] [Anonymous], 2002, PROC ACM SIGMOD INT
  • [6] ARCTUR D, DESIGNING GEODATABAS
  • [7] Approximate query processing using wavelets
    Chakrabarti K.
    Garofalakis M.
    Rastogi R.
    Shim K.
    [J]. The VLDB Journal, 2001, 10 (2) : 199 - 223
  • [8] Approximation of polygonal curves with minimum number of line segments or minimum error
    Chan, WS
    Chin, F
    [J]. INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 1996, 6 (01) : 59 - 77
  • [9] CHEN Z, 2001, P ACM SIGMOD INT C M, P271
  • [10] DING Z, 2004, INT C SCI STAT DAT M, P287