• Supplementary videos were posted on Blackboard. Please, refer to Piazza for details.
• The following content was covered during the first week:
Lectures slides
• Introduction,   DDBMS,   Distributed DB background
• Dist. DB Architecture,   Dist. DB Design - Fragmentation,  Dist. DB Design - Data Location
• Implementation issues and RAID system
Book slides
• Ch1-Introduction
• Ch2-Background
• Ch3-Distribution Design
• Ch4-Data Integration
• Ch5-Semantic
• If possible, browse the following papers to know more about implementation issues (while building DDBMS):
• Building Distributed Database Systems, Bharat Bhargava.
• The Raid Distributed Database System, Bharat Bhargava and John Riedl, IEEE Trans on Software Engineering, 15(6), June 1989.
• Furthermore, for communication data and some measurements refer to the following paper:
• Communication Facilities for Distributed Transaction Processing Systems, E. Mafla, and B. Bhargava, IEEE Computer, 24(8), 1991.

• Concurrency Control in Database Systems Bharat Bhargava, IEEE Trans on Knowledge and Data Engineering,11(1), Jan.-Feb. 1999
• Appendix is the model for transactions and histories but classes of serializability and event ordering is in the appendix in A Causal Model for Analyzing Distributed Concurrency Control Algorithms, B. Bhargava and C. Hua, IEEE Trans. on Software Engineering, SE-9, 470-486, 1983
• Time, Clocks, and the Ordering of Events in a Distributed System, Lamport, Leslie. Communications of the ACM 21.7 (1978): 558-565.

• Real-time lock-based concurrency control in distributed database systems. O. Ulusoy, G. Belford. Proceedings of the 12th International Conference on Distributed Computing Systems, 1992.
• Adaptability Experiments in the RAID Distributed Database System, B. Bhargava, K. Friesen, A. Helal, and J. Riedl. Adaptability Experiments in the Raid Distributed Database Systems, in Proceedings of Ninth IEEE Symposium on Reliability in Distributed Systems, Huntsville, AL, October 1990

In next few weeks, please read:

• Nonblocking commit protocols, D. Skeen, ACM SIGMOD, 1981.
• A Decentralized Termination Protocol, D. Skeen, IEEE Symposium on Reliability in Distributed Software and Database Systems, July, 1981.
• A Formal Model of Crash Recovery in a Distributed System, D. Skeen and M. Stonebraker, IEEE Trans. on Software Engineering, 9(3): 219-228, 1983

Recommended reading:

• Pivot Tracing: Dynamic Causal Monitoring for Distributed Systems. J. Mace, R. Roelke, & R. Fonseca. ACM Transactions on Computer Systems (TOCS), 35(4), 1-28. 2020, March.

Jeff Ullman's book handouts should give you a good background about Concurrency Control.

• 2PL and Conflict Graph (Proof of 2PL). [pdf]
• Locking-Serializability. [pdf]
• Optimistic-timestamps-Failure-Commitment. [pdf]

Please, read the paper by Skeen. In particular, you can see the "prepare to commit" discussion on page 139 onwards in:

• Nonblocking commit protocols. D. Skeen, ACM SIGMOD, 1981.

Please, read the lecture slides and related slides from the Textbook for preparing for midterm exam.

You should have read some paper such as:

• Building Distributed Database Systems, Bharat Bhargava.
• The Raid Distributed Database System, Bharat Bhargava and John Riedl, IEEE Trans on Software Engineering, 15(6), June 1989.
• The serializability of concurrent database updates, C. Papadimitriou, Journal of the ACM (JACM), 26(4), 1979.
• Nonblocking commit protocols. D. Skeen, ACM SIGMOD, 1981.
• A Decentralized Termination Protocol, D. Skeen, IEEE Symposium on Reliability in Distributed Software and Database Systems, July, 1981.
• A Formal Model of Crash Recovery in a Distributed System, D. Skeen and M. Stonebraker, IEEE Trans. on Software Engineering, 9(3): 219-228, 1983

Lecture Slides:

• Introduction,   DDBMS,   Distributed DB background
• Dist. DB Architecture,   Dist. DB Design - Fragmentation,  Dist. DB Design - Data Location
• Implementation issues and RAID system,  Dist. Query Processing,   Dist. Query Optimization
• Dist. Transaction Management:   Transaction Concepts,   ACID, Transaction Models
• Concurrency Control Ideas,  Concurrency Control Algorithms,   Concurrency-Control Research,   Formal Concurrency Control,   Deadlocks
• Optimistic CC,   Distributed & Centralized,   Performance
• Commit/Termination Protocols:   2PC,   3PC,   Degrees of Commitment,   Termination

Since Purdue has announced that classes will be online until the end of the semester, you may go over supplementary videos to learn. You can find a map between supplementary videos and course content in Piazza@11.

Furthermore, I propose you to read the following papers.

• A Formal Model of Crash Recovery in a Distributed System. D. Skeen and M. Stonebraker, IEEE Trans. on Software Engineering, 9(3): 219-228, 1983.

Summary of all ideas on Commit and termination protocols with some insights on recovery:

• PLANET: Making Progress with Commit Processing in Unpredictable Environments. Gene Pang, Tim Kraska, Michael Franklin, Alan Fekete, SIGMOD 2014.
• Transaction Processing and Consistency Control of Replicated Copies during Failures in Distributed Databases. B. Bhargava, Journal of Management Information Systems, Vol. 4 No. 2, Fall 1987.

Earlier version is below. Talks about keeping data consistent on all sites.

• Site Recovery in Replicated Distributed Database Systems. B. Bhargava, Computer Science Technical Reports, Report Number: 85-564, 1985.

Very soon we will talk about site failure and network partitioning ( when some sites can communicate with each other but not other set of sites

Slides of interest for next three weeks are:

• Reliability and Fault-Tolerant Mechanisms,   Failure and Recovery, Logging
• Site Failure and Recovery, Partitioning
• Reliability Partition,   Mutual Consistency

Useful slides in Innovative Ideas in Privacy Research:

• 1,2,3
• 5,6
• 9
• 12-27
• 30
• 47,48,49
• 50-55
• 58,59
• 61
• 89-94
• 117
• 120-133

Please, read as convenient:

• Trust-Based Privacy Preservation for Peer-to-peer Media Streaming, Y. Lu, W, Wang, D. Xu, and B. Bhargava, in Proceedings of Secure Knowledge Management (SKM) Amherst, NY, September 2004 [slides]

I discussed attacks on Mobile adhoc networks (on Tuesday 23) and here are some slides that you look at:

• Detecting Service Violation in Internet and Mobile Ad Hoc Networks [slides] [abstract]
• Slide 43-61 (there is a lot more but this knowledge is sufficient in case you want to study more. I am avoiding talking about attacks in internet since enough is in public space but you may see the slides before 43 if you want. These are based on two Ph.D thesis at Purdue.

Sample question to prepare for the exam.