SIGN IN
SIGN UP
An efficient B-tree layer implementation for flash-memory storage systems
Full Text:
PDF
Buy this Article
Authors:
Chin-Hsien Wu
National Taiwan University, Taipei, Taiwan, ROC
Tei-Wei Kuo
National Taiwan University, Taipei, Taiwan, ROC
Li Ping Chang
National Chiao-Tung University, Hsin Chu, Taiwan, ROC
Published in:
· Journal
ACM Transactions on Embedded Computing Systems (TECS)
TECS Homepage
archive
Volume 6 Issue 3, July 2007
Article No. 19
ACM
New York, NY
, USA
table of contents
doi>
10.1145/1275986.1275991
2007 Article
Bibliometrics
· Downloads (6 Weeks): 13
· Downloads (12 Months): 127
· Downloads (cumulative): 1,784
· Citation Count: 29
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
b-tree
content analysis and indexing
database systems
design
embedded systems
flash memory
information search and retrieval
performance
storage systems
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder