6 search results - page 1 / 2 » Revisiting 2DR-tree insertion |
C3S2E
2008
ACM
13 years 7 months ago
2008
ACM
We take another look at the 2DR-tree. In particular, we revisit its node structure, validity rules and the insertion strategy. The 2DR-tree uses 2D nodes so that the relationships...
CIKM
2006
Springer
13 years 8 months ago
2006
Springer
This paper revisits the analysis of annotation propagation from source databases to views defined in terms of conjunctive (SPJ) queries. Given a source database D, an SPJ query Q,...
EVOW
2010
Springer
13 years 11 months ago
2010
Springer
Genetic algorithms (GAs) share a common weakness with most other metaheuristics: Candidate solutions are in general revisited multiple times, lowering diversity and wasting preciou...
LCPC
2005
Springer
13 years 10 months ago
2005
Springer
Techniques for global register allocation via graph coloring have been extensively studied and widely implemented in compiler frameworks. This paper examines a particular variant ...
ISAAC
2007
Springer
13 years 11 months ago
2007
Springer
The problem of maintaining a representation of a dynamic graph as long as a certain property is satisfied has recently been considered for a number of properties. This paper prese...