44 search results - page 1 / 9 » On Optimal Node Splitting for R-trees |
VLDB
1994
ACM
15 years 4 months ago
1994
ACM
We propose a new R-tree structure that outperforms all the older ones. The heart of the idea is to facilitate the deferred splitting approach in R-trees. This is done by proposing...
VLDB
1998
ACM
15 years 5 months ago
1998
ACM
The problem of finding an optimal bipartition of a rectangle set has a direct impact on query performance of dynamic R-trees. During update operations, overflowed nodes need to be...
88
Voted
EUROPAR
2001
Springer
15 years 5 months ago
2001
Springer
113
Voted
CORR
2010
Springer
14 years 10 months ago
2010
Springer
To minimize the number of wavelengths required by a multicast session in sparse light splitting Wavelength Division Multiplexing (WDM) networks, a light-hierarchy structure, which ...
137
click to vote
CORR
2010
Springer
14 years 7 months ago
2010
Springer
Abstract--Based on the false assumption that multicast incapable (MI) nodes could not be traversed twice on the same wavelength, the light-tree structure was always thought to be o...