Back to Results
First PageMeta Content
Data management / Binary trees / B+ tree / Trie / Tree traversal / Database index / Tree / Flash memory / Tango tree / B-tree / Graph theory / Computing


Indexing Structures for ash based Solid State Drives SeungBum Jo1,3 , Vineet Pandey2,3 , and S. Srinivasa Rao1 1 School of Computer Science and Engineering, Seoul National University, Seoul, Republic of Korea sb
Add to Reading List

Document Date: 2011-11-11 12:59:22

Open Document

File Size: 265,35 KB

Share Result on Facebook

Country

South Korea / India / /

/

Facility

To store / Seoul National University / /

IndustryTerm

memory algorithms / faster technology / ubiquitous and indispensable storage devices / search key / dememory devices / sensor networks / ashmemory storage systems / ash-based storage devices / Flash memory devices / search path / search complexity / search cost / ash memory devices / online algorithm / computing / search procedure rst / ash devices / normal search operation / rst search / /

Organization

Seoul National University / Seoul / School of Computer Science and Engineering / European Union / IEEE Computer Society / /

Person

Dong-Joo Park / Jeong-Uk Kang / Tae-Sun Chung / Suman Nath / Deepak Ajwani / Deepak Ganesan / Ramesh Sitaraman / Tei-Wei Kuo / Yinan Li / Ha-Joo Song / Bongki Moon / Sangwon Park / Sang-Won Lee / Devesh Agrawal / Jin-Soo Kim / Dongwon Kang / Yanlei Diao / Douglas Comer / Shashi Singh / Li Ping Chang / Aman Kansal / Riko Jacob / Andreas Beckmann / Robin Jun Yang / Ke Yi / Dong-Ho Lee / Dawoon Jung / Ulrich Meyer / Qiong Luo / Chin-Hsien Wu / Bingsheng He / Gabriel Moruz / /

Position

editor / BR BW BU General / /

PublishedMedium

Lecture Notes in Computer Science / /

Technology

Flash memory / faster technology / ADAPT algorithm / raw NAND memory algorithms / dbms / Flash / /

SocialTag