Show simple item record

dc.contributor.authorTayeb, J.en_US
dc.contributor.authorUlusoy, Ö.en_US
dc.contributor.authorWolfson, O.en_US
dc.date.accessioned2016-02-08T10:43:38Z
dc.date.available2016-02-08T10:43:38Zen_US
dc.date.issued1998en_US
dc.identifier.issn0010-4620
dc.identifier.urihttp://hdl.handle.net/11693/25367en_US
dc.description.abstractDynamic attributes are attributes that change continuously over time making it impractical to issue explicit updates for every change. In this paper, we adapt a variant of the quadtree structure to solve the problem of indexing dynamic attributes. The approach is based on the key idea of using a linear function of time for each dynamic attribute that allows us to predict its value in the future. We contribute an algorithm for regenerating the quadtree-based index periodically that minimizes CPU and disk access cost. We also provide an experimental study of performance focusing on query processing and index update overheads.en_US
dc.language.isoEnglishen_US
dc.source.titleComputer Journalen_US
dc.relation.isversionofhttps://doi.org/10.1093/comjnl/41.3.185en_US
dc.titleA quadtree-based dynamic attribute indexing methoden_US
dc.typeArticleen_US
dc.departmentDepartment of Computer Engineeringen_US
dc.citation.spage185en_US
dc.citation.epage200en_US
dc.citation.volumeNumber41en_US
dc.citation.issueNumber3en_US
dc.identifier.doi10.1093/comjnl/41.3.185en_US
dc.publisherOxford University Pressen_US
dc.identifier.eissn1460-2067


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record