Storage and Retrieval of Moving Objects

Chon, Hae Don; Agrawal, Divyakant; Abbadi, Amr El

doi:10.1007/3-540-44498-x_14

Cited by 43 publications

(19 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…For example, [Güting et al 2000] defines an algebra with data types such as moving points, moving lines, and moving regions. There are also models based on constraint databases [Su et al 2001;Mokhtar and Su 2005], models that consider objects moving in road networks [Vazirgiannis and Wolfson 2001;Ding and Güting 2004;Güting et al 2006] (issues regarding the modeling of road networks are dealt with in works such as [Hage et al 2003]), or the SV model [Chon et al 2001a]. …”

Section: Moving Object Databasesmentioning

confidence: 99%

Location-dependent query processing

2010

View full text Add to dashboard Cite

The continuous development of wireless networks and mobile devices has motivated an intense research in mobile data services. Some of these services provide the user with context-aware information. Specifically, location-based services and location-dependent queries have attracted a lot of interest.In this article, the existing literature in the field of location-dependent query processing is reviewed. The technological context (mobile computing) and support middleware (such as moving object databases and data stream technology) are described, location-based services and locationdependent queries are defined and classified, and different query processing approaches are reviewed and compared.

show abstract

Section: Moving Object Databasesmentioning

confidence: 99%

Location-dependent query processing

2010

View full text Add to dashboard Cite

show abstract

“…Between monitoring data and traditional database data has an obvious difference, namely, the value of vehicle position is continuous and dynamic change, which directly results in a massive data and the lower efficiency of system query [7]- [10]. When the moving object transmits data to the monitoring center, the selected strategy of time interval occupies more unnecessary communication bandwidth, and the model is too simple for the space time [11]- [13].…”

Section: Problemmentioning

confidence: 99%

Study on a Dynamic Intelligent Control Algorithm of Data Transfer for Moving Object

He¹,

Yin²

2007

Proceedings on Intelligent Systems and Knowledge Engineering (ISKE2007)

View full text Add to dashboard Cite

Starting with data transfer, before transmitting GPS data of moving destination terminal to the monitoring center, dynamic intelligent algorithm can control the rhythm of data transfer, filter the unnecessary data transfer, and recover the filtered data. It puts forward the control model and algorithm of data transfer for moving destination terminal, and discusses the condition of judgment and method of data restoration involved with the algorithm. The testing result shows that effect of the presented algorithm is evident, and data transmission rate is ideal. Furthermore, the recovered data can magnificently approach the original GPS trajectories.

show abstract

“…Kollios et al (1999b) used the dual transformation in order to improve the performance, during range queries. Similarly, Chon et al (2001) proposed the SV-model as an alternative method of using a transformation.…”

Section: Related Workmentioning

confidence: 99%

On past-time indexing of moving objects

Raptopoulou

Vassilakopoulos

Manolopoulos

2006

Journal of Systems and Software

View full text Add to dashboard Cite

Tracking of mobile objects trajectories is one of many modern applications supported by Spatiotemporal databases. Within the context of this application, queries about the present, future or past positions of the objects need to be answered. Several indexing methods have been proposed to efficiently handle such spatiotemporal queries. In the current paper, we propose a method for indexing the historic (past) positions of moving objects called XBR-tree, a quadtree-like technique that is able to handle both timestamp and window queries. Moreover, we compare experimentally this with other methods proposed in the literature for the same purpose. In particular, we compare XBR-trees with PMR-trees, structures also related to quadtrees and MV3R-trees, R-tree based structures.

show abstract

Storage and Retrieval of Moving Objects

Cited by 43 publications

References 10 publications

Location-dependent query processing

Location-dependent query processing

Study on a Dynamic Intelligent Control Algorithm of Data Transfer for Moving Object

On past-time indexing of moving objects

Contact Info

Product

Resources

About