Indexing of Moving Objects for Location-Based Services (2001)
Cached
Download Links
- [www.cs.auc.dk]
- [timecenter.cs.aau.dk]
- [www.cs.auc.dk]
- [www.cs.auc.dk]
- [www.cs.auc.dk]
- [www.cs.auc.dk]
- DBLP
Other Repositories/Bibliography
| Citations: | 83 - 15 self |
BibTeX
@MISC{Saltenis01indexingof,
author = {Simonas Saltenis and Christian S.Jensen and Christian S. Jensen and Christian S. Jensen (codirector and Michael H. Böhlen and Heidi Gregersen and Dieter Pfoser and Janne Skyt and Giedrius Slivinskas and Kristian Torp and Richard T. Snodgrass (codirector and Dengfeng Gao and Vijay Khatri and Bongki Moon and Sudha Ram and Michael D. Soo and Amazon. Com and Andreas Steiner Timeconsult},
title = {Indexing of Moving Objects for Location-Based Services},
year = {2001}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
With the continued proliferation of wireless networks, e.g., based on such evolving standards as WAP and Bluetooth, visionaries predict that the Internet will soon extend to billions of wireless devices, or objects. A substantial fraction of these will offer their changing positions to the (location-based) services, they either use or support. As a result, software technologies that enable the management of the positions of objects capable of continuous movement are in increasingly high demand. This paper assumes what we consider a realistic Internet-service scenario where objects that have not reported their position within a specified duration of time are expected to no longer be interested in, or of interest to, the service. In this scenario, the possibility of substantial quantities of "expiring" objects introduces a new kind of implicit update, which contributes to rendering the database highly dynamic. The paper presents an R-tree based technique for the indexing of the current positions of such objects. Extensive performance experiments explore the properties of the types of bounding regions that are candidates for being used in the internal entries of the index, and they show that, when compared to the approach where the objects are not assumed to expire, the new indexing technique can improve the search performance by as much as a factor of two or more without sacrificing update performance.
