Efficient implementation of a multi-dimensional index structure over flash memory storage systems

Authors:
Guohui Li;Pei Zhao;Ling Yuan;Sheng Gao
Affiliations:
School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, P.R. China;School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, P.R. China;School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, P.R. China;School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, P.R. China
Venue:
The Journal of Supercomputing
Year:
2013

Citing 14
Cited 0

An optimal online algorithm for metrical task systems

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
eNVy: a non-volatile, main memory storage system

ASPLOS VI Proceedings of the sixth international conference on Architectural support for programming languages and operating systems
Multidimensional binary search trees used for associative searching

Communications of the ACM
Approximation algorithms

Approximation algorithms
The K-D-B-tree: a search structure for large multidimensional dynamic indexes

SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Implementing KDB-Trees to Support High-Dimensional Data

IDEAS '01 Proceedings of the International Database Engineering & Applications Symposium
An Adaptive Striping Architecture for Flash Memory Storage Systems of Embedded Systems

RTAS '02 Proceedings of the Eighth IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS'02)
KDBKD-Tree: A Compact KDB-Tree Structure for Indexing Multidimensional Data

ITCC '03 Proceedings of the International Conference on Information Technology: Computers and Communications
Real-time garbage collection for flash-memory storage systems of real-time embedded systems

ACM Transactions on Embedded Computing Systems (TECS)
A flash-memory based file system

TCON'95 Proceedings of the USENIX 1995 Technical Conference Proceedings
Storage alternatives for mobile computers

OSDI '94 Proceedings of the 1st USENIX conference on Operating Systems Design and Implementation
An efficient B-tree layer implementation for flash-memory storage systems

ACM Transactions on Embedded Computing Systems (TECS)
StableBuffer: optimizing write performance for DBMS applications on flash devices

CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Flash-optimized B+-tree

Journal of Computer Science and Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

Flash memory is widely used in the storage system. The direct use of multi-dimensional index structure over flash memory would introduce a large number of redundant writes since such index structure requires fine-grained updates intensively. K-D-B-tree is a classic multi-dimensional index structure. In this paper, the implementation of K-D-B-tree over flash memory, namely F-KDB, is proposed to handle fine-grained updates. In F-KDB, a K-D-B-tree node is represented as a collection of logs (termed as logging entries) to efficiently process the updates of the node. Since the collecting and parsing of all the relevant logging entries to construct a node could degrade the query performance, a Workload Adaptive (WA) online algorithm is proposed to improve the query performance. A series of experiments are conducted to demonstrate the efficiency of F-KDB over flash memory. The response times of insertion/deletion are significantly reduced and the overall performance of F-KDB is improved.