{"id":{"repo_id":"bu","oai_identifier":"oai:open.bu.edu:2144/53397"},"canonical_url":"https://search.ndltd.org/etd/bu/oai:open.bu.edu:2144/53397","repository":{"repo_id":"bu","name":"Boston University","base_url":"https://open.bu.edu/oai/request"},"display":{"title":"Developing instance-optimal data systems for modern applications","abstract":"As data systems are deployed across increasingly diverse diverse applications, \\textit{instance-optimal} data systems have emerged in an effort to build tools that are capable of being custom-tailored to the application at hand without extensive re-tuning or redeployment. A data system is considered \\textit{instantiated} when it is deployed in a specific \\textit{environment} to process a particular \\textit{workload}. Instance-optimal data systems, therefore, leverage both workload characteristics and execution environments to achieve superior system performance. Workload characteristics encompass factors such as \\textbf{access skew} and \\textbf{matching skew}. Access skew occurs when certain portions of a dataset are queried significantly more frequently than others, while matching skew in join operations arises when some records in one table match disproportionately more records in another table. The execution environment encompasses both \\textbf{hardware constraints} and \\textbf{privacy requirements}. From a hardware perspective, instance-optimal systems must operate efficiently under memory limitations while maximizing the benefits of modern storage technologies, such as NVMe SSDs. Additionally, evolving data management requirements can also demand adaptable systems that balance performance with constraints such as data retention policies and efficient storage management. This thesis explores the impact of both workload and environment characteristics on overall system performance. We formalize multiple instance-optimization problems to exploit workload and environment characteristics across different components of the database system. Furthermore, we propose efficient algorithms that impose minimal CPU overhead on storage-based systems. Our evaluation demonstrates that instance-optimal algorithms can significantly outperform the state-of-the-art techniques, achieving up to a 2\\times performance","abstract_html":"As data systems are deployed across increasingly diverse diverse applications, \\textit{instance-optimal} data systems have emerged in an effort to build tools that are capable of being custom-tailored to the application at hand without extensive re-tuning or redeployment. A data system is considered \\textit{instantiated} when it is deployed in a specific \\textit{environment} to process a particular \\textit{workload}. Instance-optimal data systems, therefore, leverage both workload characteristics and execution environments to achieve superior system performance. Workload characteristics encompass factors such as \\textbf{access skew} and \\textbf{matching skew}. Access skew occurs when certain portions of a dataset are queried significantly more frequently than others, while matching skew in join operations arises when some records in one table match disproportionately more records in another table. The execution environment encompasses both \\textbf{hardware constraints} and \\textbf{privacy requirements}. From a hardware perspective, instance-optimal systems must operate efficiently under memory limitations while maximizing the benefits of modern storage technologies, such as NVMe SSDs. Additionally, evolving data management requirements can also demand adaptable systems that balance performance with constraints such as data retention policies and efficient storage management. This thesis explores the impact of both workload and environment characteristics on overall system performance. We formalize multiple instance-optimization problems to exploit workload and environment characteristics across different components of the database system. Furthermore, we propose efficient algorithms that impose minimal CPU overhead on storage-based systems. Our evaluation demonstrates that instance-optimal algorithms can significantly outperform the state-of-the-art techniques, achieving up to a 2\\times performance","abstract_has_math":false,"creators":["Zhu, Zichen"],"institution":"Boston University","degree_name":"Doctor of Philosophy","degree_level":"doctoral","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":[],"advisors":["Athanassoulis, Manos"],"committee_chairs":[],"committee_members":[],"year":2025,"date_issued":"2025","date_published":"2025","updated_at":"2026-11-18T19:45:14Z","subjects":["Computer science","Database system","Instance-optimal"],"languages":["en_US"],"rights":["Attribution-NonCommercial-NoDerivatives 4.0 International"],"rights_urls":["http://creativecommons.org/licenses/by-nc-nd/4.0/"],"identifier_entries":[],"person_identifier_entries":[{"key":"dc:identifier.orcid","label":"ORCID","values":["0000-0002-9197-4649"],"render_values":[{"text":"0000-0002-9197-4649","href":"https://orcid.org/0000-0002-9197-4649","code":true}]}]},"links":{"outbound_url":"https://hdl.handle.net/2144/53397","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"https://hdl.handle.net/2144/53397","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier.uri","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://open.bu.edu/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Aopen.bu.edu%3A2144%2F53397","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Athanassoulis, Manos"]},{"key":"dc:creator","label":"Author","values":["Zhu, Zichen"]},{"key":"dc:identifier.orcid","label":"ORCID","values":["0000-0002-9197-4649"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2026-07-30T12:54:21Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2026-07-30T12:54:21Z"]},{"key":"dc:date.issued","label":"Date","values":["2025"]},{"key":"dc:date.updated","label":"Dc Date Updated","values":["2026-07-21T22:15:58Z"]},{"key":"dc:type","label":"Dc Type","values":["Thesis/Dissertation"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["doctoral"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Doctor of Philosophy"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Boston University"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Computer science","Database system","Instance-optimal"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en_US"]},{"key":"dc:rights","label":"Dc Rights","values":["Attribution-NonCommercial-NoDerivatives 4.0 International"]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://creativecommons.org/licenses/by-nc-nd/4.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/2144/53397"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["2025"]},{"key":"dc:description.abstract","label":"Abstract","values":["As data systems are deployed across increasingly diverse diverse applications, \\textit{instance-optimal} data systems have emerged in an effort to build tools that are capable of being custom-tailored to the application at hand without extensive re-tuning or redeployment. A data system is considered \\textit{instantiated} when it is deployed in a specific \\textit{environment} to process a particular \\textit{workload}. Instance-optimal data systems, therefore, leverage both workload characteristics and execution environments to achieve superior system performance. Workload characteristics encompass factors such as \\textbf{access skew} and \\textbf{matching skew}. Access skew occurs when certain portions of a dataset are queried significantly more frequently than others, while matching skew in join operations arises when some records in one table match disproportionately more records in another table. The execution environment encompasses both \\textbf{hardware constraints} and \\textbf{privacy requirements}. From a hardware perspective, instance-optimal systems must operate efficiently under memory limitations while maximizing the benefits of modern storage technologies, such as NVMe SSDs. Additionally, evolving data management requirements can also demand adaptable systems that balance performance with constraints such as data retention policies and efficient storage management. This thesis explores the impact of both workload and environment characteristics on overall system performance. We formalize multiple instance-optimization problems to exploit workload and environment characteristics across different components of the database system. Furthermore, we propose efficient algorithms that impose minimal CPU overhead on storage-based systems. Our evaluation demonstrates that instance-optimal algorithms can significantly outperform the state-of-the-art techniques, achieving up to a 2\\times performance"]},{"key":"dc:title","label":"Title","values":["Developing instance-optimal data systems for modern applications"]}]}],"canonical_facts":{"dc:contributor.advisor":["Athanassoulis, Manos"],"dc:creator":["Zhu, Zichen"],"dc:date.accessioned":["2026-07-30T12:54:21Z"],"dc:date.available":["2026-07-30T12:54:21Z"],"dc:date.issued":["2025"],"dc:date.updated":["2026-07-21T22:15:58Z"],"dc:description":["2025"],"dc:description.abstract":["As data systems are deployed across increasingly diverse diverse applications, \\textit{instance-optimal} data systems have emerged in an effort to build tools that are capable of being custom-tailored to the application at hand without extensive re-tuning or redeployment. A data system is considered \\textit{instantiated} when it is deployed in a specific \\textit{environment} to process a particular \\textit{workload}. Instance-optimal data systems, therefore, leverage both workload characteristics and execution environments to achieve superior system performance. Workload characteristics encompass factors such as \\textbf{access skew} and \\textbf{matching skew}. Access skew occurs when certain portions of a dataset are queried significantly more frequently than others, while matching skew in join operations arises when some records in one table match disproportionately more records in another table. The execution environment encompasses both \\textbf{hardware constraints} and \\textbf{privacy requirements}. From a hardware perspective, instance-optimal systems must operate efficiently under memory limitations while maximizing the benefits of modern storage technologies, such as NVMe SSDs. Additionally, evolving data management requirements can also demand adaptable systems that balance performance with constraints such as data retention policies and efficient storage management. This thesis explores the impact of both workload and environment characteristics on overall system performance. We formalize multiple instance-optimization problems to exploit workload and environment characteristics across different components of the database system. Furthermore, we propose efficient algorithms that impose minimal CPU overhead on storage-based systems. Our evaluation demonstrates that instance-optimal algorithms can significantly outperform the state-of-the-art techniques, achieving up to a 2\\times performance"],"dc:identifier.orcid":["0000-0002-9197-4649"],"dc:identifier.uri":["https://hdl.handle.net/2144/53397"],"dc:language.iso":["en_US"],"dc:rights":["Attribution-NonCommercial-NoDerivatives 4.0 International"],"dc:rights.uri":["http://creativecommons.org/licenses/by-nc-nd/4.0/"],"dc:subject":["Computer science","Database system","Instance-optimal"],"dc:title":["Developing instance-optimal data systems for modern applications"],"dc:type":["Thesis/Dissertation"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["doctoral"],"thesis:degree_name":["Doctor of Philosophy"],"thesis:institution_name":["Boston University"]},"updated_at":"2026-11-18T19:45:14Z"}