z-logo
open-access-imgOpen Access
An Efficient Flash Memory B-Tree Supporting Very Cheap Node Updates
Author(s) -
Seong-Chae Lim
Publication year - 2016
Publication title -
the journal of the korea contents association
Language(s) - English
Resource type - Journals
eISSN - 2508-6723
pISSN - 1598-4877
DOI - 10.5392/jkca.2016.16.08.706
Subject(s) - computer science , garbage collection , node (physics) , key (lock) , block (permutation group theory) , tree (set theory) , flash (photography) , b tree , distributed computing , computer network , parallel computing , database , garbage , operating system , data structure , mathematics , programming language , engineering , art , structural engineering , visual arts , mathematical analysis , geometry

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom