ACM Home Page
Please provide us with feedback. Feedback
On-line data reduction and the quality of history in moving objects databases
Full text PdfPdf (185 KB)
Source International Workshop on Data Engineering for Wireless and Mobile Access archive
Proceedings of the 5th ACM international workshop on Data engineering for wireless and mobile access table of contents
Chicago, Illinois, USA
SESSION: Moving objects table of contents
Pages: 19 - 26  
Year of Publication: 2006
ISBN:1-59593-436-7
Authors
Goce Trajcevski  Northwestern University, Evanston, Il
Hu Cao  University of Illinois at Chicago, Chicago, Il
Peter Scheuermanny  Northwestern University, Evanston, Il
Ouri Wolfsonz  University of Illinois at Chicago, Chicago, Il
Dennis Vaccaro  Northrop Grumman Corp., Rolling Meadows, Il
Sponsors
ACM: Association for Computing Machinery
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 63,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1140104.1140110
What is a DOI?

ABSTRACT

In this work we investigate the quality bounds for the data stored in Moving Objects Databases (MOD) in the settings in which mobile units can perform an on-board data reduction in real time. It has been demonstrated that line simplification techniques, when properly applied to the large volumes of data pertaining to the past trajectories of the moving objects. result in substantial storage savings while guaranteeing deterministic error bounds to the queries posed to the MOD. On the other hand. it has also been demonstrated that if moving objects establish an agreement with the MOD regarding the (im)precision tolerance significant savings can be achieved in transmission when updating the location-in-time information. In this paper we take a first step towards analyzing the quality of the history in making in MOD by correlating the (impact of the) agreement between the server and the moving objects for on-line updates in real time with the error bounds of the data that becomes a representation of the past trajectories as time evolves.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
 
3
G. Barequet. D. Z. Chen. O. Deascu. M. T. Goodrich. and J. Snoeyink. Efficiently approximating polygonal path in three and higher dimensions. Algorithmica. 33(2). 2002.
 
4
M. Breunig. C. Türker. M. Böhlen. S. Dieker. R.H. Güting. C. Jensen. L. Relly. P. Rigaux. H.-J. Schek. and M. Scholl. Architectures and implementations of spatio-temporal database management systems. In Spatio.Temporal Databases - the Chorochronos Approach. 2003.
 
5
 
6
W. Chan and F. Chin. Approximation of polygonal curves with minimum number of line segments or minimal error. International Journal of Computational Geometry Applicaitons. 6. 1996.
7
8
 
9
 
10
D. Douglas and T. Peuker. Algorithms for the reduction of the number of points required to represent a digitised line or its caricature. The Canadian Cartographer. 10(2):112-122. 1973.
 
11
S. E. Dreyfus. An appraisal of some shortest - path algorithms. Operations Research. 17(3). 1969.
12
 
13
B. Gedik and L. Liu. Mobieyes: Distributed processing of continuous queries on moving objects in a mobile system. In International Conference on Extending the Database Technology (EDBT). 2004.
 
14
B. Gedik and L. Liu. Mobieyes: A distributed location monitoring service using moving location queries. IEEE Transactions on Mobile Computing. 2006. (accepted. to appear).
 
15
R.H. Güting and M. Schneider. Moving Objects Databases. Morgan Kaufmann. 20045.
 
16
J. Hershberger and J. Snoeyink. Speeding up the douglas-peuker line-simplification algorithm. In International Symposium on Spatial Data Handling. 1992.
 
17
G.S. Iwerks. H. Samet. and K. Smith. Continuous k-nearest neighbor queries for continuously moving points with updates. In International Conference on Very Large Databases (VLDB). 2003.
 
18
G.S. Iwerks. H. Samet. and K. Smith. Maintenance of spatial semijoin queries on moving points. In International Conference on Very Large Databases (VLDB). 2004.
 
19
J.A.C. Lema. L. Forlizzi. R.H. Güting. E. Nardeli. and M. Schneider. Algorithms for moving objects databases. Computing Journal. 46(6). 2003.
 
20
21
 
22
 
23
 
24
S. Saltenis and C. Jensen. Indexing of moving objects for location-based services. In International Conference on Data Engineering (ICDE). 2004.
 
25
 
26
27
 
28
29
30
 
31
 
32
 
33
 
34


Collaborative Colleagues:
Goce Trajcevski: colleagues
Hu Cao: colleagues
Peter Scheuermanny: colleagues
Ouri Wolfsonz: colleagues
Dennis Vaccaro: colleagues