Historical spatio-temporal aggregation
ACM Transactions on Information Systems (TOIS)
Indexing spatiotemporal archives
The VLDB Journal — The International Journal on Very Large Data Bases
Processing generalized k-nearest neighbor queries on a wireless broadcast stream
Information Sciences: an International Journal
A new double sorting-based node splitting algorithm for R-tree
Programming and Computing Software
| Hi-index | 0.00 |
Existing analysis for R-trees is inadequate for several traditional and emerging applications including, for example, temporal, spatio-temporal, and multimedia databases because it is based on the assumption that the extents of a node are identical on all dimensions, which is not satisfied in these domains. In this paper, we propose analytical models that can accurately predict R*-tree performance without this assumption. Our derivation is based on the novel concept of extent regression function, which computes the node extents as a function of the number of node splits. Detailed experimental evaluation reveals that the proposed models are accurate, even in cases where previous methods fail completely.