Indexing Schemes for Multi-dimensional Moving Objects
- PDF / 219,533 Bytes
- 7 Pages / 547.087 x 737.008 pts Page_size
- 32 Downloads / 192 Views
navigation, driving directions, searches for hotels and restaurants, and weather and traffic information. These technologies are the foundation for pervasive location-aware environments and services. Such services have the potential to improve the quality of life by adding location-awareness to virtually all objects of interest such as humans, cars, laptops, eyeglasses, canes, desktops, pets, wild animals, bicycles, and buildings. Applications can range from proximity-based queries on non-mobile objects, locating lost or stolen objects, tracing small children, helping the visually challenged to navigate, locate, and identify objects around them, and to automatically annotating objects online in a video or a camera shot. Another example of the importance of location information is the Enhanced 911 (E911) standard. The standard provides wireless users the same level of emergency 911 support as wireline callers. Future Directions Natural extensions of these techniques are to support other types of important continuous queries including nearestneighbor and density queries. Query indexing can easily be extended for these types of queries too. More generally, there are many instances where it is necessary to efficiently maintain an index over data that is rapidly evolving. A primary example is sensor databases. For the applications too, query indexing can be an effective tool. An important area for future research is the development of index structures that can handle frequent updates to data. Traditionally, index structures have been built with the assumption that updates are not as frequent as queries. Thus, the optimization decisions (for example, the split criteria for R-trees) are made with query performance in mind. However, for high-update environments, these decisions need to be revisited. Cross References Continuous Queries in Spatio-temporal Databases Indexing the Positions of Continuously Moving Objects
Recommended Reading 1. Kollios, G., Gunopulos, D., Tsotras, V.J.: On indexing mobile objects. In: Proc. ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), June (1999) 2. Prabhakar, S., Xia, Y., Kalashnikov, D., Aref, W., Hambrusch, S.: Query indexing and velocity constrained indexing: Scalable techniques for continuous queries on moving objects. IEEE Trans. Comput. 51(10), 1124–1140 (2002) 3. Wolfson, Ouri, Xu, Bo, Chamberlain, Sam and Jiang, L.: Moving objects databases: Issues and solutions. In: Proceedings of the SSDBM Conf. pp. 111–122 (1998)
523
Indexing, R*-Tree R*-tree
Indexing Schemes for Multi-dimensional Moving Objects K HALED E LBASSIONI1, A MR E LMASRY 2 , I BRAHIM K AMEL 3 1 Max-Planck-Institute for Computer Science, Saarbrücken, Germany 2 Department of Computer Engineering and Systems, Alexandria University, Alexandria, Egypt 3 University of Sharjah, Sharjah, UAE Synonyms Indexing moving points; Data-structures; Memory, external; Moving objects; Index lifetime; Disk page; R-tree; TPR-trees; STAR-tree; Dual space-time representation; MB-index Definition Indexing
Data Loading...
