Now showing items 1-4 of 4
Packed R-trees Using Fractals
We propose a new packing technique for R-trees for static databases. Given a collection of rectangles, we sort them and we build the R-tree bottom-up. There are several ways to sort the rectangles; the innovation of this ...
Beyond Uniformity and Independence: Analysis of R-trees Using the Concept of Fractal Dimension
We propose the concept of fractal dimension of a set of points, in order to quantify the deviation from the uniformity distribution. Using measurements on real data sets (road intersections of U.S. counties, star coordinates ...
Declustering R-Tree on Multi-Computer Architectures
We study a method to decluster a spatial access method (and specifically an R-tree) on a shared-nothing multi-computer architecture . Our first step is to propose a software architecture, with the top levels of the ...
The Time Index+ : An Incremental Access Structure for Temporal Databases
In this paper, we propose a new indexing structure, called the Time Index+, which extends the incremental structure technique introduced in the Time Index [ElWK90, ElKG93]. The Time Index performs well for data that often ...