R-tree-based data migration and self-tuning strategies in shared-nothing spatial databases

Proceedings of the ACM Workshop on Advances in Geographic Information Systems

Volumn , Issue , 2001, Pages 28-33

  Mondal, Anirban ^a   Kitsuregawa, Masaru ^a   Ooi, Beng Chin ^a   Tan, Kian Lee ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CLIENT SERVER COMPUTER SYSTEMS; COMPUTER SIMULATION; COMPUTER WORKSTATIONS; DATA STRUCTURES; DISTRIBUTED DATABASE SYSTEMS; INDEXING (OF INFORMATION); LOCAL AREA NETWORKS; PARALLEL PROCESSING SYSTEMS; QUERY LANGUAGES; RESPONSE TIME (COMPUTER SYSTEMS);

DATA MIGRATION; PARALLEL SPATIAL DATABASE; PROCESSING ELEMENT; R-TREE; SELF TUNING; SHARED NOTHING SPATIAL DATABASES;

GEOGRAPHIC INFORMATION SYSTEMS;

EID: 0035757964     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/512161.512169     Document Type: Conference Paper

References (6)

1. A case for now (network of workstations)
2. R-trees: A dynamic index structure for spatial searching
3. Parallel r-trees
4. Towards self-tuning data placement in parallel database systems
5. Query-centric load-balancing using r-trees in shared-nothing spatial databases
6. On-line reorganization of sparsely-populated b+ trees