Performance Evaluation
The LRU-K page replacement algorithm for database disk buffering
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
ACM Computing Surveys (CSUR)
B+ trees and indexed sequential files: a performance comparison
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Dynamic authenticated index structures for outsourced databases
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Hierarchical Indexing Structure for Efficient Similarity Search in Video Retrieval
IEEE Transactions on Knowledge and Data Engineering
A superblock-based flash translation layer for NAND flash memory
EMSOFT '06 Proceedings of the 6th ACM & IEEE International conference on Embedded software
Index structures for matching XML twigs using relational query processors
Data & Knowledge Engineering
OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4
A log buffer-based flash translation layer using fully-associative sector translation
ACM Transactions on Embedded Computing Systems (TECS)
An efficient B-tree layer implementation for flash-memory storage systems
ACM Transactions on Embedded Computing Systems (TECS)
Continuous range monitoring of mobile objects in road networks
Data & Knowledge Engineering
A new approach on indexing mobile objects on the plane
Data & Knowledge Engineering
Adaptive indexing for content-based search in P2P systems
Data & Knowledge Engineering
Binary B-trees for virtual memory
SIGFIDET '71 Proceedings of the 1971 ACM SIGFIDET (now SIGMOD) Workshop on Data Description, Access and Control
System software for flash memory: a survey
EUC'06 Proceedings of the 2006 international conference on Embedded and Ubiquitous Computing
ISB-tree: a new indexing scheme with efficient expected behaviour
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
A space-efficient flash translation layer for CompactFlash systems
IEEE Transactions on Consumer Electronics
FlashB-tree: a novel B-tree index scheme for solid state drives
Proceedings of the 2011 ACM Symposium on Research in Applied Computation
Extending SSD lifetime in database applications with page overwrites
Proceedings of the 6th International Systems and Storage Conference
A group round robin based b-tree index storage scheme for flash memory devices
Proceedings of the 8th International Conference on Ubiquitous Information Management and Communication
Hi-index | 0.00 |
Recently, NAND flash memory has been one of the best storage mediums for various embedded systems such as MP3 players, mobile phones and laptops because of its shock-resistant, low-power consumption, and none-volatile properties. However, since it has very distinct characteristics including erase-before-write and asymmetric read/write speed, the performance of disk based systems and applications may degrade dramatically when directly adopting them on the flash memory storage systems. Especially when a B-tree is constructed on NAND flash memory, intensive overwrite operations may be caused by record inserting, deleting, and reorganizing. These may result in severe performance degradation when building the B-tree. In this paper, we propose an efficient index buffer management scheme, called IBSF, which eliminates redundant index units in the index buffer and then delays the time that the index buffer requires to become full. Consequently, IBSF significantly reduces the number of write operations to a flash memory when constructing a B-tree. We also show that IBSF yields a better performance on a flash memory by comparing it to the related technique through various experiments.