Indexing of moving objects for location-based services

Šaltenis, Simonas; Jensen, Christian S.

doi:10.1109/icde.2002.994759

Cited by 142 publications

(95 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Efficient techniques for indexing moving objects in one and two dimensions are proposed in [12] while in [5] the trade-offs for indexing schemes to answer interval, rectangle, approximate nearest-neighbor, approximate farthest-neighbor and convex-hull queries are examined. The indexing of current and anticipated positions of moving objects in the context of location based services is examined in [25]. Much work has been also reported in data broadcast and dissemination over wireless networks during the last decade [4,22,33,19,6].…”

Section: Related Workmentioning

confidence: 99%

Video-streaming for fast moving users in 3G mobile networks

Kyriakidou

Karelos

Delis

2005

Proceedings of the 4th ACM International Workshop on Data Engineering for Wireless and Mobile Access

View full text Add to dashboard Cite

The emergence of third-generation (3G) mobile networks offers new opportunities for the effective delivery of data with rich content including multimedia messaging and video-streaming. Provided that streaming services have proved highly successful over stationary networks in the past, we anticipate that the same trend will soon take place in 3G networks. Although mobile operators currently make available pertinent services, the available resources of the underlying networks for the delivery of rich data remain inherently constrained. At this stage and in light of large numbers of users moving fast across cells, 3G networks may not be able to warrant the needed quality-of-service requirements. The support for streaming services necessitates the presence of content or media servers properly placed over the 3G network; such servers essentially become the source for streaming applications. Evidently, a centralized approach in organizing streaming content might lead to highly congested media-nodes which in presence of moving users will certainly yield increased response times and jitter to user requests. In this paper, we propose a workaround that enables 3G networks to offer uninterrupted video-streaming services in the presence of a large number of users moving in high-speed. At the same time, we offer a distributed organization for the network's mediaservers to better handle over-utilization.

show abstract

Section: Related Workmentioning

confidence: 99%

Video-streaming for fast moving users in 3G mobile networks

Kyriakidou

Karelos

Delis

2005

Proceedings of the 4th ACM International Workshop on Data Engineering for Wireless and Mobile Access

View full text Add to dashboard Cite

show abstract

“…A large body of work in moving objects databases has been concentrated on indexing in primal [17,22,20,21,28] or dual space [1,12,13]. [30,31] present specifications of what an indexing of moving objects needs to consider, and generation of spatial datasets for benchmarking data.…”

Section: Conclusion Related Work and Future Directionsmentioning

confidence: 99%

The Geometry of Uncertainty in Moving Objects Databases

Trajcevski

Wolfson

Zhang

et al. 2002

Advances in Database Technology — EDBT 2002

100

View full text Add to dashboard Cite

Abstract. This work addresses the problem of querying moving objects databases. which capture the inherent uncertainty associated with the location of moving point objects. We address the issue of modeling, constructing, and querying a trajectories database. We propose to model a trajectory as a 3D cylindrical body. The model incorporates uncertainty in a manner that enables efficient querying. Thus our model strikes a balance between modeling power, and computational efficiency. To demonstrate efficiency, we report on experimental results that relate the length of a trajectory to its size in bytes. The experiments were conducted using a real map of the Chicago Metropolitan area. We introduce a set of novel but natural spatio-temporal operators which capture uncertainty, and are used to express spatio-temporal range queries. We also devise and analyze algorithms to process the operators. The operators have been implemented as a part of our DOMINO project.

show abstract

“…Also based on dual transformation, a recent approach called STRIPES [10] supports efficient query and update at the cost of increased space requirements. The main focus of most recent work is on practical implementation, for instance, the TPR-tree [14] and its variations [13,16] are based on R-trees [5], and the B x -tree [6] and its varia- fies the probability it slows down. We assume that V max is the maximum velocity of moving objects.…”

Section: Related Workmentioning

confidence: 99%

Indexing Future Trajectories of Moving Objects in a Constrained Network

Chen

Meng

2007

J Comput Sci Technol

View full text Add to dashboard Cite

Advances in wireless sensor networks and positioning technologies enable new applications monitoring moving objects. Some of these applications, such as traffic management, require the possibility to query the future trajectories of the objects. In this paper, we propose an original data access method, the ANR-tree, which supports predictive queries. We focus on real life environments, where the objects move within constrained networks, such as vehicles on roads. We introduce a simulation-based prediction model based on graphs of cellular automata, which makes full use of the network constraints and the stochastic traffic behavior. Our technique differs strongly from the linear prediction model, which has low prediction accuracy and requires frequent updates when applied to real traffic with velocity changing frequently. The data structure extends the R-tree with adaptive units which group neighbor objects moving in the similar moving patterns. The predicted movement of the adaptive unit is not given by a single trajectory, but instead by two trajectory bounds based on different assumptions on the traffic conditions and obtained from the simulation. Our experiments, carried on two different datasets, show that the ANR-tree is essentially one order of magnitude more efficient than the TPR-tree, and is much more scalable.

show abstract

Indexing of moving objects for location-based services

Cited by 142 publications

References 8 publications

Video-streaming for fast moving users in 3G mobile networks

Video-streaming for fast moving users in 3G mobile networks

The Geometry of Uncertainty in Moving Objects Databases

Indexing Future Trajectories of Moving Objects in a Constrained Network

Contact Info

Product

Resources

About