Scribd
Upload
40 views4 pages

NPTEL Course Jan 2012: Storage Systems

This document provides an overview of storage systems and discusses naming, storing, and accessing objects as well as issues with large persistent data structures. It notes that naming involves giving objects a name which can involve processing, while storing may involve reads, writes, compression, encryption or deduplication. Access involves device-specific aspects that determine speed such as sequential, non-sequential or random reads and in-place or out-of-place writes. When processing large data structures, parts need to be brought into memory, creating two copies: in memory and on disk. Algorithmic aspects must be carefully handled to ensure atomicity and consistency with billions of objects and gigabytes in size, as new algorithms are needed as scale changes over time.

Uploaded by

Souptik Sen
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
40 views4 pages

NPTEL Course Jan 2012: Storage Systems

This document provides an overview of storage systems and discusses naming, storing, and accessing objects as well as issues with large persistent data structures. It notes that naming involves giving objects a name which can involve processing, while storing may involve reads, writes, compression, encryption or deduplication. Access involves device-specific aspects that determine speed such as sequential, non-sequential or random reads and in-place or out-of-place writes. When processing large data structures, parts need to be brought into memory, creating two copies: in memory and on disk. Algorithmic aspects must be carefully handled to ensure atomicity and consistency with billions of objects and gigabytes in size, as new algorithms are needed as scale changes over time.

Uploaded by

Souptik Sen
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Storage Systems

NPTEL Course
Jan 2012
(Lecture 03)
K. Gopinath
Indian Institute o Science

!aming and Storing

"#o important unctions$

Gi%e a name to an o&'ect

Can in%o(%e some processing (eg. add name to an inde))

*r+ name itse( may &e computed &ased on contents

Store an o&'ect

,ay in%o(%e other reads or stores-

,ay in%o(%e signiicant computation

Compression+ encryption+ coding+ or dedup(ication$ remo%e


redundancy

,ay need to .eep au). inormation a&out o&'ect

,etadata %s data/ recursion0 (metadata a&out metadata...)

,etadata (oss %s data (oss

1ccess (r2#)$ de%ice speciic aspects determine speed

3eads se4uentia(+ non5se4uentia( or random

6rites in5p(ace or out5o5p(ace



Large persistent data structures

7or processing+ parts need to &e &rought into mem.

"#o copies$ 8in memory9 and 8on5dis.9

1tomicity and Consistency issues

1(gorithmic aspects need to &e careu((y ta.en care o

!um&er o o&'ects can &e in &i((ions

Si:e o o&'ect can &e in giga&ytes

1s time progresses+ ne#er a(gs needed as sca(e changes

,ai( directories can ha%e 1000;s o msgs+ each a i(e-

Creating a i(e re4uires (oc.ing directory

Concurrent creates to same directory may &ecome (oc.5


&ound

Critica( #ith #e&5(e%e( storage systems

,any ne#er mode(s (eg. .ey5%a(ue stores) since c. 2000



<)t2 7S
(rom 6i.ipedia)

You might also like