Log-Compact R-Tree: An Efficient Spatial Index for SSD

@inproceedings{Lv2011LogCompactRA,
  title={Log-Compact R-Tree: An Efficient Spatial Index for SSD},
  author={Yanfei Lv and J. Li and B. Cui and Xuexuan Chen},
  booktitle={DASFAA Workshops},
  year={2011}
}
  • Yanfei Lv, J. Li, +1 author Xuexuan Chen
  • Published in DASFAA Workshops 2011
  • Computer Science
  • R-Tree structure is widely adopted as a general spatial index with the assumption that the deployed system is equipped with magnetic hard disk. [...] Key Method Distinguished from previous attempts, compacted log is introduced to combine newly arrival log with origin ones on the same node, which renders great decrement of random writes with at most one additional read for each node access. Extensive experiments illustrate that the proposed LCR-Tree can achieve up to 3 times benefit against existing approaches.Expand Abstract
    Survey on fingerprint liveness detection
    24
    A Two Conversions/Sample Differential Slope Multiple Sampling ADC With Accelerated Counter Architecture
    2
    The FOX transcription factors regulate vascular pathology, diabetes and Tregs.
    13
    Analyzing the Performance of Spatial Indices on Hard Disk Drives and Flash-based Solid State Drives
    6
    R-Tree for phase change memory
    2
    Spatial indexing in flash memories: proposal of an efficient and robust spatial index with durability

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 23 REFERENCES
    Hacking the Nintendo Wii Remote
    456
    Strings in Curved Space
    66
    Reciprocal suppression of regional cerebral blood flow during emotional versus higher cognitive proc
    395
    A clustering-based prefetching scheme on a Web cache environment
    112
    ISSUES AND OPPORTUNITIES OF INTERNET HOTEL MARKETING IN DEVELOPING COUNTRIES
    12
    An approach to computing electrostatic charges for molecules
    1746