| dc.contributor.author |
Lagogiannis, G |
en |
| dc.contributor.author |
Lorentzos, N |
en |
| dc.contributor.author |
Sideridis, AB |
en |
| dc.date.accessioned |
2014-06-06T06:52:38Z |
|
| dc.date.available |
2014-06-06T06:52:38Z |
|
| dc.date.issued |
2013 |
en |
| dc.identifier.issn |
18200214 |
en |
| dc.identifier.uri |
http://dx.doi.org/10.2298/CSIS111127040L |
en |
| dc.identifier.uri |
http://62.217.125.90/xmlui/handle/123456789/6097 |
|
| dc.subject |
I/O complexity |
en |
| dc.subject |
Indexing structures |
en |
| dc.subject |
Persistence |
en |
| dc.title |
Indexing moving objects: A real time approach |
en |
| heal.type |
journalArticle |
en |
| heal.identifier.primary |
10.2298/CSIS111127040L |
en |
| heal.publicationDate |
2013 |
en |
| heal.abstract |
Indexing moving objects usually involves a great amount of updates, caused by objects reporting their current position. In order to keep the present and past positions of the objects in secondary memory, each update introduces an I/O and this process is sometimes creating a bottleneck. In this paper we deal with the problem of minimizing the number of I/Os in such a way that queries concerning the present and past positions of the objects can be answered efficiently. In particular we propose two new approaches that achieve an asymptotically optimal number of I/Os for performing the necessary updates. The approaches are based on the assumption that the primary memory suffices for storing the current positions of the objects. |
en |
| heal.journalName |
Computer Science and Information Systems |
en |
| dc.identifier.issue |
1 |
en |
| dc.identifier.volume |
10 |
en |
| dc.identifier.doi |
10.2298/CSIS111127040L |
en |
| dc.identifier.spage |
173 |
en |
| dc.identifier.epage |
195 |
en |