Back to search

Aristotle University Of Thessaloniki (AUTH)

Βάσεις δεδομένων για την αποθήκευση και την επεξεργασία κινούμενων σημείων

Abstract

dc:description

The current thesis, studies thoroughly the Moving Objects Databases and suggests new ordinary tree structures. More precisely, it presents queries for moving objects databases (nearest neighbor query, incremental nearest neighbor query, window query and timestamp query.). These queries are necessary in order to access the new tree structures. The main contributions of this thesis are presented in detail, in the following: • A first contribution constitutes an algorithm, that is being presented to calculate the nearest neighbor query, for moving objects databases. This algorithm is being compared to an already existent method, which is based on constant repetition. From the experiments, we can conclued that, the new algorithm has a lot better performance than the old one. • A next contribution is a method, that is able to answer to incremental nearest neighbor queries for moving objects databases. This incremental query has not been proposed for moving objects databases. For this reason, we present it and we compare it to the query, that already exists in static objects databases. Once again, the new algorithm outperforms the new one. • In the sequel, we extend an already existent tree structure, based on the quadtree, for the moving objects databases, as well. This method is being compared to an other one also based on the quadtree. The comparison is being made for window queries, in which the new structure outperforms by far the new one. • Next, the structure of the previous work is being compared to an other structure, that is not based on the quadtree and the movement of the objects belongs to the past.. The queries, which are implemented are both window and timestamp. For all the experiments being executed, the new method is better than the one, that is not based on the quadtree. • In conclusion, one final contribution constitutes the comparison of the structure of the previous work to an other structure, that is not based on the quadtree and the movement of the objects belongs to the past and to the future. Once again, the new structure has better performance than the old one. As it is already mentioned, the basic target of the current thesis is the management of moving objects databases. In the near future we expect, that a huge variety of applications will emerge, which will be based on the geographic position of the moving objects. All these applications are collectively called location-based services. The above mentioned applications are expected to crate a great range, to which the moving objects databases can be applied.

Degree

thesis:*
Grantor dc:publisher
Aristotle University Of Thessaloniki (AUTH)
Year dc:date
2006

Author and committee

dc:creator, dc:contributor.*
Authors dc:creator
  • Ραπτοπούλου, Αικατερίνη
  • Raptopoulou, Katerina

Subjects

dc:subject × 16

Rights

Language dc:language
gre

Identifiers

dc:identifier.*
Identifier
10.12681/eadd/15308

Chain of custody

source
Harvested from
Greek National Archive of PhD Theses
Base URL
phdtheses.ekt.gr/eadd_oai/request
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
citation

Ραπτοπούλου, Αικατερίνη; Raptopoulou, Katerina. Βάσεις δεδομένων για την αποθήκευση και την επεξεργασία κινούμενων σημείων. Aristotle University Of Thessaloniki (AUTH), 2006. http://hdl.handle.net/10442/hedi/15308