Paper Info
Title
An efficient R-tree implementation over flash-memory storage systems
Abstract
For many applications with spatial data management such as Geographic Information Systems (GIS), block-oriented access over flash memory could introduce a significant number of node updates. Such node updates could result in a large number of out-place updates and garbage collection over flash memory and damage its reliability. In this paper, we propose a very different approach which could efficiently handle fine-grained updates due to R-tree index access of spatial data over flash memory. The implementation is done directly over the flash translation layer (FTL) without any modifications to existing application systems. The feasibility of the proposed methodology is demonstrated with significant improvement on system performance, overheads on flash-memory management, and energy dissipation.
Year
DOI
Venue
2003
10.1145/956676.956679
GIS
Keywords
Field
DocType
flash-memory storage system,flash translation layer,efficient r-tree implementation,node updates,flash-memory management,out-place updates,r-tree index access,large number,fine-grained updates,significant improvement,block-oriented access,flash memory,geographic information system,r tree,garbage collection,gis,indexation,spatial index,energy dissipation,embedded system,embedded systems,spatial data,system performance,storage system
Spatial analysis,Data mining,Geographic information system,R-tree,Flash file system,Flash memory,Computer science,Real-time computing,Garbage collection,Embedded system,Overhead (business)
Conference
ISBN
Citations 
PageRank 
1-58113-730-3
54
8.61
References 
Authors
4
3
Name
Order
Citations
PageRank
Chin-Hsien Wu141947.93
Li-Pin Chang296995.90
Tei-Wei Kuo33203326.35