|
Volumn , Issue , 2001, Pages 190-199
|
RING: A strategy for minimizing the cost of online data placement reorganization for B-tree indexed database over shared-nothing parallel machines
|
Author keywords
[No Author keywords available]
|
Indexed keywords
COSTS;
DATABASE SYSTEMS;
BALANCING ALGORITHMS;
EFFECTIVE APPROACHES;
HOT SPOT;
LINEAR CONFIGURATION;
ONLINE DATA;
PARALLEL MACHINE;
RING CONFIGURATION;
SHARED NOTHING;
TREES (MATHEMATICS);
|
EID: 70349687707
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: 10.1109/DASFAA.2001.916378 Document Type: Conference Paper |
Times cited : (5)
|
References (8)
|