Merging R-trees
| dc.creator | Vasaitis, V. | en |
| dc.creator | Nanopoulos, A. | en |
| dc.creator | Bozanis, P. | en |
| dc.date.accessioned | 2015-11-23T10:53:21Z | |
| dc.date.available | 2015-11-23T10:53:21Z | |
| dc.date.issued | 2004 | |
| dc.identifier.issn | 10993371 | |
| dc.identifier.uri | http://hdl.handle.net/11615/34350 | |
| dc.description.abstract | R-trees, since their introduction in 1984, have been proven to be one of the most well-behaved practical data structures for accommodating dynamic massive sets of geometric objects and conducting a diverse set of queries on such data-sets in real-world applications. In this paper we introduce a new technique for merging two R-trees into a new one of very good quality. Our method avoids both the employment of bulk insertions and the solution of bulk-loading, from scratch, the new tree using the data of the original trees. Additionally, unlike previous approaches, it does not make any assumptions about data-set distributions. Experimental results provide evidence on the runtime efficiency of our method and illustrate the good query performance of the produced indices. | en |
| dc.source.uri | http://www.scopus.com/inward/record.url?eid=2-s2.0-5444248626&partnerID=40&md5=305c03c932ec676b54e77c1be36838d8 | |
| dc.subject | Algorithms | en |
| dc.subject | Computer aided design | en |
| dc.subject | Data storage equipment | en |
| dc.subject | Database systems | en |
| dc.subject | Indexing (of information) | en |
| dc.subject | Query languages | en |
| dc.subject | Real time systems | en |
| dc.subject | VLSI circuits | en |
| dc.subject | Data sets | en |
| dc.subject | R-Trees | en |
| dc.subject | Real world applications | en |
| dc.subject | Runtime efficiency | en |
| dc.subject | Data structures | en |
| dc.title | Merging R-trees | en |
| dc.type | conferenceItem | en |
Αρχεία σε αυτό το τεκμήριο
| Αρχεία | Μέγεθος | Τύπος | Προβολή |
|---|---|---|---|
|
Δεν υπάρχουν αρχεία που να σχετίζονται με αυτό το τεκμήριο. |
|||