Locks with Constrained Sharing: A Proposal

具有约束共享的锁：一项提案

• 批准号: 9004998
• 负责人: Amr El Abbadi
• 金额: $ 19.1万
• 依托单位: University of California-Santa Barbara
• 依托单位国家: 美国
• 项目类别: Continuing Grant
• 财政年份: 1990
• 资助国家: 美国
• 起止时间: 1990-09-01 至 1993-08-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=9004998&HistoricalAwards=false
• 关键词: Locks; Constrained; Sharing; Proposal

This research address the problem of providing efficient transactional access to distributed databases. A new mode of locks, termed ordered-shared mode, is proposed that permits data sharing in a constrained manner. A family of locking-based concurrency control protocols is developed by using three modes of locks: shared, ordered-shared, and non-shared. The strictest protocol in this family is the two phase locking protocol for databases, while the most permissive recognizes all conflict- preserving serializable histories. This is the first locking- based concurrency protocol that recognizes the entire class of conflict-preserving serializable histories. Theoretical and empirical studies of these protocols will be conducted during this project. The theoretical comparison is based on the analysis of sets of histories produced by the protocols. The empirical analysis involves building a performance model and a database system test-bed. Distributed database concurrency control protocols based on ordered-shared locks will be developed and implemented on a distributed database test-bed. Finally, the new mode of locks will be used to develop protocols for database system recovery, nested transactions, and abstract data types.

这项研究解决了提供有效的 对分布式数据库的事务访问。 新模式 锁，称为有序共享模式，提出了允许数据 以一种受约束的方式分享。 一个基于锁定的 采用三种模式开发了并发控制协议 锁的类型：共享、有序共享和非共享。 最严格的 该系列中的协议是两阶段锁定协议， 数据库，而最宽容的承认所有冲突- 保存可序列化的历史。 这是第一次锁定- 的并发协议，该协议可以识别整个 冲突保留可序列化历史。 理论和 这些协议的实证研究将在 这个项目在分析的基础上进行了理论比较 由协议产生的一系列历史记录。 实证 分析涉及构建性能模型和数据库 系统试验台 分布式数据库并发控制 将开发基于有序共享锁的协议， 在分布式数据库测试平台上实现。 最后 一种新的锁模式将用于开发数据库协议 系统恢复、嵌套事务和抽象数据类型。