Advanced Search
DSpace@MIT

Cache-oblivious dynamic search trees

Research and Teaching Output of the MIT Community

Show simple item record

dc.contributor.advisor Bradley Kuszmaul. en_US
dc.contributor.author Kasheff, Zardosht, 1981- en_US
dc.contributor.other Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. en_US
dc.date.accessioned 2005-09-26T20:20:04Z
dc.date.available 2005-09-26T20:20:04Z
dc.date.copyright 2004 en_US
dc.date.issued 2004 en_US
dc.identifier.uri http://hdl.handle.net/1721.1/28417
dc.description Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004. en_US
dc.description Includes bibliographical references (leaves 57-60). en_US
dc.description.abstract I have implemented a cache-oblivious dynamic search tree as an alternative to the ubiquitious B-tree. I use a binary tree with a "van Endcle Boas" layout whose leaves point to intervals in a "packed memory structure". We refer to the data structure as a COB-Tree. The COB-Tree supports efficient lookup, as well as efficient amortized insertion and deletion. Efficient implementation of a B-tree requires understanding the cache-line size and page size and is optimized for a specific memory hierarchy. In contrast, the COB-Tree contains no machine-dependent variables, performs well on any memory hierarchy, and requires minimal user-level memory management. For random insertion of data, my data structure performs 7.5 times faster than the Berkeley DB and 3 times faster than a memory mapped implementation of B-trees. The packed memory array of the COB-Tree maintains data in sorted order, allows sequential reads at high speeds, and data insertions and deletions with few data writes on average. In addition, the data, structure is easy to implement because I employed memory mapping rather than explicit file operations. en_US
dc.description.statementofresponsibility by Zardosht Kasheff. en_US
dc.format.extent 60 leaves en_US
dc.format.extent 2153704 bytes
dc.format.extent 2159101 bytes
dc.format.mimetype application/pdf
dc.format.mimetype application/pdf
dc.language.iso en_US
dc.publisher Massachusetts Institute of Technology en_US
dc.rights M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. en_US
dc.rights.uri http://dspace.mit.edu/handle/1721.1/7582
dc.subject Electrical Engineering and Computer Science. en_US
dc.title Cache-oblivious dynamic search trees en_US
dc.title.alternative Partial parallelization of graph partitioning algorithm METIS en_US
dc.type Thesis en_US
dc.description.degree M.Eng. en_US
dc.contributor.department Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. en_US
dc.identifier.oclc 56986359 en_US


Files in this item

Name Size Format Description
56986359.pdf 2.634Mb PDF Preview, non-printable (open to all)
56986359-MIT.pdf 2.630Mb PDF Full printable version (MIT only)

This item appears in the following Collection(s)

Show simple item record

MIT-Mirage