Show simple item record

dc.identifier.urihttp://hdl.handle.net/1951/59861
dc.identifier.urihttp://hdl.handle.net/11401/71410
dc.description.sponsorshipThis work is sponsored by the Stony Brook University Graduate School in compliance with the requirements for completion of degree.en_US
dc.formatMonograph
dc.format.mediumElectronic Resourceen_US
dc.language.isoen_US
dc.publisherThe Graduate School, Stony Brook University: Stony Brook, NY.
dc.typeThesis
dcterms.abstractTraditional file systems are designed to store a moderate number of large objects. However, an increasing number of applications need also to store a large number of interrelated smaller objects, to query and update these objects and their relationships, and to maintain consistency and recoverability. Current approaches require applications to interact with multiple interfaces for different data types, making it difficult for programmers to develop error-free, efficient, and portable applications. Researchers have tried to solve this problem by using additional layers of abstraction to unify these disparate interfaces but continue to use traditional storage formats and algorithms that are optimized only for specific workloads. We have built a transactional system store that can efficiently manage a continuum of interrelated objects from small to large. Our system is based on a data structure, the VT-tree, which is an extension of the log-structured merge-tree data structure (LSM). In this thesis we describe a transactional system store design and implementation that supports high levels of concurrency and larger-than-RAM snapshot-based transactions. We then describe the design of a new transactional file system, KVFS, which is based on our transactional VT-tree. In our system, applications can perform key-value storage and POSIX file operations in the same ACID system transaction, providing support for operations such as file indexing and tagging, meta-data search, and package installation---all in a generic and flexible manner. Our experiments indicate that KVFS's performance is comparable to that of existing native file systems and its elegant transactional interface adds a minimal overhead and supports highly concurrent transactions.
dcterms.available2013-05-22T17:35:35Z
dcterms.available2015-04-24T14:47:27Z
dcterms.contributorZadok, Erezen_US
dcterms.contributorJohnson, Roben_US
dcterms.contributorPorter, Donald.en_US
dcterms.creatorShetty, Pradeep Jagannath
dcterms.dateAccepted2013-05-22T17:35:35Z
dcterms.dateAccepted2015-04-24T14:47:27Z
dcterms.dateSubmitted2013-05-22T17:35:35Z
dcterms.dateSubmitted2015-04-24T14:47:27Z
dcterms.descriptionDepartment of Computer Scienceen_US
dcterms.extent52 pg.en_US
dcterms.formatMonograph
dcterms.formatApplication/PDFen_US
dcterms.identifierhttp://hdl.handle.net/1951/59861
dcterms.identifierShetty_grad.sunysb_0771M_10965en_US
dcterms.identifierhttp://hdl.handle.net/11401/71410
dcterms.issued2012-05-01
dcterms.languageen_US
dcterms.provenanceMade available in DSpace on 2013-05-22T17:35:35Z (GMT). No. of bitstreams: 1 Shetty_grad.sunysb_0771M_10965.pdf: 812586 bytes, checksum: 0512934c512ba227f6783a9907e4c732 (MD5) Previous issue date: 1en
dcterms.provenanceMade available in DSpace on 2015-04-24T14:47:27Z (GMT). No. of bitstreams: 3 Shetty_grad.sunysb_0771M_10965.pdf.jpg: 1894 bytes, checksum: a6009c46e6ec8251b348085684cba80d (MD5) Shetty_grad.sunysb_0771M_10965.pdf.txt: 114056 bytes, checksum: a45b7b0975a7fa68f77c1615ecb52a0c (MD5) Shetty_grad.sunysb_0771M_10965.pdf: 812586 bytes, checksum: 0512934c512ba227f6783a9907e4c732 (MD5) Previous issue date: 1en
dcterms.publisherThe Graduate School, Stony Brook University: Stony Brook, NY.
dcterms.subjectComputer science
dcterms.subjectDatabase, File Systems, Key-Value Storage, LSM trees, Operating Systems, System transactions
dcterms.titleFrom Tuples to Files: a Fast Transactional System Store and File System
dcterms.typeThesis


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record