Please use this identifier to cite or link to this item:
|標題:||Optimizing storage utilization in R-tree dynamic index structure for spatial databases||作者:||Huang, P.W.
|關鍵字:||spatial database;window query;spatial object;compact R-tree;storage;utilization;search performance;retrieval||Project:||Journal of Systems and Software||期刊/報告no：:||Journal of Systems and Software, Volume 55, Issue 3, Page(s) 291-299.||摘要:||
Spatial databases have been increasingly and widely used in recent years. The R-tree proposed by Guttman is probably the most popular dynamic index structure for efficiently retrieving objects from a spatial database according to their spatial locations. However, experiments show that only about 70% storage utilization can be achieved in Guttman's R-tree and its variants. In this paper, we propose a compact R-tree structure which can achieve almost 100% storage utilization. Our experiments also show that the search performance of compact R-trees is very competitive as compared to Guttman's R-trees. In addition, the overhead cost of building a compact R-tree is much lower than that of a Guttman's R-tree because the frequency of node splitting is reduced significantly. (C) 2001 Elsevier Science Inc. All rights reserved.
|Appears in Collections:||理學院|
Show full item record
TAIR Related Article
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.