{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/129394"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/129394","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Self-tuning data exploration checkpoint","abstract":"Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2025-10-19 without embargo terms","abstract_html":"Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2025-10-19 without embargo terms","abstract_has_math":false,"creators":["Chockchowwat, Supawit"],"institution":"University of Illinois Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Park, Yongjoo","Sundaram, Hari","Gupta, Indranil","Özcan, Fatma"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2025,"date_issued":"2025-04-14","date_published":"2025-04-14","updated_at":"2026-07-22T22:25:05Z","subjects":["Information Retrieval","Inverted Index","IoU Sketch","Multi-Layer Hash Table","Physical Database Design","Separation of Compute and Storage","Sketch Data Structure","Index Tuning","Hierarchical Index Design","I/O-Aware Indexing","Storage-Aware Optimization","Graph-Based Optimization","End-to-End Latency Minimization","Learned Indexes","Storage Profiling","Data Management","Transactional Python","Chipmink","Airphant","AirIndex","Data Exploration","Exploratory Data Analysis","Interactive Data Exploration","Data Science","Checkpoint","Checkpointing","Restoration","Object Store","Object Databases","Graph-Based Versioning","Object-Level Versioning","Fine-Grained Version Control","Podding","Delta Encoding","Mutable Object Storage","Data Lineage","Semantic Versioning","Version Navigation","Temporal Database","Branching","In-Memory State Management","Immutable Snapshots","Time-Travel Queries","Storage Efficiency","Incremental Checkpointing","Version Indexing","Change Tracking","Non-Linear Histories","Lightweight Snapshotting","Data Reproducibility","Cloud Storage","Database as a Service","Indexing"],"languages":["en","eng"],"rights":["Copyright 2025 Supawit Chockchowwat"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/2142/129394","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Park, Yongjoo","Sundaram, Hari","Gupta, Indranil","Özcan, Fatma"]},{"key":"dc:creator","label":"Author","values":["Chockchowwat, Supawit"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2025-04-14","2025-05"]},{"key":"dc:type","label":"Dc Type","values":["text","Thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Information Retrieval","Inverted Index","IoU Sketch","Multi-Layer Hash Table","Physical Database Design","Separation of Compute and Storage","Sketch Data Structure","Index Tuning","Hierarchical Index Design","I/O-Aware Indexing","Storage-Aware Optimization","Graph-Based Optimization","End-to-End Latency Minimization","Learned Indexes","Storage Profiling","Data Management","Transactional Python","Chipmink","Airphant","AirIndex","Data Exploration","Exploratory Data Analysis","Interactive Data Exploration","Data Science","Checkpoint","Checkpointing","Restoration","Object Store","Object Databases","Graph-Based Versioning","Object-Level Versioning","Fine-Grained Version Control","Podding","Delta Encoding","Mutable Object Storage","Data Lineage","Semantic Versioning","Version Navigation","Temporal Database","Branching","In-Memory State Management","Immutable Snapshots","Time-Travel Queries","Storage Efficiency","Incremental Checkpointing","Version Indexing","Change Tracking","Non-Linear Histories","Lightweight Snapshotting","Data Reproducibility","Cloud Storage","Database as a Service","Indexing"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en","eng"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2025 Supawit Chockchowwat"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://hdl.handle.net/2142/129394"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2025-10-19 without embargo terms","The student, Supawit Chockchowwat, accepted the attached license on 2025-04-13 at 15:13.","The student, Supawit Chockchowwat, submitted this Dissertation for approval on 2025-04-13 at 15:40.","This Dissertation was approved for publication on 2025-04-14 at 12:33.","DSpace SAF Submission Ingestion Package generated from Vireo submission #21756 on 2025-10-19 at 18:18:11","Interactive data exploration has become a cornerstone of modern data science, empowering analysts and researchers to iteratively develop insights using computational notebooks such as Jupyter. However, these exploratory workflows often suffer from a lack of robust mechanisms to persist and restore program state, leading to risks of state loss, redundant recomputation, and inefficient trial-and-error cycles. Current data exploration tools provide limited support for systematic state checkpointing and restoration, imposing heavy computational and storage costs when naively implemented. This thesis argues that it is possible to efficiently checkpoint and restore exploration states with self-tuning data systems. We identify two key challenges in this domain: (1) the high overhead and interruptions caused by capturing and storing exploration states, and (2) the delays and downtimes incurred when restoring fragmented checkpoint data from diverse storage environments. To address these challenges, this thesis presents three core systems that together enable practical and performant checkpointing. First, we introduce Chipmink, a delta object store that leverages graph-based dirty object identification to capture fine-grained state changes with minimal overhead. Chipmink introduces techniques such as podding, learned volatility models, and asynchronous checkpointing to significantly reduce checkpointing time and storage consumption to seconds compare to minutes by existing solutions and at most GBs compared to hundreds of GBs. Second, we present Airphant, an automatically tuned filtering system that accelerates fragment retrieval in high-latency cloud storage. By using a novel IoU Sketch filter, Airphant supports concurrent batched I/O operations, reducing data retrieval latency to within hundreds of milliseconds even under cloud storage. Third, we develop AirIndex, an automatically tuned hierarchical indexes that learns from data and I/O characteristics to optimize lookup paths dynamically. AirIndex formulates an index search problem over a large design space and leverages a purpose-built search algorithm to select optimal index configurations. It delivers faster lookup performance compared to traditional and learned indexes. Together, these systems demonstrate that self-tuning data structures can overcome the performance and cost barriers of checkpointing and restoration in interactive data exploration. This thesis contributes new methods and system designs that enable resilient, efficient, and user-transparent state management for computational notebooks—paving the way toward more interactive, fault-tolerant, and productive data science workflows."]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Self-tuning data exploration checkpoint"]}]}],"canonical_facts":{"dc:contributor":["Park, Yongjoo","Sundaram, Hari","Gupta, Indranil","Özcan, Fatma"],"dc:creator":["Chockchowwat, Supawit"],"dc:date":["2025-04-14","2025-05"],"dc:description":["Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2025-10-19 without embargo terms","The student, Supawit Chockchowwat, accepted the attached license on 2025-04-13 at 15:13.","The student, Supawit Chockchowwat, submitted this Dissertation for approval on 2025-04-13 at 15:40.","This Dissertation was approved for publication on 2025-04-14 at 12:33.","DSpace SAF Submission Ingestion Package generated from Vireo submission #21756 on 2025-10-19 at 18:18:11","Interactive data exploration has become a cornerstone of modern data science, empowering analysts and researchers to iteratively develop insights using computational notebooks such as Jupyter. However, these exploratory workflows often suffer from a lack of robust mechanisms to persist and restore program state, leading to risks of state loss, redundant recomputation, and inefficient trial-and-error cycles. Current data exploration tools provide limited support for systematic state checkpointing and restoration, imposing heavy computational and storage costs when naively implemented. This thesis argues that it is possible to efficiently checkpoint and restore exploration states with self-tuning data systems. We identify two key challenges in this domain: (1) the high overhead and interruptions caused by capturing and storing exploration states, and (2) the delays and downtimes incurred when restoring fragmented checkpoint data from diverse storage environments. To address these challenges, this thesis presents three core systems that together enable practical and performant checkpointing. First, we introduce Chipmink, a delta object store that leverages graph-based dirty object identification to capture fine-grained state changes with minimal overhead. Chipmink introduces techniques such as podding, learned volatility models, and asynchronous checkpointing to significantly reduce checkpointing time and storage consumption to seconds compare to minutes by existing solutions and at most GBs compared to hundreds of GBs. Second, we present Airphant, an automatically tuned filtering system that accelerates fragment retrieval in high-latency cloud storage. By using a novel IoU Sketch filter, Airphant supports concurrent batched I/O operations, reducing data retrieval latency to within hundreds of milliseconds even under cloud storage. Third, we develop AirIndex, an automatically tuned hierarchical indexes that learns from data and I/O characteristics to optimize lookup paths dynamically. AirIndex formulates an index search problem over a large design space and leverages a purpose-built search algorithm to select optimal index configurations. It delivers faster lookup performance compared to traditional and learned indexes. Together, these systems demonstrate that self-tuning data structures can overcome the performance and cost barriers of checkpointing and restoration in interactive data exploration. This thesis contributes new methods and system designs that enable resilient, efficient, and user-transparent state management for computational notebooks—paving the way toward more interactive, fault-tolerant, and productive data science workflows."],"dc:format":["application/pdf"],"dc:identifier":["https://hdl.handle.net/2142/129394"],"dc:language":["en","eng"],"dc:rights":["Copyright 2025 Supawit Chockchowwat"],"dc:subject":["Information Retrieval","Inverted Index","IoU Sketch","Multi-Layer Hash Table","Physical Database Design","Separation of Compute and Storage","Sketch Data Structure","Index Tuning","Hierarchical Index Design","I/O-Aware Indexing","Storage-Aware Optimization","Graph-Based Optimization","End-to-End Latency Minimization","Learned Indexes","Storage Profiling","Data Management","Transactional Python","Chipmink","Airphant","AirIndex","Data Exploration","Exploratory Data Analysis","Interactive Data Exploration","Data Science","Checkpoint","Checkpointing","Restoration","Object Store","Object Databases","Graph-Based Versioning","Object-Level Versioning","Fine-Grained Version Control","Podding","Delta Encoding","Mutable Object Storage","Data Lineage","Semantic Versioning","Version Navigation","Temporal Database","Branching","In-Memory State Management","Immutable Snapshots","Time-Travel Queries","Storage Efficiency","Incremental Checkpointing","Version Indexing","Change Tracking","Non-Linear Histories","Lightweight Snapshotting","Data Reproducibility","Cloud Storage","Database as a Service","Indexing"],"dc:title":["Self-tuning data exploration checkpoint"],"dc:type":["text","Thesis"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois Urbana-Champaign"]},"updated_at":"2026-07-22T22:25:05Z"}