Sciweavers

44 search results - page 1 / 9
» On Optimal Node Splitting for R-trees
Sort
View
VLDB
1994
ACM
129views Database» more  VLDB 1994»
14 years 2 months ago
Hilbert R-tree: An Improved R-tree using Fractals
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...
Ibrahim Kamel, Christos Faloutsos
VLDB
1998
ACM
101views Database» more  VLDB 1998»
14 years 3 months ago
On Optimal Node Splitting for R-trees
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...
Yván J. García, Mario A. Lopez, Scot...
CORR
2010
Springer
178views Education» more  CORR 2010»
13 years 8 months ago
Is Light-Tree Structure Optimal for Multicast Routing in Sparse Light Splitting WDM Networks?
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 ...
Fen Zhou, Miklós Molnár, Bernard Cou...
CORR
2010
Springer
315views Education» more  CORR 2010»
13 years 5 months ago
Light-Hierarchy: The Optimal Structure for Multicast Routing in WDM Mesh Networks
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...
Fen Zhou, Miklós Molnár, Bernard Cou...