서브메뉴
검색
Algebraic Approaches to Distributed Data Systems
Algebraic Approaches to Distributed Data Systems
상세정보
- 자료유형
- 학위논문 서양
- 최종처리일시
- 20260202103610
- ISBN
- 9798288863462
- DDC
- 004
- 저자명
- Power, Conor.
- 서명/저자
- Algebraic Approaches to Distributed Data Systems
- 발행사항
- [Sl] : University of California, Berkeley, 2025
- 발행사항
- Ann Arbor : ProQuest Dissertations & Theses, 2025
- 형태사항
- 111 p
- 주기사항
- Source: Dissertations Abstracts International, Volume: 87-01, Section: B.
- 주기사항
- Advisor: Hellerstein, Joseph M.
- 학위논문주기
- Thesis (Ph.D.)--University of California, Berkeley, 2025.
- 초록/해제
- 요약With the rise of cloud computing, software systems have become increasingly distributed. Distributed systems offer myriad benefits such as scalability, availability, and fault tolerance. However, they introduce complexity for the programmers of these systems to ensure correctness and hide non-determinism from the end-user. To address this challenge of programming cloud-scale systems, the Hydro project at Berkeley explores bringing declarative programming to the distributed systems space. Declarative programming has had enormous success in the field of databases in the form of SQL. Its benefit is that it allows developers to specify their goals at a high level and leave complex implementation decisions up to the database system.In this thesis, we explore the marriage of these two worlds: distributed systems programming and declarative database systems. In pursuit of this marriage, we study independent trends towards algebraic models in distributed systems and database systems. This thesis extends these works, explores the relationship between them, and demonstrates the practical applicability of algebraic properties to optimizing distributed data systems. In particular, we study four lines of research on algebraic properties for distributed data systems: conflict-free replicated data types (CRDTs), algebraic models of incremental view maintenance (IVM), parallel database aggregates, and the CALM Theorem. While these topics have been studied under different formalisms across different research communities, we are able to build bridges between them. We are able to bring the system model and mathematical model of CRDTs, studied in the distributed systems and programming languages communities, to these three other topics that have been studied entirely within the databases research community. The result is a foundation on which to support the benefits of declarativity in distributed systems programming.
- 일반주제명
- Computer science
- 일반주제명
- Applied mathematics
- 일반주제명
- Information technology
- 키워드
- Cloud computing
- 키워드
- Databases
- 키워드
- Software systems
- 기타저자
- University of California, Berkeley Computer Science
- 기본자료저록
- Dissertations Abstracts International. 87-01B.
- 전자적 위치 및 접속
- 로그인 후 원문을 볼 수 있습니다.
MARC
008260126s2025 us c eng d■001000017357858
■00520260202103610
■006m o d
■007cr#unu||||||||
■020 ▼a9798288863462
■035 ▼a(MiAaPQ)AAI32043063
■040 ▼aMiAaPQ▼cMiAaPQ
■0820 ▼a004
■1001 ▼aPower, Conor.
■24510▼aAlgebraic Approaches to Distributed Data Systems
■260 ▼a[Sl]▼bUniversity of California, Berkeley▼c2025
■260 1▼aAnn Arbor▼bProQuest Dissertations & Theses▼c2025
■300 ▼a111 p
■500 ▼aSource: Dissertations Abstracts International, Volume: 87-01, Section: B.
■500 ▼aAdvisor: Hellerstein, Joseph M.
■5021 ▼aThesis (Ph.D.)--University of California, Berkeley, 2025.
■520 ▼aWith the rise of cloud computing, software systems have become increasingly distributed. Distributed systems offer myriad benefits such as scalability, availability, and fault tolerance. However, they introduce complexity for the programmers of these systems to ensure correctness and hide non-determinism from the end-user. To address this challenge of programming cloud-scale systems, the Hydro project at Berkeley explores bringing declarative programming to the distributed systems space. Declarative programming has had enormous success in the field of databases in the form of SQL. Its benefit is that it allows developers to specify their goals at a high level and leave complex implementation decisions up to the database system.In this thesis, we explore the marriage of these two worlds: distributed systems programming and declarative database systems. In pursuit of this marriage, we study independent trends towards algebraic models in distributed systems and database systems. This thesis extends these works, explores the relationship between them, and demonstrates the practical applicability of algebraic properties to optimizing distributed data systems. In particular, we study four lines of research on algebraic properties for distributed data systems: conflict-free replicated data types (CRDTs), algebraic models of incremental view maintenance (IVM), parallel database aggregates, and the CALM Theorem. While these topics have been studied under different formalisms across different research communities, we are able to build bridges between them. We are able to bring the system model and mathematical model of CRDTs, studied in the distributed systems and programming languages communities, to these three other topics that have been studied entirely within the databases research community. The result is a foundation on which to support the benefits of declarativity in distributed systems programming.
■590 ▼aSchool code: 0028.
■650 4▼aComputer science
■650 4▼aApplied mathematics
■650 4▼aInformation technology
■653 ▼aCloud computing
■653 ▼aDatabases
■653 ▼aDistributed systems
■653 ▼aSoftware systems
■653 ▼aAlgebraic properties
■690 ▼a0984
■690 ▼a0489
■690 ▼a0800
■690 ▼a0364
■71020▼aUniversity of California, Berkeley▼bComputer Science.
■7730 ▼tDissertations Abstracts International▼g87-01B.
■790 ▼a0028
■791 ▼aPh.D.
■792 ▼a2025
■793 ▼aEnglish
■85640▼uhttp://www.riss.kr/pdu/ddodLink.do?id=T17357858▼nKERIS▼z이 자료의 원문은 한국교육학술정보원에서 제공합니다.
