Mostra i principali dati dell'item
LR-tree: A logarithmic decomposable spatial index method
dc.creator | Bozanis, P. | en |
dc.creator | Nanopoulos, A. | en |
dc.creator | Manolopoulos, Y. | en |
dc.date.accessioned | 2015-11-23T10:24:10Z | |
dc.date.available | 2015-11-23T10:24:10Z | |
dc.date.issued | 2003 | |
dc.identifier | 10.1093/comjnl/46.3.319 | |
dc.identifier.issn | 0010-4620 | |
dc.identifier.uri | http://hdl.handle.net/11615/26437 | |
dc.description.abstract | Since its introduction in 1984, R-tree has been proven to be one of the most practical and well-behaved data structures for accommodating dynamic massive sets of geometric objects and conducting a very diverse set of queries on such datasets in real-world applications. This success has led to a variety of versions, each one trying to tune the performance parameters of the original proposal. Among them, the most prominent one is R*-tree, which employs a number of carefully designed heuristics and is widely ccepted as achieving the best performance in most cases. However, in the presence of actively changing datasets, R*-tree still does not avoid performance tuning with forced reinsertion, i.e. a process that performs a kind of local rebuilding. The latter fact has motivated the investigation of the adaptation of a known dynamization technique, based on carefully triggered local rebuildings, for converting static or semi-dynamic, main memory data structures to dynamic ones onto R*-trees. In this paper, we present LR-trees, a new efficient scheme for dynamic manipulation of large datasets, which combines the search performance of the bulk-loaded R-trees with the updated performance of R*-trees. Experimental results provide evidence on the latter statement and illustrate the superiority of the proposed method. | en |
dc.source | Computer Journal | en |
dc.source.uri | <Go to ISI>://WOS:000182744900006 | |
dc.subject | Computer Science, Hardware & Architecture | en |
dc.subject | Computer Science, Information | en |
dc.subject | Systems | en |
dc.subject | Computer Science, Software Engineering | en |
dc.subject | Computer Science, | en |
dc.subject | Theory & Methods | en |
dc.title | LR-tree: A logarithmic decomposable spatial index method | en |
dc.type | journalArticle | en |
Files in questo item
Files | Dimensione | Formato | Mostra |
---|---|---|---|
Nessun files in questo item. |