Instance-Optimized Data Structures for Membership Queries
Name
Vaidya-kapilv-PhD-2023-EECS-thesis.pdf
Description
Thesis PDF
Size
5.85 MB
Format
Adobe PDF
Checksum (MD5)
76c2eb33fc539f68067d3e3c90fff7b4
Author(s)
Vaidya, Kapil Eknath
Advisor(s)
Kraska, Tim
Date Issued
February 2023
Publisher
Massachusetts Institute of Technology
Abstract
We are near the end of Moore’s law and hardware growth has hit a stagnation. Modern data processing systems need to continuously improve their performance to match the humongous growth of data. Data structures and algorithms such as sorting, indexes, filters, hash tables, query optimization, etc are the fundamental building blocks of these systems and dictate their performance. Traditional data structures and algorithms provide worst-case guarantees by making no assumptions about the data or workload. Thus, the resulting data processing system gives an adequate performance in the average case but may not be optimal for a particular use case. In this thesis, we will look at how to redesign membership query data structures so they can automatically adapt to an individual use case. These instance-optimized data structures act as drop in replacements for their counterparts in systems and improve their performance without any significant overhaul of the system or labor-intensive manual tuning.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
In Copyright - Educational Use Permitted
Copyright MIT
Persistent DSpace Link
