RUcore: Rutgers University Community Repository
Understanding dictionaries at the intersection of theory and practice
Descriptive
TitleInfo
Title
Understanding dictionaries at the intersection of theory and practice
Name
(type = personal)
NamePart
(type = family)
Conway
NamePart
(type = given)
Alexander
NamePart
(type = date)
1983
DisplayForm
Alexander Conway
Role
RoleTerm
(authority = RULIB);
(type = text)
author
Name
(type = personal)
NamePart
(type = family)
Farach-Colton
NamePart
(type = given)
Martin
DisplayForm
Martin Farach-Colton
Affiliation
Advisory Committee
Role
RoleTerm
(authority = RULIB)
chair
Name
(type = personal)
NamePart
(type = family)
Bernstein
NamePart
(type = given)
Aaron
DisplayForm
Aaron Bernstein
Affiliation
Advisory Committee
Role
RoleTerm
(authority = RULIB)
internal member
Name
(type = personal)
NamePart
(type = family)
Kannan
NamePart
(type = given)
Sudarsun
DisplayForm
Sudarsun Kannan
Affiliation
Advisory Committee
Role
RoleTerm
(authority = RULIB)
internal member
Name
(type = personal)
NamePart
(type = family)
Blelloch
NamePart
(type = given)
Guy
DisplayForm
Guy Blelloch
Affiliation
Advisory Committee
Role
RoleTerm
(authority = RULIB)
outside member
Name
(type = corporate)
NamePart
Rutgers University
Role
RoleTerm
(authority = RULIB)
degree grantor
Name
(type = corporate)
NamePart
School of Graduate Studies
Role
RoleTerm
(authority = RULIB)
school
TypeOfResource
Text
Genre
(authority = marcgt)
theses
OriginInfo
DateCreated
(qualifier = exact);
(encoding = w3cdtf);
(keyDate = yes)
2020
DateOther
(type = degree);
(qualifier = exact);
(encoding = w3cdtf)
2020-10
Language
LanguageTerm
(authority = ISO 639-3:2007);
(type = text)
English
Abstract
Dictionaries are fundamental data structures that associate values to a set of keys. They form the foundation of most storage systems, and are key to the performance of many algorithms.
Dictionaries are well studied from an algorithmic perspective, and many constructions of optimal dictionaries are known. However, these are rarely used in practice, and the ubiquitious implementation, the log-structured merge tree, is theoretically suboptimal.
This work studies a collection of dictionary problems, each of which lies somewhere between theory and practice. These problems take advantage of the flow of ideas back and forth betwen them, yielding interesting and surprising results, both where innovations and ideas in systems have influenced theoretical data structures, and also where those data structures form the foundation for new highly performant systems.
Dictionaries are well studied from an algorithmic perspective, and many constructions of optimal dictionaries are known. However, these are rarely used in practice, and the ubiquitious implementation, the log-structured merge tree, is theoretically suboptimal.
This work studies a collection of dictionary problems, each of which lies somewhere between theory and practice. These problems take advantage of the flow of ideas back and forth betwen them, yielding interesting and surprising results, both where innovations and ideas in systems have influenced theoretical data structures, and also where those data structures form the foundation for new highly performant systems.
Subject
(authority = local)
Topic
External memory theory
Subject
(authority = RUETD)
Topic
Computer Science
RelatedItem
(type = host)
TitleInfo
Title
Rutgers University Electronic Theses and Dissertations
Identifier
(type = RULIB)
ETD
Identifier
ETD_11238
PhysicalDescription
Form
(authority = gmd)
InternetMediaType
application/pdf
InternetMediaType
text/xml
Extent
1 online resource (ix, 136 pages)
Note
(type = degree)
Ph.D.
Note
(type = bibliography)
Includes bibliographical references
Genre
(authority = ExL-Esploro)
ETD doctoral
RelatedItem
(type = host)
TitleInfo
Title
School of Graduate Studies Electronic Theses and Dissertations
Identifier
(type = local)
rucore10001600001
Location
PhysicalLocation
(authority = marcorg);
(displayLabel = Rutgers, The State University of New Jersey)
NjNbRU
Identifier
(type = doi)
doi:10.7282/t3-q5by-xf35
Back to the top
Rights
RightsDeclaration
(ID = rulibRdec0006)
The author owns the copyright to this work.
RightsHolder
(type = personal)
Name
FamilyName
Conway
GivenName
Alexander
Role
Copyright Holder
RightsEvent
Type
Permission or license
DateTime
(encoding = w3cdtf);
(qualifier = exact);
(point = start)
2020-09-29 15:25:08
AssociatedEntity
Name
Alexander Conway
Role
Copyright holder
Affiliation
Rutgers University. School of Graduate Studies
AssociatedObject
Type
License
Name
Author Agreement License
Detail
I hereby grant to the Rutgers University Libraries and to my school the non-exclusive right to archive, reproduce and distribute my thesis or dissertation, in whole or in part, and/or my abstract, in whole or in part, in and from an electronic format, subject to the release date subsequently stipulated in this submittal form and approved by my school. I represent and stipulate that the thesis or dissertation and its abstract are my original work, that they do not infringe or violate any rights of others, and that I make these grants as the sole owner of the rights to my thesis or dissertation and its abstract. I represent that I have obtained written permissions, when necessary, from the owner(s) of each third party copyrighted matter to be included in my thesis or dissertation and will supply copies of such upon request by my school. I acknowledge that RU ETD and my school will not distribute my thesis or dissertation or its abstract if, in their reasonable judgment, they believe all such rights have not been secured. I acknowledge that I retain ownership rights to the copyright of my work. I also retain the right to use all or part of this thesis or dissertation in future works, such as articles or books.
Copyright
Status
Copyright protected
Availability
Status
Open
Reason
Permission or license
Back to the top
Technical
RULTechMD
(ID = TECHNICAL1)
ContentModel
ETD
OperatingSystem
(VERSION = 5.1)
windows xp
CreatingApplication
Version
1.5
ApplicationName
pdfTeX-1.40.21
DateCreated
(point = end);
(encoding = w3cdtf);
(qualifier = exact)
2020-10-01T14:49:36
DateCreated
(point = end);
(encoding = w3cdtf);
(qualifier = exact)
2020-10-01T14:49:36
Back to the top
Statistical Profile