Department of Computer Science University of Cyprus EPL646 Advanced Topics in Databases. Lecture 8. Transaction Management Overview
|
|
- Δάμαρις Αλεξάκης
- 6 χρόνια πριν
- Προβολές:
Transcript
1 Department of Computer Science University of Cyprus EPL646 Advanced Topics in Databases Lecture 8 Transaction Management Overview Chapter : Elmasri & Navathe, 5ED Chapter and 16.6: Ramakrishnan & Gehrke, 3ED Demetris Zeinalipour 8-1
2 Overview of Transaction Processing (Επισκόπηση Επεξεργασίας Δοσοληψιών) We will now focus on Concurrency Control (Έλεγχο Ταυτοχρονίας) and Recovery Management (Τεχνικές Ανάκαμψης) in cases of failures THIS PART THIS PART 8-2
3 Lecture Outline Transaction Management Overview 16.0) Introduction to Transactions (Δοσοληψίες ή Συναλλαγές) 16.1) The ACID (Atomicity-Consistency-Isolation- Durability) Properties 16.2) Transactions and Schedules (Χρονοπρόγραμμα) 16.3) Concurrent Executions of Transactions (Ταυτόχρονες Εκτελέσεις Δοσοληψιών) and Problems 16.6) Transaction Support in SQL Below topics will be covered as part of subsequent lectures 16.4) Concurrency with Locks (Κλειδαριές) 16.5) Concurrency with Timestamps (Χρονόσημα) 16.7) Introduction to Crash Recovery (Ανάκαμψη Σφαλμάτων) 8-3
4 Introduction to Transactions (Εισαγωγή σε Δοσοληψίες) The concept of transaction (δοσοληψία) provides a mechanism for describing logical units of database processing. Analogy: A transaction is to a DBMS as a process is to an Operating System. Transaction Processing Systems (Συστήματα Επεξεργασίας Δοσοληψιών) are systems with large databases and hundreds of concurrent users executing database transactions Examples: Airline Reservations (Αεροπορικές Κρατήσεις), Banking (Εφαρμογές Τραπεζικού Τομέα), Stock Markets (Χρηματιστήρια), Supermarkets (Υπεραγορές), 8-4
5 Introduction to Transactions (Εισαγωγή σε Δοσοληψίες) Transaction (Δοσοληψία) (Xact), is an atomic (i.e., allor-nothing) sequence of database operations (i.e., readwrite operations). It is the DBMS s abstract view of a user program! A transaction (collection of actions) makes transformations of system states while preserving the database consistency (συνέπεια βάσης) next slide. DB in a consistent state DB may be in an inconsistent state during execution DB in a consistent state Begin transaction T Execution of a transaction T End transaction T 8-5
6 DB Consistency vs. Trans. Consistency (Συνέπεια ΒΔ vs. Συνέπεια Δοσοληψίας) Database Consistency (Συνέπεια Βάσης) A database is in a consistent state if it obeys all of the Integrity Constraints (Κανόνες Ακεραιότητας) defined over it. Examples of Integrity Constraints: Domain Constraints (Πεδίου Ορισμού): e.g., SID must be integer Key Constraints (Κλειδιού): e.g., no 2 students have the same SID Foreign Key Constraints (Ξένου Κλειδιού): e.g., DepartmentID in Student must match the DepartmentID in Department s table. Single Table Constraints: e.g., CHECK (age>18 AND age<25) Multiple Table Constraints: e.g., Create ASSERTION C CHECK ((SELECT A) + (SELECT B) < 10) Transaction consistency (Συνέπεια Δοσοληψίας) Complements Database consistency by incorporating user semantics (e.g., σημασιολογία όπως ορίζεται από τον χρήστη) T.C is the user s responsibility (e.g., previous example) 8-6
7 Introduction to Transactions (Εισαγωγή σε Δοσοληψίες) One way of specifying the transaction boundaries is by specifying explicit BEGIN TRANSACTION and END TRANSACTION statements in an application program Transaction Example in MySQL START TRANSACTION; FROM table1 WHERE type=1; UPDATE table2 SET WHERE type=1; COMMIT; Transaction Example in Oracle (similar with SQL Server) When you connect to the database with sqlplus (Oracle command-line utility that runs SQL and PL/SQL commands interactively or from a script) a transaction begins. BEGIN SET AUTOCOMMIT OFF insert... ; insert... ; update... ; commit; exit; END; Transaction Example in C: See Next Slide Note that the given example has no explicit START/END statements as the whole program is essentially 1 transaction (as the previous example with Oracle s sqlplus utility. 8-7
8 Transaction Consistency Example with Embedded SQL The below example shows a Transaction main { } constraint (not captured by ICs) EXEC SQL BEGIN DECLARE SECTION; // define C host program variables (accessible in SQL environment) char flight_no[6], customer_id[20]; // these host-language variable are prefixed with : in SQL statements char day; EXEC SQL END DECLARE SECTION; scanf( %s %d %s, flight_no, day, customer_id); EXEC SQL UPDATE FLIGHT SET STSOLD = STSOLD + 1 WHERE FNO = :flight_no AND DATE = :day; EXEC SQL INSERT INTO FC(FNO, DATE, CID, SPECIAL); VALUES(:flight_no, :day, :customer_id, null); printf( Reservation completed ); return(0); DB in inconsistent state Consider an airline reservation example with the relations*: FLIGHT(FNO, DATE, SRC, DEST, STSOLD) CUST(CID, ADDR) FC(FNO, DATE, CID, SPECIAL) Sell a seat on a given flight and date by increasing the SeaTSOLD attribute Store the sale in the Flight- Customer table If only the first action is executed then relations FLIGHT and FC will be inconsistent Although not a concurrent program, we need to ensure transaction consistency (all-or-nothing)! * We make some simplifying assumptions regarding the schema and constraints 8-8
9 Introduction to Transactions (Εισαγωγή σε Δοσοληψίες) Things get even more complicated if we have several DBMS programs (transactions) executed concurrently. Why do we need concurrent executions? It is essential for good DBMS performance! Disk accesses are frequent, and relatively slow Overlapping I/O with CPU activity increases throughput and response time. What is the problem with concurrent transactions? Interleaving (Παρεμβάλλοντας) transactions might lead the system to an inconsist state (like previous example): Scenario: A Xact prints the monthly bank account statement for a user U (one bank transaction at-a-time).before finalizing the report another Xact withdraws $X from user U. Result: Although the report contains an updated final balance, it shows nowhere the bank transaction that caused the decrease (unrepeatable read problem, explained next) A DBMS guarantees that these problems will not arise. Users are given the impression that the transactions are executed sequentially (σειριακά), the one after the other. 8-9
10 Introduction to Transactions (Εισαγωγή σε Δοσοληψίες) State Diagram for Transaction Execution (Διάγραμμα Καταστάσεων για την Εκτέλεση Δοσοληψιών) Active: When Xact begins Partially Committed: When Xact ends, several recovery checks take place making sure that the DB can always recover to a consistent state Failed: If Xact aborts for any reason (rollback might be necessary to return the system to a consistent state) Committed: After partial committed checks are successful. Once committed we never return (roll-back) to a previous state 8-10
11 The ACID properties (Οι ιδιότητες ACID) What are the fundamental (θεμελιώδεις) properties that a DBMS must enforce so that data remains consistent (in the face of concurrent access & failures)? A DBMS needs to enforce four (4) properties: Atomicity Consistency Isolation - Durability Ατομικότητα Συνέπεια - Απομόνωση Μονιμότητα Jim Gray defined the key transaction properties of a reliable system in the late Acronym ACID was coined by Reuter and Haerder in 1983 Reuter, Andreas; Haerder, Theo "Principles of Transaction-Oriented Database Recovery". ACM Computing Surveys (ACSUR) 15 (4): pp ,
12 The ACID properties (Οι ιδιότητες ACID) 1. Atomicity (Ατομικότητα): All or nothing! An executing transaction completes in its entirety (i.e., ALL) or it is aborted altogether (i.e., NOTHING). e.g., Transfer_Money(Amount, X, Y) means i) DEBIT(Amount, X); ii) CREDIT(Amount, Y). Either both take place or none. Reasons for Incomplete Transactions Anomaly Detection (e.g., Constraint violation) or System Crash (e.g., power) Responsibility: Recovery Manager (use log file to record all writes) 2. Consistency (Συνέπεια): Start & End Consistent! If each Transaction is consistent, and the DB starts consistent, then the Database ends up consistent. If a transaction violates the database s consistency rules, the entire transaction will be rolled back and the database will be restored to a state consistent with those rules Responsibility: User (DB only enforcing IC rules) 8-12
13 The ACID properties (Οι ιδιότητες ACID) 3. Isolation (Απομόνωση): See your own data only! An executing transaction cannot reveal its (incomplete) results before it commits. Consequently, the net effect is identical to executing all transactions, the one after the other in some serial order. e.g., if two transactions T1 and T2 exists, then the output is guaranteed to be either T1, T2 or T2, T1 (The DBMS cannot guarantee the order of execution, that is the user s job!) see example next page Responsibility: Lock Manager (i.e., Concurrency Control Manager) 4. Durability (Μονιμότητα): DBMS Cannot Regret! Once a transaction commits, the system must guarantee that the results of its operations will never be lost, in spite of subsequent failures. Responsibility: Recovery Manager (use log file to record all writes) 8-13
14 Notation for Transactions (Σημειογραφία για Δοσοληψίες) Actions executed by a transaction include reads and writes of database objects Notation R T (O): The Transaction T Reads an Object O. W T (O): The Transaction T Writes an Object O. When Transaction is clear in context we shall omit the T Although written, the data is in really pending until committed. Commit T : Complete successfully writing data to disk Abort T : Terminate and undo all carried out actions Assumptions Transaction Communication only through the DBMS Database Objects: Static Collection (i.e., tables, etc. not added/removed dynamic case more complex) 8-14
15 Transactions and Schedules (Δοσοληψίες και Χρονοπρόγραμμα) Schedule (Χρονοπρόγραμμα) List of actions (read, write, abort, or commit) from a set (ομάδας) of transactions (Τ1, Τ2, ) where the order of actions inside each transaction does not change. e.g., if Τ1=, then, is not the same schedule (as it is in opposite order) Schedule Τ1 Τ R(C) W(C) Note that the DBMS might carry out other actions as well (e.g., evaluate arithmetic expressions). Yet these do not affect the other transactions, thus will be omitted from our presentation We shall introduce Commits/Aborts subsequently. 8-15
16 Transactions and Schedules (Δοσοληψίες και Χρονοπρόγραμμα) Serial Schedule (Σειριακό Χρονοπρόγραμμα) A schedule in which the different transactions are NOT interleaved (i.e., transactions are executed from start to finish one-by-one) Serial Schedule Τ1 Τ Serial Schedule Τ1 Τ N! Possible Serial Schedules, where N the number of Xacts 8-16
17 Problems due to Interleaved Xact (Προβλήματα από την Παρεμβολή Δοσοληψιών) Problems that arise when interleaving Transactions. Problem 1: Reading Uncommitted Data (WR Conflicts) Reading the value of an uncommitted object might yield an inconsistency W R Dirty Reads or Write-then-Read (WR) Conflicts. In Greek: Ασυνεπείς αναγνώσεις Problem 2: Unrepeatable Reads (RW Conflicts) Reading the same object twice might yield an inconsistency Read-then-Write (RW) Conflicts (ή Write-After-Read) In Greek: Μη-επαναλήψιμες αναγνώσεις Problem 3: Overwriting Uncommitted Data (WW Conflicts) Overwriting an uncommitted object might yield an inconsistency Lost Update or Write-After-Write (WW) Conflicts. In Greek: Απώλειες ενημερώσεων Remark: There is no notion of RR-Conflict as no object is changed R R W W W 8-17
18 Reading Uncommitted Data (WR Conflicts) (Ασυνεπείς αναγνώσεις) Reading the value of an uncommitted object yields an inconsistency To illustrate the WR-conflict consider the following problem: T1: Transfer $100 from Account A to Account B T2: Add the annual interest of 6% to both A and B. (Correct)Serial Schedule (Correct)Serial Schedule WR-Conflict (Wrong) Trace A=A-100 B=B+100 A=A*1.06 B=B*1.06 Τ1 Τ2 Trace A=A*1.06 B=B*1.06 A=A-100 B=B+100 Τ1 Τ2 Trace A=A-100 A=A*1.06 B=B*1.06 B=B+100 Τ1 Τ2 Dirty Read Problem caused by the WR-Conflict? Account B was credited with the interest on a smaller amount (i.e., 100$ less), thus the result is not equivalent to the serial schedule 8-18
19 Unrepeatable Reads (RW Conflicts) (Μη-επαναλήψιμες αναγνώσεις) Reading the same object twice yields an inconsistency To illustrate the RW-conflict consider the following problem: T1: Print Value of A T2: Decrease Global counter A by 1. RW-Conflict (Wrong) Trace A=10 A=10 A=A-1=9 A=9 Τ1 Τ2 Write-after-Read Problem caused by the RW-Conflict? Although the A counter is read twice within T1 (without any intermediate change) it has two different values (unrepeatable read)! what happens if T2 aborts? Τ1 has shown an incorrect result. Note that if I read at this point we would see 9 rather than 10 (i.e., read is unrepeatable) 8-19
20 Overwriting Uncommitted Data (WW Conflicts) (Απώλειες ενημερώσεων) Overwriting an uncommitted object yields an inconsistency To illustrate the WW-conflict consider the following problem: Constr: Salary of employees A and B must be kept equal T1: Set Salary to 1000; T2: Set Salary equal to 2000 (Correct)Serial Schedule (Correct)Serial Schedule WW-Conflict (Wrong) Trace A=1000 B=1000 A=2000 B=2000 Τ1 Τ2 Trace A=2000 B=2000 A=1000 B=1000 Τ1 Τ2 Trace A=1000 A=2000 B=2000 B=1000 Τ1 Τ2 Lost Update Lost Update Problem caused by the WW-Conflict? Employee A gets a salary of 2000 while employee B gets a salary of 1000, thus result is not equivalent to the serial schedule! 8-20
21 Lecture Roadmap Transactions and Schedules 16.2) Transactions and Schedules (Χρονοπρόγραμμα) Serial Schedule (Σειριακό Χρονοπρόγραμμα) one after the other Complete Schedule (Πλήρες Χρονοπρόγραμμα) with Commit, Abort 17.1) Serializability (Σειριοποιησιμότητα) Correctness Measure of some Schedule Why is it useful? It answers the question: Will an interleaved schedule execute correctly i.e., a Serializable schedule will execute as correctly as a serial schedule but in an interleaved manner! 17.1) Recoverability (Επαναφερσιμότητα) Recoverability Measure of some Schedule. Why is it useful? It answers the question: Do we need to rollback a some (or all) transactions in an interleaved schedule after some Failure (e.g., ABORT) i.e., in a Recoverable schedule no transaction needs to be rolled back (διαδικασία επιστροφής) once committed! 8-25
22 Transactions and Schedules (Δοσοληψίες και Χρονοπρόγραμμα) Serial Schedule (Σειριακό Χρονοπρόγραμμα) A schedule in which the different transactions are NOT interleaved (i.e., transactions are executed from start to finish one-by-one) Serial Schedule Τ1 Τ Serial Schedule Τ1 Τ N! Possible Serial Schedules, where N the number of Transactions 8-27
23 Transactions and Schedules (Δοσοληψίες και Χρονοπρόγραμμα) Complete Schedule (Πλήρες Χρονοπρόγραμμα) A schedule that contains either a commit (ολοκλήρωση δοσοληψίας) or an abort (ματαίωση δοσοληψίας) action for EACH transaction.* Complete Schedule Τ1 Τ Commit Abort Complete Schedule Τ1 Τ Commit Abort Complete (Serial) Schedule Τ1 Τ Commit Abort * Note: consequently, a complete schedule will not contain any active transactions at the end of the schedule 8-28
24 Transactions and Schedules (Δοσοληψίες και Χρονοπρόγραμμα) Interleaved Schedules of transactions improve performance Throughput (ρυθμαπόδοση): More Xacts per seconds; and Response Time (χρόνος απόκρισης): A short transaction will not get stuck behind a long-running transaction Yet it might lead the DB to an inconsistent state as we have shown Serial schedule (σειριακό χρονοπρόγραμμα) is slower but guarantees consistency (correctness) We seek to identify schedules that are: As fast as interleaved schedules. As consistent as serial schedules 8-29
25 Transactions and Schedules (Δοσοληψίες και Χρονοπρόγραμμα) We shall now characterize different schedules based on the following two properties: A. Based on Serializability (Σειριοποιησιμότητα) We shall ignore Commits and Aborts for this section Characterize which schedules are correct when concurrent transactions are executing. Conflict Serializable Schedule (Σειριοποιησιμότητα Συγκρούσεων) View Serializable Schedule (Σειριοποιησιμότητα Όψεων) B. Based on Recoverability (Επαναφερσιμότητα) Commits and Aborts become important for this section! Characterize which schedules can be recovered and how easily. Recoverable Schedule (Επαναφέρσιμο Χρονοπρόγραμμα). Cascadeless schedule (Χρονοπρ. χωρίς διαδιδόμενη ανάκληση) EPL646: Strict Advanced Schedules Topics in Databases (Αυστηρό - Demetris Χρονοπρόγραμμα). Zeinalipour (University of Cyprus)
26 Characterizing Schedules based on: Serializability Recoverability Conflicting Actions (Συγκρουόμενες Πράξεις) Conflicting Actions (Συγκρουόμενες Πράξεις) Two or more actions are said to be in conflict if: The actions belong to different transactions. At least one of the actions is a write operation. The actions access the same object (read or write). The following set of actions is conflicting: T1:R(X), T2:W(X), T3:W(X) While the following sets of actions are not: T1:R(X), T2:R(X), T3:R(X) T1:R(X), T2:W(Y), T3:R(X) // No Write on same object // No Write on same object T1 T2 T3 R(X) W(X) W(X) 8-31
27 Characterizing Schedules based on: Serializability Recoverability Conflict Equivalence (Ισοδυναμία Συγκρούσεων) Conflict Equivalence (Ισοδυναμία Συγκρούσεων) The schedules S1 and S2 are said to be conflict-equivalent if the following conditions are satisfied: Both schedules S1 and S2 involve the same set of transactions (including ordering of actions within each transaction). The order (διάταξη) of each pair of conflicting actions in S1 and S2 are the same. Why is the order of Conflicts important? If two conflicting operations are applied in different orders, the net effect can be different on the database or on other transactions in the schedule. See example below: Example: Τ1 Τ2 Τ1 Τ2 A=5 A=A+1=6 A=6 A=A+1= NOT Conflict Equivalent to: A=5 A=A+1=6 A=6 A=6 Order of conflict is different NOT Conflict Equivalent to: A=5 A=5 A=A+1=6 A=A+1=6 A=A+1=7 (Alth. Result Now Wrong EPL646: Advanced Topics still same) in Databases - Demetris Zeinalipour Result! (University of Cyprus) * Note that non-conflicting operations can arbitrary be swapped around without compromising the order. Τ1 Τ Order and conflicts is different 8-32
28 Characterizing Schedules based on: Serializability Recoverability Conflict Serializability (Σειριοποιησιμότητα Συγκρούσεων) Conflict Serializability (Σειριοποιήσιμο Συγκρούσεων) When the schedule is conflict-equivalent (ισοδύναμο συγκρούσεων) to some (any!) serial schedule. Serializable == Conflict Serializable (that definition is in some textbooks different) Serial Schedule Τ1 Τ2 Serializable Schedule A Τ1 Τ2 Order of conflicts same to T1; T2 Serializable Schedule B Τ1 Τ2 Order of conflicts same to T2;T1 8-33
29 Characterizing Schedules based on: Serializability Recoverability Conflict Serializability (Σειριοποιησιμότητα Συγκρούσεων) Why is Conflict Serializability important? We have already said that any serial schedule leaves the DB in a consistent (correct) state, but is inefficient i.e., T1; T2 is as correct as T2; T1 (although they might have a different outcome). Serializable!= Serial: NOT the same thing Being Serializable implies: A.That the schedule is a correct schedule. It will leave the database in a consistent state. The interleaving is appropriate and will result in a state as if the transactions were serially executed. B.That a schedule is a efficient (interleaved) schedule That parameter makes it better than Serial! 8-34
30 Characterizing Schedules based on: Serializability Recoverability Testing for Serializability (Έλεγχος Σειριοποιησιμότητας) How can we test if a schedule is Conflict Serializable? There is a simple algorithm detailed next (that is founded on a Precedence Graph) Does the DBMS utilizes this algorithm? NO We detail it only to gain a better understanding of the definitions. Why is the DBMS not using it? Serializability is hard to check at runtime Difficult to determine beforehand how the operations in a schedule will be interleaved (as it depends on the OS) Subsequently, we will see that a DBMS utilizes a set of protocols (e.g., 2PL or other Concurrency Control techniques w/out locking), which guarantee that a schedule is always serializable. 8-35
31 Characterizing Schedules based on: Serializability Recoverability Precedence Graph (Γράφος Προτεραιότητας) Why is it useful? To find if a schedule is Conflict Serializable A Precedence Graph (Γράφος Προτεραιότητας) for a schedule S contains: A node for each transaction in S An arch from T i to T j, if an action of T i precedes (προηγείται) and conflicts (συγκρούεται) with one of T j s actions. Precedence Graph Τ1 Τ2 T T1 T2 Cycle exists! T3 A schedule S is conflict serializable if and only if its precedence graph is acyclic. The above schedule is not Conflict Serializable! 8-36
32 Characterizing Schedules based on: Serializability Recoverability Conflict Serializability Testing (Έλεγχος Σειριοποιησιμότητας Συγκρούσεων) Precedence Graph T1 T2 Write_item(z) T3 Cycles exist! Above schedule is ΝΟΤ Conflict Serializable! Although efficient (interleaved) the above might NOT produce a correct result! 8-37
33 Characterizing Schedules based on: Serializability Recoverability Introduction to Recoverability (Εισαγωγή στην Επαναφερσιμότητα) So far we have characterized schedules based on serializability (σειριοποιησιμότητα), i.e., correctness. Now it is time to characterize schedules based on recoverability (επαναφερσιμότητα) Why is this important? For some schedules it is easier to recover from transaction failures than others. In summary, a Recoverable Schedule (Επαναφέρσιμο Χρονοπρόγραμμα) is a schedule where no transaction needs to be rolled back (διαδικασία επιστροφής) once committed. Commit/Abort points now become quite important! 8-42
34 Characterizing Schedules based on: Serializability Recoverability Recoverable Schedule (Επαναφέρσιμο Χρονοπρόγραμμα) Recoverable Schedule (Επαναφέρσιμο Χρονοπρόγραμμα) A schedule S is recoverable if no transaction T in S commits until all transactions T, that have written an item that T reads, have committed. Rule: In other words, the parents of dirty reads need to commit before their children can commit Consider the Following schedule: Τ1 R(X) W(X) R(Y) T1 should have committed first! Abort Τ2 dirty read R(X) W(X) Commit Is this schedule recoverable? Answer: NO Why NOT recoverable? Because T2 made a dirty read and committed before T1 next slide explains why this is a problem 8-43
35 Characterizing Schedules based on: Serializability Recoverability Recoverable Schedule (Επαναφέρσιμο Χρονοπρόγραμμα) But why is the schedule Nonrecoverable (Μηεπαναφέρσιμο)? Because when the recovery manager rolls back (step a) T1 then A gets its initial value. But T2 has already utilized this wrong value and committed something to the DB The DB is consequently in an inconsistent state! a) Roll back Τ1 R(X) W(X) R(Y) Abort Τ2 dirty read R(X) W(X) Commit Nonrecoverable B) Now DB is inconsistent! (because X was committed based on T1 s aborted transaction) 8-44
36 Characterizing Schedules based on: Serializability Recoverability Recoverable Schedule (Επαναφέρσιμο Χρονοπρόγραμμα) How can we make the Schedule Recoverable? Initial Unrecoverable Schedule Recoverable Schedule A Τ1 R(X) W(X) R(Y) Abort Τ2 dirty read R(X) W(X) Commit Commit after parent of dirty read Recoverable Τ1 R(X) W(X) R(Y) Abort Τ2 dirty read R(X) W(X) Commit Nonrecoverable Recoverable Schedule B Τ1 R(X) W(X) R(Y) Abort Τ2 R(X) W(X) Commit Remove Dirty Read Recoverable Not Serializable (order of conflicting actions has changed) 8-45
37 Characterizing Schedules based on: Serializability Recoverability Other Schedules based on Recoverability (Άλλα χρονοπρογράμματα βάση Επαναφερσιμότητας) There are more strict types of Schedules (based on the Recoverability properties) Cascadeless schedule (Χρονοπρόγραμμα χωρίς διαδιδόμενη ανάκληση): (or Schedule that Avoids Cascading Rollbacks) Refers to cases where we have aborts. Strict Schedules (Αυστηρό Χρονοπρόγραμμα) These schedules are very simple to be recovered! Thus, the DBMS prefers this class of Schedules. All schedules Recoverable Avoid Cascading Aborts Strict Serial 8-46
38 Characterizing Schedules based on: Serializability Recoverability Cascadeless Schedule (Χρονοπρόγραμμα χωρίς διαδιδόμενη ανάκληση) Cascadeless schedule (Χρονοπρόγραμμα χωρίς διαδιδόμενη ανάκληση): or Schedule that Avoids Cascading Rollbacks) One where a rollback does not cascade to other Xacts Why is this necessary? Rollbacks are Costly! How can we achieve it? Every transaction reads only the items that are written by committed transactions. Τ1 R(X) W(X) R(Y) W(Y) Abort Τ2 a) dirty read R(X) W(X) b) Roll back c) (Cascade) Commit We need to Roll back T2 as well! NOT Cascadeless (but Recoverable) 8-47
39 Characterizing Schedules based on: Serializability Recoverability All schedules Recoverable Avoid Cascading Aborts Strict Serial Cascadeless Schedule (Χρονοπρόγραμμα χωρίς διαδιδόμενη ανάκληση) Let us turn the previous example into a Cascadeless Schedule Recall, in order to get a Cascadeless Schedule, every transaction must read only committed data Cascadeless Schedule a) Roll back Τ1 R(X) W(X) R(Y) W(Y) Abort Τ2 R(X) W(X) Commit b) Now T2 reads the X value that existed before T1 started. Another Cascadeless Schedule Τ1 R(X) W(X) R(Y) W(Y) Abort Τ2 W(X) Commit but not strict 8-48
40 Characterizing Schedules based on: Serializability Recoverability Strict Schedule (Αυστηρό Χρονοπρόγραμμα) Strict Schedule (Αυστηρό Χρονοπρόγραμμα): A schedule is strict if overriding of uncommitted data is not allowed. Formally, if it satisfies the following conditions: Tj reads a data item X after Ti has terminated (aborted or committed) Tj writes a data item X after Ti has terminated (aborted or committed) Why is this necessary? Eliminates Rollbacks! If a schedule is strict, a rollback can be achieved simply by resetting the Xact variables to the value before its start value, e.g., Cascadeless but NOT Strict b) Rollback X=9 now Τ1 // X=9 W(X,5) Abort Τ2 W(X,8) a) Changing an item that Commit has not been committed yet (X=8 now) c) Why is this a problem? Because X now became again 9 rather than X=8 or X=5! T i T j 8-49
41 Characterizing Schedules based on: Serializability Recoverability Characterizing Schedules (Χαρακτηρίζοντας Χρονοπρογράμματα) Venn Diagram Illustrating the Different ways to characterize a Schedule based on Serializability and Recoverability 8-50
Department of Computer Science University of Cyprus EPL646 Advanced Topics in Databases. Lecture 8. Transaction Management Overview
Department of Computer Science University of Cyprus EPL646 Advanced Topics in Databases Lecture 8 Transaction Management Overview Chapter 17.1-17.6: Elmasri & Navathe, 5ED Chapter 16.1-16.3 and 16.6: Ramakrishnan
Διαβάστε περισσότεραDepartment of Computer Science University of Cyprus EPL446 Advanced Database Systems. Lecture 14. Transactions and Schedules
Department of Computer Science University of Cyprus EPL446 Advanced Database Systems Lecture 14 Transactions and Schedules Chapter 17.4-17.5 : Elmasri & Navathe, 5ED Chapter 16.2-16.3 and 17.1: Ramakrishnan
Διαβάστε περισσότεραΣυστήματα Διαχείρισης Βάσεων Δεδομένων
ΕΛΛΗΝΙΚΗ ΔΗΜΟΚΡΑΤΙΑ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΡΗΤΗΣ Συστήματα Διαχείρισης Βάσεων Δεδομένων Φροντιστήριο 9: Transactions - part 1 Δημήτρης Πλεξουσάκης Τμήμα Επιστήμης Υπολογιστών Tutorial on Undo, Redo and Undo/Redo
Διαβάστε περισσότεραTransaction Processing (Διαχείριση Δοσοληψιών)
Transaction Processing (Διαχείριση Δοσοληψιών) In modern applications databases are shared by more than one users at the same time who can query and update them It is not possible to provide each user
Διαβάστε περισσότεραΑρχεία και Βάσεις Δεδομένων
ΕΛΛΗΝΙΚΗ ΔΗΜΟΚΡΑΤΙΑ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΡΗΤΗΣ Αρχεία και Βάσεις Δεδομένων Διάλεξη 15η: Διαχείριση Δοσοληψιών Δημήτρης Πλεξουσάκης Τμήμα Επιστήμης Υπολογιστών Transaction Processing (Διαχείριση Δοσοληψιών) In
Διαβάστε περισσότεραLocking to ensure serializability
Locking to ensure serializability Concurrent access to database items is controlled by strategies based on locking, timestamping or certification A lock is an access privilege to a single database item
Διαβάστε περισσότερα2 Composition. Invertible Mappings
Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan Composition. Invertible Mappings In this section we discuss two procedures for creating new mappings from old ones, namely,
Διαβάστε περισσότεραΚΥΠΡΙΑΚΗ ΕΤΑΙΡΕΙΑ ΠΛΗΡΟΦΟΡΙΚΗΣ CYPRUS COMPUTER SOCIETY ΠΑΓΚΥΠΡΙΟΣ ΜΑΘΗΤΙΚΟΣ ΔΙΑΓΩΝΙΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ 19/5/2007
Οδηγίες: Να απαντηθούν όλες οι ερωτήσεις. Αν κάπου κάνετε κάποιες υποθέσεις να αναφερθούν στη σχετική ερώτηση. Όλα τα αρχεία που αναφέρονται στα προβλήματα βρίσκονται στον ίδιο φάκελο με το εκτελέσιμο
Διαβάστε περισσότεραΑρχεία και Βάσεις Δεδομένων
ΕΛΛΗΝΙΚΗ ΔΗΜΟΚΡΑΤΙΑ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΡΗΤΗΣ Αρχεία και Βάσεις Δεδομένων Διάλεξη 16η: Διαχείριση Δοσοληψιών Μέρος 2ο - 2PL Δημήτρης Πλεξουσάκης Τμήμα Επιστήμης Υπολογιστών Locking to ensure serializability
Διαβάστε περισσότεραInstruction Execution Times
1 C Execution Times InThisAppendix... Introduction DL330 Execution Times DL330P Execution Times DL340 Execution Times C-2 Execution Times Introduction Data Registers This appendix contains several tables
Διαβάστε περισσότεραEE512: Error Control Coding
EE512: Error Control Coding Solution for Assignment on Finite Fields February 16, 2007 1. (a) Addition and Multiplication tables for GF (5) and GF (7) are shown in Tables 1 and 2. + 0 1 2 3 4 0 0 1 2 3
Διαβάστε περισσότεραTMA4115 Matematikk 3
TMA4115 Matematikk 3 Andrew Stacey Norges Teknisk-Naturvitenskapelige Universitet Trondheim Spring 2010 Lecture 12: Mathematics Marvellous Matrices Andrew Stacey Norges Teknisk-Naturvitenskapelige Universitet
Διαβάστε περισσότεραThe Simply Typed Lambda Calculus
Type Inference Instead of writing type annotations, can we use an algorithm to infer what the type annotations should be? That depends on the type system. For simple type systems the answer is yes, and
Διαβάστε περισσότεραΕργαστήριο Ανάπτυξης Εφαρμογών Βάσεων Δεδομένων. Εξάμηνο 7 ο
Εργαστήριο Ανάπτυξης Εφαρμογών Βάσεων Δεδομένων Εξάμηνο 7 ο Procedures and Functions Stored procedures and functions are named blocks of code that enable you to group and organize a series of SQL and PL/SQL
Διαβάστε περισσότεραPhys460.nb Solution for the t-dependent Schrodinger s equation How did we find the solution? (not required)
Phys460.nb 81 ψ n (t) is still the (same) eigenstate of H But for tdependent H. The answer is NO. 5.5.5. Solution for the tdependent Schrodinger s equation If we assume that at time t 0, the electron starts
Διαβάστε περισσότεραΕργαστήριο Ανάπτυξης Εφαρμογών Βάσεων Δεδομένων. Εξάμηνο 7 ο
Εργαστήριο Ανάπτυξης Εφαρμογών Βάσεων Δεδομένων Εξάμηνο 7 ο Oracle SQL Developer An Oracle Database stores and organizes information. Oracle SQL Developer is a tool for accessing and maintaining the data
Διαβάστε περισσότεραΣτο εστιατόριο «ToDokimasesPrinToBgaleisStonKosmo?» έξω από τους δακτυλίους του Κρόνου, οι παραγγελίες γίνονται ηλεκτρονικά.
Διαστημικό εστιατόριο του (Μ)ΑστροΈκτορα Στο εστιατόριο «ToDokimasesPrinToBgaleisStonKosmo?» έξω από τους δακτυλίους του Κρόνου, οι παραγγελίες γίνονται ηλεκτρονικά. Μόλις μια παρέα πελατών κάτσει σε ένα
Διαβάστε περισσότεραSection 8.3 Trigonometric Equations
99 Section 8. Trigonometric Equations Objective 1: Solve Equations Involving One Trigonometric Function. In this section and the next, we will exple how to solving equations involving trigonometric functions.
Διαβάστε περισσότεραLecture 2. Soundness and completeness of propositional logic
Lecture 2 Soundness and completeness of propositional logic February 9, 2004 1 Overview Review of natural deduction. Soundness and completeness. Semantics of propositional formulas. Soundness proof. Completeness
Διαβάστε περισσότεραderivation of the Laplacian from rectangular to spherical coordinates
derivation of the Laplacian from rectangular to spherical coordinates swapnizzle 03-03- :5:43 We begin by recognizing the familiar conversion from rectangular to spherical coordinates (note that φ is used
Διαβάστε περισσότεραHOMEWORK 4 = G. In order to plot the stress versus the stretch we define a normalized stretch:
HOMEWORK 4 Problem a For the fast loading case, we want to derive the relationship between P zz and λ z. We know that the nominal stress is expressed as: P zz = ψ λ z where λ z = λ λ z. Therefore, applying
Διαβάστε περισσότεραΚΥΠΡΙΑΚΗ ΕΤΑΙΡΕΙΑ ΠΛΗΡΟΦΟΡΙΚΗΣ CYPRUS COMPUTER SOCIETY ΠΑΓΚΥΠΡΙΟΣ ΜΑΘΗΤΙΚΟΣ ΔΙΑΓΩΝΙΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ 6/5/2006
Οδηγίες: Να απαντηθούν όλες οι ερωτήσεις. Ολοι οι αριθμοί που αναφέρονται σε όλα τα ερωτήματα είναι μικρότεροι το 1000 εκτός αν ορίζεται διαφορετικά στη διατύπωση του προβλήματος. Διάρκεια: 3,5 ώρες Καλή
Διαβάστε περισσότερα4.6 Autoregressive Moving Average Model ARMA(1,1)
84 CHAPTER 4. STATIONARY TS MODELS 4.6 Autoregressive Moving Average Model ARMA(,) This section is an introduction to a wide class of models ARMA(p,q) which we will consider in more detail later in this
Διαβάστε περισσότεραPhysical DB Design. B-Trees Index files can become quite large for large main files Indices on index files are possible.
B-Trees Index files can become quite large for large main files Indices on index files are possible 3 rd -level index 2 nd -level index 1 st -level index Main file 1 The 1 st -level index consists of pairs
Διαβάστε περισσότεραDynamic types, Lambda calculus machines Section and Practice Problems Apr 21 22, 2016
Harvard School of Engineering and Applied Sciences CS 152: Programming Languages Dynamic types, Lambda calculus machines Apr 21 22, 2016 1 Dynamic types and contracts (a) To make sure you understand the
Διαβάστε περισσότεραConcrete Mathematics Exercises from 30 September 2016
Concrete Mathematics Exercises from 30 September 2016 Silvio Capobianco Exercise 1.7 Let H(n) = J(n + 1) J(n). Equation (1.8) tells us that H(2n) = 2, and H(2n+1) = J(2n+2) J(2n+1) = (2J(n+1) 1) (2J(n)+1)
Διαβάστε περισσότεραΕπεξεργασία οσοληψιών
οσοληψίες Επεξεργασία οσοληψιών Ηταυτόχρονη εκτέλεση προγραµµάτων χρηστών είναι απαραίτητη για την καλή απόδοση ενός Σ Β Επειδή οι προσπελάσεις στο δίσκο είναι συχνές και σχετικά αργές, είναι σηµαντικό
Διαβάστε περισσότεραPotential Dividers. 46 minutes. 46 marks. Page 1 of 11
Potential Dividers 46 minutes 46 marks Page 1 of 11 Q1. In the circuit shown in the figure below, the battery, of negligible internal resistance, has an emf of 30 V. The pd across the lamp is 6.0 V and
Διαβάστε περισσότεραCHAPTER 25 SOLVING EQUATIONS BY ITERATIVE METHODS
CHAPTER 5 SOLVING EQUATIONS BY ITERATIVE METHODS EXERCISE 104 Page 8 1. Find the positive root of the equation x + 3x 5 = 0, correct to 3 significant figures, using the method of bisection. Let f(x) =
Διαβάστε περισσότερα3.4 SUM AND DIFFERENCE FORMULAS. NOTE: cos(α+β) cos α + cos β cos(α-β) cos α -cos β
3.4 SUM AND DIFFERENCE FORMULAS Page Theorem cos(αβ cos α cos β -sin α cos(α-β cos α cos β sin α NOTE: cos(αβ cos α cos β cos(α-β cos α -cos β Proof of cos(α-β cos α cos β sin α Let s use a unit circle
Διαβάστε περισσότεραExample Sheet 3 Solutions
Example Sheet 3 Solutions. i Regular Sturm-Liouville. ii Singular Sturm-Liouville mixed boundary conditions. iii Not Sturm-Liouville ODE is not in Sturm-Liouville form. iv Regular Sturm-Liouville note
Διαβάστε περισσότεραΒΑΣΕΙΣ ΔΕΔΟΜΕΝΩΝ. Πανεπιστήμιο Πειραιώς Τμήμα Ψηφιακών Συστημάτων Μανουσόπουλος Χρήστος
ΒΑΣΕΙΣ ΔΕΔΟΜΕΝΩΝ Πανεπιστήμιο Πειραιώς Τμήμα Ψηφιακών Συστημάτων Μανουσόπουλος Χρήστος cman@unipi.gr Δοσοληψίες (Transactions) Μέχρι στιγμής θεωρούσαμε πως υπάρχει μόνο ένας DB χρήστης που εκτελεί μία
Διαβάστε περισσότεραThe challenges of non-stable predicates
The challenges of non-stable predicates Consider a non-stable predicate Φ encoding, say, a safety property. We want to determine whether Φ holds for our program. The challenges of non-stable predicates
Διαβάστε περισσότεραΚΥΠΡΙΑΚΟΣ ΣΥΝΔΕΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ CYPRUS COMPUTER SOCIETY 21 ος ΠΑΓΚΥΠΡΙΟΣ ΜΑΘΗΤΙΚΟΣ ΔΙΑΓΩΝΙΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ Δεύτερος Γύρος - 30 Μαρτίου 2011
Διάρκεια Διαγωνισμού: 3 ώρες Απαντήστε όλες τις ερωτήσεις Μέγιστο Βάρος (20 Μονάδες) Δίνεται ένα σύνολο από N σφαιρίδια τα οποία δεν έχουν όλα το ίδιο βάρος μεταξύ τους και ένα κουτί που αντέχει μέχρι
Διαβάστε περισσότεραΒΑΣΕΙΣ Ε ΟΜΕΝΩΝ ΙΙ. Επεξεργασία οσοληψιών. το πώς βλέπει το Σ Β τα προγράµµατα των χρηστών. οσοληψία (transaction)
Ύλη Ύλη Έννοιες Επεξεργασίας οσοληψιών Τεχνικές Ελέγχου Συνδροµικότητας ΒΑΣΕΙΣ Ε ΟΜΕΝΩΝ ΙΙ Τεχνικές Ανάκαµψεις από Σφάλµατα Κατανεµηµένες και Παράλληλες Βάσεις εδοµένων Βάσεις εδοµένων και ιαδίκτυο Βάσεις
Διαβάστε περισσότεραTest Data Management in Practice
Problems, Concepts, and the Swisscom Test Data Organizer Do you have issues with your legal and compliance department because test environments contain sensitive data outsourcing partners must not see?
Διαβάστε περισσότεραMatrices and Determinants
Matrices and Determinants SUBJECTIVE PROBLEMS: Q 1. For what value of k do the following system of equations possess a non-trivial (i.e., not all zero) solution over the set of rationals Q? x + ky + 3z
Διαβάστε περισσότεραΑπόκριση σε Μοναδιαία Ωστική Δύναμη (Unit Impulse) Απόκριση σε Δυνάμεις Αυθαίρετα Μεταβαλλόμενες με το Χρόνο. Απόστολος Σ.
Απόκριση σε Δυνάμεις Αυθαίρετα Μεταβαλλόμενες με το Χρόνο The time integral of a force is referred to as impulse, is determined by and is obtained from: Newton s 2 nd Law of motion states that the action
Διαβάστε περισσότεραHomework 3 Solutions
Homework 3 Solutions Igor Yanovsky (Math 151A TA) Problem 1: Compute the absolute error and relative error in approximations of p by p. (Use calculator!) a) p π, p 22/7; b) p π, p 3.141. Solution: For
Διαβάστε περισσότεραOrdinal Arithmetic: Addition, Multiplication, Exponentiation and Limit
Ordinal Arithmetic: Addition, Multiplication, Exponentiation and Limit Ting Zhang Stanford May 11, 2001 Stanford, 5/11/2001 1 Outline Ordinal Classification Ordinal Addition Ordinal Multiplication Ordinal
Διαβάστε περισσότεραΕγκατάσταση λογισμικού και αναβάθμιση συσκευής Device software installation and software upgrade
Για να ελέγξετε το λογισμικό που έχει τώρα η συσκευή κάντε κλικ Menu > Options > Device > About Device Versions. Στο πιο κάτω παράδειγμα η συσκευή έχει έκδοση λογισμικού 6.0.0.546 με πλατφόρμα 6.6.0.207.
Διαβάστε περισσότεραC.S. 430 Assignment 6, Sample Solutions
C.S. 430 Assignment 6, Sample Solutions Paul Liu November 15, 2007 Note that these are sample solutions only; in many cases there were many acceptable answers. 1 Reynolds Problem 10.1 1.1 Normal-order
Διαβάστε περισσότεραLecture 2: Dirac notation and a review of linear algebra Read Sakurai chapter 1, Baym chatper 3
Lecture 2: Dirac notation and a review of linear algebra Read Sakurai chapter 1, Baym chatper 3 1 State vector space and the dual space Space of wavefunctions The space of wavefunctions is the set of all
Διαβάστε περισσότεραOther Test Constructions: Likelihood Ratio & Bayes Tests
Other Test Constructions: Likelihood Ratio & Bayes Tests Side-Note: So far we have seen a few approaches for creating tests such as Neyman-Pearson Lemma ( most powerful tests of H 0 : θ = θ 0 vs H 1 :
Διαβάστε περισσότεραthe total number of electrons passing through the lamp.
1. A 12 V 36 W lamp is lit to normal brightness using a 12 V car battery of negligible internal resistance. The lamp is switched on for one hour (3600 s). For the time of 1 hour, calculate (i) the energy
Διαβάστε περισσότεραCode Breaker. TEACHER s NOTES
TEACHER s NOTES Time: 50 minutes Learning Outcomes: To relate the genetic code to the assembly of proteins To summarize factors that lead to different types of mutations To distinguish among positive,
Διαβάστε περισσότεραModbus basic setup notes for IO-Link AL1xxx Master Block
n Modbus has four tables/registers where data is stored along with their associated addresses. We will be using the holding registers from address 40001 to 49999 that are R/W 16 bit/word. Two tables that
Διαβάστε περισσότεραStatistical Inference I Locally most powerful tests
Statistical Inference I Locally most powerful tests Shirsendu Mukherjee Department of Statistics, Asutosh College, Kolkata, India. shirsendu st@yahoo.co.in So far we have treated the testing of one-sided
Διαβάστε περισσότεραAdvanced Subsidiary Unit 1: Understanding and Written Response
Write your name here Surname Other names Edexcel GE entre Number andidate Number Greek dvanced Subsidiary Unit 1: Understanding and Written Response Thursday 16 May 2013 Morning Time: 2 hours 45 minutes
Διαβάστε περισσότεραSection 9.2 Polar Equations and Graphs
180 Section 9. Polar Equations and Graphs In this section, we will be graphing polar equations on a polar grid. In the first few examples, we will write the polar equation in rectangular form to help identify
Διαβάστε περισσότεραDESIGN OF MACHINERY SOLUTION MANUAL h in h 4 0.
DESIGN OF MACHINERY SOLUTION MANUAL -7-1! PROBLEM -7 Statement: Design a double-dwell cam to move a follower from to 25 6, dwell for 12, fall 25 and dwell for the remader The total cycle must take 4 sec
Διαβάστε περισσότεραOverview. Transition Semantics. Configurations and the transition relation. Executions and computation
Overview Transition Semantics Configurations and the transition relation Executions and computation Inference rules for small-step structural operational semantics for the simple imperative language Transition
Διαβάστε περισσότεραMath 6 SL Probability Distributions Practice Test Mark Scheme
Math 6 SL Probability Distributions Practice Test Mark Scheme. (a) Note: Award A for vertical line to right of mean, A for shading to right of their vertical line. AA N (b) evidence of recognizing symmetry
Διαβάστε περισσότεραΤΕΧΝΟΛΟΓΙΚΟ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΥΠΡΟΥ ΤΜΗΜΑ ΝΟΣΗΛΕΥΤΙΚΗΣ
ΤΕΧΝΟΛΟΓΙΚΟ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΥΠΡΟΥ ΤΜΗΜΑ ΝΟΣΗΛΕΥΤΙΚΗΣ ΠΤΥΧΙΑΚΗ ΕΡΓΑΣΙΑ ΨΥΧΟΛΟΓΙΚΕΣ ΕΠΙΠΤΩΣΕΙΣ ΣΕ ΓΥΝΑΙΚΕΣ ΜΕΤΑ ΑΠΟ ΜΑΣΤΕΚΤΟΜΗ ΓΕΩΡΓΙΑ ΤΡΙΣΟΚΚΑ Λευκωσία 2012 ΤΕΧΝΟΛΟΓΙΚΟ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΥΠΡΟΥ ΣΧΟΛΗ ΕΠΙΣΤΗΜΩΝ
Διαβάστε περισσότεραExample of the Baum-Welch Algorithm
Example of the Baum-Welch Algorithm Larry Moss Q520, Spring 2008 1 Our corpus c We start with a very simple corpus. We take the set Y of unanalyzed words to be {ABBA, BAB}, and c to be given by c(abba)
Διαβάστε περισσότεραSection 7.6 Double and Half Angle Formulas
09 Section 7. Double and Half Angle Fmulas To derive the double-angles fmulas, we will use the sum of two angles fmulas that we developed in the last section. We will let α θ and β θ: cos(θ) cos(θ + θ)
Διαβάστε περισσότεραΣυστήματα Διαχείρισης Βάσεων Δεδομένων
ΕΛΛΗΝΙΚΗ ΔΗΜΟΚΡΑΤΙΑ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΡΗΤΗΣ Συστήματα Διαχείρισης Βάσεων Δεδομένων Φροντιστήριο 10: Transactions - part 2 Δημήτρης Πλεξουσάκης Τμήμα Επιστήμης Υπολογιστών Tutorial on 2-Phase Locking and Other
Διαβάστε περισσότεραANSWERSHEET (TOPIC = DIFFERENTIAL CALCULUS) COLLECTION #2. h 0 h h 0 h h 0 ( ) g k = g 0 + g 1 + g g 2009 =?
Teko Classes IITJEE/AIEEE Maths by SUHAAG SIR, Bhopal, Ph (0755) 3 00 000 www.tekoclasses.com ANSWERSHEET (TOPIC DIFFERENTIAL CALCULUS) COLLECTION # Question Type A.Single Correct Type Q. (A) Sol least
Διαβάστε περισσότερα6.1. Dirac Equation. Hamiltonian. Dirac Eq.
6.1. Dirac Equation Ref: M.Kaku, Quantum Field Theory, Oxford Univ Press (1993) η μν = η μν = diag(1, -1, -1, -1) p 0 = p 0 p = p i = -p i p μ p μ = p 0 p 0 + p i p i = E c 2 - p 2 = (m c) 2 H = c p 2
Διαβάστε περισσότεραΔοσοληψίες Βάσεις Δεδομένων Διδάσκων: Μαρία Χαλκίδη
Δοσοληψίες Βάσεις Δεδομένων Διδάσκων: Μαρία Χαλκίδη με βάση slides από A. Silberschatz, H. Korth, S. Sudarshan, Database System Concepts, 5 th edition Βασικές έννοιες της δοσοληψίας Δοσοληψία είναι μία
Διαβάστε περισσότεραRight Rear Door. Let's now finish the door hinge saga with the right rear door
Right Rear Door Let's now finish the door hinge saga with the right rear door You may have been already guessed my steps, so there is not much to describe in detail. Old upper one file:///c /Documents
Διαβάστε περισσότεραΠΑΝΕΠΙΣΤΗΜΙΟ ΠΑΤΡΩΝ - ΤΜΗΥΠ ΒΑΣΕΙΣ ΔΕΔΟΜΕΝΩΝ ΙI
ΠΑΝΕΠΙΣΤΗΜΙΟ ΠΑΤΡΩΝ - ΤΜΗΥΠ ΒΑΣΕΙΣ ΔΕΔΟΜΕΝΩΝ ΙI Β. Μεγαλοοικονόμου Επεξεργασία Δοσοληψιών (Transaction Processing) (παρουσίαση βασισμένη εν μέρη σε σημειώσεις των Silberchatz, Korth και Sudarshan και του
Διαβάστε περισσότεραBlock Ciphers Modes. Ramki Thurimella
Block Ciphers Modes Ramki Thurimella Only Encryption I.e. messages could be modified Should not assume that nonsensical messages do no harm Always must be combined with authentication 2 Padding Must be
Διαβάστε περισσότεραApproximation of distance between locations on earth given by latitude and longitude
Approximation of distance between locations on earth given by latitude and longitude Jan Behrens 2012-12-31 In this paper we shall provide a method to approximate distances between two points on earth
Διαβάστε περισσότεραΑλγόριθμοι και πολυπλοκότητα NP-Completeness (2)
ΕΛΛΗΝΙΚΗ ΔΗΜΟΚΡΑΤΙΑ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΡΗΤΗΣ Αλγόριθμοι και πολυπλοκότητα NP-Completeness (2) Ιωάννης Τόλλης Τμήμα Επιστήμης Υπολογιστών NP-Completeness (2) x 1 x 1 x 2 x 2 x 3 x 3 x 4 x 4 12 22 32 11 13 21
Διαβάστε περισσότεραEvery set of first-order formulas is equivalent to an independent set
Every set of first-order formulas is equivalent to an independent set May 6, 2008 Abstract A set of first-order formulas, whatever the cardinality of the set of symbols, is equivalent to an independent
Διαβάστε περισσότεραdepartment listing department name αχχουντσ ϕανε βαλικτ δδσϕηασδδη σδηφγ ασκϕηλκ τεχηνιχαλ αλαν ϕουν διξ τεχηνιχαλ ϕοην µαριανι
She selects the option. Jenny starts with the al listing. This has employees listed within She drills down through the employee. The inferred ER sttricture relates this to the redcords in the databasee
Διαβάστε περισσότεραPartial Trace and Partial Transpose
Partial Trace and Partial Transpose by José Luis Gómez-Muñoz http://homepage.cem.itesm.mx/lgomez/quantum/ jose.luis.gomez@itesm.mx This document is based on suggestions by Anirban Das Introduction This
Διαβάστε περισσότεραSecond Order RLC Filters
ECEN 60 Circuits/Electronics Spring 007-0-07 P. Mathys Second Order RLC Filters RLC Lowpass Filter A passive RLC lowpass filter (LPF) circuit is shown in the following schematic. R L C v O (t) Using phasor
Διαβάστε περισσότεραUNIVERSITY OF CALIFORNIA. EECS 150 Fall ) You are implementing an 4:1 Multiplexer that has the following specifications:
UNIVERSITY OF CALIFORNIA Department of Electrical Engineering and Computer Sciences EECS 150 Fall 2001 Prof. Subramanian Midterm II 1) You are implementing an 4:1 Multiplexer that has the following specifications:
Διαβάστε περισσότερα5.4 The Poisson Distribution.
The worst thing you can do about a situation is nothing. Sr. O Shea Jackson 5.4 The Poisson Distribution. Description of the Poisson Distribution Discrete probability distribution. The random variable
Διαβάστε περισσότεραEcon 2110: Fall 2008 Suggested Solutions to Problem Set 8 questions or comments to Dan Fetter 1
Eon : Fall 8 Suggested Solutions to Problem Set 8 Email questions or omments to Dan Fetter Problem. Let X be a salar with density f(x, θ) (θx + θ) [ x ] with θ. (a) Find the most powerful level α test
Διαβάστε περισσότεραMain source: "Discrete-time systems and computer control" by Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 4 ΔΙΑΦΑΝΕΙΑ 1
Main source: "Discrete-time systems and computer control" by Α. ΣΚΟΔΡΑΣ ΨΗΦΙΑΚΟΣ ΕΛΕΓΧΟΣ ΔΙΑΛΕΞΗ 4 ΔΙΑΦΑΝΕΙΑ 1 A Brief History of Sampling Research 1915 - Edmund Taylor Whittaker (1873-1956) devised a
Διαβάστε περισσότεραMath221: HW# 1 solutions
Math: HW# solutions Andy Royston October, 5 7.5.7, 3 rd Ed. We have a n = b n = a = fxdx = xdx =, x cos nxdx = x sin nx n sin nxdx n = cos nx n = n n, x sin nxdx = x cos nx n + cos nxdx n cos n = + sin
Διαβάστε περισσότεραSrednicki Chapter 55
Srednicki Chapter 55 QFT Problems & Solutions A. George August 3, 03 Srednicki 55.. Use equations 55.3-55.0 and A i, A j ] = Π i, Π j ] = 0 (at equal times) to verify equations 55.-55.3. This is our third
Διαβάστε περισσότεραSection 1: Listening and responding. Presenter: Niki Farfara MGTAV VCE Seminar 7 August 2016
Section 1: Listening and responding Presenter: Niki Farfara MGTAV VCE Seminar 7 August 2016 Section 1: Listening and responding Section 1: Listening and Responding/ Aκουστική εξέταση Στο πρώτο μέρος της
Διαβάστε περισσότεραb. Use the parametrization from (a) to compute the area of S a as S a ds. Be sure to substitute for ds!
MTH U341 urface Integrals, tokes theorem, the divergence theorem To be turned in Wed., Dec. 1. 1. Let be the sphere of radius a, x 2 + y 2 + z 2 a 2. a. Use spherical coordinates (with ρ a) to parametrize.
Διαβάστε περισσότεραNowhere-zero flows Let be a digraph, Abelian group. A Γ-circulation in is a mapping : such that, where, and : tail in X, head in
Nowhere-zero flows Let be a digraph, Abelian group. A Γ-circulation in is a mapping : such that, where, and : tail in X, head in : tail in X, head in A nowhere-zero Γ-flow is a Γ-circulation such that
Διαβάστε περισσότεραPARTIAL NOTES for 6.1 Trigonometric Identities
PARTIAL NOTES for 6.1 Trigonometric Identities tanθ = sinθ cosθ cotθ = cosθ sinθ BASIC IDENTITIES cscθ = 1 sinθ secθ = 1 cosθ cotθ = 1 tanθ PYTHAGOREAN IDENTITIES sin θ + cos θ =1 tan θ +1= sec θ 1 + cot
Διαβάστε περισσότεραChapter 6: Systems of Linear Differential. be continuous functions on the interval
Chapter 6: Systems of Linear Differential Equations Let a (t), a 2 (t),..., a nn (t), b (t), b 2 (t),..., b n (t) be continuous functions on the interval I. The system of n first-order differential equations
Διαβάστε περισσότεραΒΑΣΕΙΣ Ε ΟΜΕΝΩΝ ΙΙ. Σχετικά µε το µάθηµα: Αξιολόγηση. Σχετικά µε το µάθηµα:faq ΟΧΙ ΝΑΙ. Λιγότερος! (ας πούµε το 1/3-1/4)
ΒΑΣΕΙΣ Ε ΟΜΕΝΩΝ ΙΙ Κάποιες γενικές πληροφορίες συνοπτικά... Βάσεις εδοµένων II 2004-2005 Ευαγγελία Πιτουρά 1 Βάσεις εδοµένων II 2004-2005 Ευαγγελία Πιτουρά 2 Σχετικά µε το µάθηµα: Ύλη Σχετικά µε το µάθηµα:
Διαβάστε περισσότεραΟδηγίες Αγοράς Ηλεκτρονικού Βιβλίου Instructions for Buying an ebook
Οδηγίες Αγοράς Ηλεκτρονικού Βιβλίου Instructions for Buying an ebook Βήμα 1: Step 1: Βρείτε το βιβλίο που θα θέλατε να αγοράσετε και πατήστε Add to Cart, για να το προσθέσετε στο καλάθι σας. Αυτόματα θα
Διαβάστε περισσότεραΜηχανική Μάθηση Hypothesis Testing
ΕΛΛΗΝΙΚΗ ΔΗΜΟΚΡΑΤΙΑ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΡΗΤΗΣ Μηχανική Μάθηση Hypothesis Testing Γιώργος Μπορμπουδάκης Τμήμα Επιστήμης Υπολογιστών Procedure 1. Form the null (H 0 ) and alternative (H 1 ) hypothesis 2. Consider
Διαβάστε περισσότεραΚΥΠΡΙΑΚΗ ΕΤΑΙΡΕΙΑ ΠΛΗΡΟΦΟΡΙΚΗΣ CYPRUS COMPUTER SOCIETY ΠΑΓΚΥΠΡΙΟΣ ΜΑΘΗΤΙΚΟΣ ΔΙΑΓΩΝΙΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ 24/3/2007
Οδηγίες: Να απαντηθούν όλες οι ερωτήσεις. Όλοι οι αριθμοί που αναφέρονται σε όλα τα ερωτήματα μικρότεροι του 10000 εκτός αν ορίζεται διαφορετικά στη διατύπωση του προβλήματος. Αν κάπου κάνετε κάποιες υποθέσεις
Διαβάστε περισσότεραChapter 3: Ordinal Numbers
Chapter 3: Ordinal Numbers There are two kinds of number.. Ordinal numbers (0th), st, 2nd, 3rd, 4th, 5th,..., ω, ω +,... ω2, ω2+,... ω 2... answers to the question What position is... in a sequence? What
Διαβάστε περισσότεραΚΥΠΡΙΑΚΗ ΕΤΑΙΡΕΙΑ ΠΛΗΡΟΦΟΡΙΚΗΣ CYPRUS COMPUTER SOCIETY ΠΑΓΚΥΠΡΙΟΣ ΜΑΘΗΤΙΚΟΣ ΔΙΑΓΩΝΙΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ 11/3/2006
ΠΑΓΚΥΠΡΙΟΣ ΜΑΘΗΤΙΚΟΣ ΔΙΑΓΩΝΙΣΜΟΣ ΠΛΗΡΟΦΟΡΙΚΗΣ 11/3/26 Οδηγίες: Να απαντηθούν όλες οι ερωτήσεις. Ολοι οι αριθμοί που αναφέρονται σε όλα τα ερωτήματα μικρότεροι το 1 εκτός αν ορίζεται διαφορετικά στη διατύπωση
Διαβάστε περισσότεραΔοσοληψίες. Κατανεμημένα Συστήματα
Δοσοληψίες Κατανεμημένα Συστήματα 2018-2019 http://www.cslab.ece.ntua.gr/courses/distrib Στο προηγούμενο μάθημα Group communication Multicast για FIFO διάταξη Multicast για ολική διάταξη Sequencer ISIS
Διαβάστε περισσότεραΒάσεις Δεδομένων ΙΙ. Διάλεξη 1 η Επεξεργασία Δοσοληψιών. Σύστημα Επεξεργασίας Δοσοληψιών
Βάσεις Δεδομένων ΙΙ Διάλεξη 1 η Επεξεργασία Δοσοληψιών Δ. Χριστοδουλάκης - Α. Φωκά Τμήμα Μηχανικών Η/Υ & Πληροφορικής - Εαρινό Εξάμηνο 2007 Ορισμός Προβλήματος Σύστημα Επεξεργασίας Δοσοληψιών Συστήματα
Διαβάστε περισσότεραHow to register an account with the Hellenic Community of Sheffield.
How to register an account with the Hellenic Community of Sheffield. (1) EN: Go to address GR: Πηγαίνετε στη διεύθυνση: http://www.helleniccommunityofsheffield.com (2) EN: At the bottom of the page, click
Διαβάστε περισσότεραΓΡΑΜΜΙΚΟΣ & ΔΙΚΤΥΑΚΟΣ ΠΡΟΓΡΑΜΜΑΤΙΣΜΟΣ
ΓΡΑΜΜΙΚΟΣ & ΔΙΚΤΥΑΚΟΣ ΠΡΟΓΡΑΜΜΑΤΙΣΜΟΣ Ενότητα 12: Συνοπτική Παρουσίαση Ανάπτυξης Κώδικα με το Matlab Σαμαράς Νικόλαος Άδειες Χρήσης Το παρόν εκπαιδευτικό υλικό υπόκειται σε άδειες χρήσης Creative Commons.
Διαβάστε περισσότεραΕΛΛΗΝΙΚΗ ΔΗΜΟΚΡΑΤΙΑ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΡΗΤΗΣ. Ψηφιακή Οικονομία. Διάλεξη 7η: Consumer Behavior Mαρίνα Μπιτσάκη Τμήμα Επιστήμης Υπολογιστών
ΕΛΛΗΝΙΚΗ ΔΗΜΟΚΡΑΤΙΑ ΠΑΝΕΠΙΣΤΗΜΙΟ ΚΡΗΤΗΣ Ψηφιακή Οικονομία Διάλεξη 7η: Consumer Behavior Mαρίνα Μπιτσάκη Τμήμα Επιστήμης Υπολογιστών Τέλος Ενότητας Χρηματοδότηση Το παρόν εκπαιδευτικό υλικό έχει αναπτυχθεί
Διαβάστε περισσότεραΠΑΝΕΠΙΣΤΗΜΙΟ ΠΕΙΡΑΙΑ ΤΜΗΜΑ ΝΑΥΤΙΛΙΑΚΩΝ ΣΠΟΥΔΩΝ ΠΡΟΓΡΑΜΜΑ ΜΕΤΑΠΤΥΧΙΑΚΩΝ ΣΠΟΥΔΩΝ ΣΤΗΝ ΝΑΥΤΙΛΙΑ
ΠΑΝΕΠΙΣΤΗΜΙΟ ΠΕΙΡΑΙΑ ΤΜΗΜΑ ΝΑΥΤΙΛΙΑΚΩΝ ΣΠΟΥΔΩΝ ΠΡΟΓΡΑΜΜΑ ΜΕΤΑΠΤΥΧΙΑΚΩΝ ΣΠΟΥΔΩΝ ΣΤΗΝ ΝΑΥΤΙΛΙΑ ΝΟΜΙΚΟ ΚΑΙ ΘΕΣΜΙΚΟ ΦΟΡΟΛΟΓΙΚΟ ΠΛΑΙΣΙΟ ΚΤΗΣΗΣ ΚΑΙ ΕΚΜΕΤΑΛΛΕΥΣΗΣ ΠΛΟΙΟΥ ΔΙΠΛΩΜΑΤΙΚΗ ΕΡΓΑΣΙΑ που υποβλήθηκε στο
Διαβάστε περισσότεραEPL 603 TOPICS IN SOFTWARE ENGINEERING. Lab 5: Component Adaptation Environment (COPE)
EPL 603 TOPICS IN SOFTWARE ENGINEERING Lab 5: Component Adaptation Environment (COPE) Performing Static Analysis 1 Class Name: The fully qualified name of the specific class Type: The type of the class
Διαβάστε περισσότεραΔοσοληψίες. Κατανεμημένα Συστήματα
Δοσοληψίες Κατανεμημένα Συστήματα 2016-2017 http://www.cslab.ece.ntua.gr/courses/distrib Στο προηγούμενο μάθημα Group communication Multicast για FIFO διάταξη Multicast για ολική διάταξη Sequencer ISIS
Διαβάστε περισσότεραΠλειάδες φαντάσματα (phantoms)
Πλειάδες φαντάσματα (phantoms) Τα phantoms είναι πλειάδες που θα έπρεπε να έχουν φραγή αλλά δεν έχουν, γιατί δεν υπήρχαν όταν αποκτήθηκε το lock Παράδειγμα: σχέση R (E#, name, ) constraint: E# is key χρήση
Διαβάστε περισσότεραΑκεραιότητα και Ασφάλεια Μέρος 1 Σχεδιασμός Βάσεων Δεδομένων
Ακεραιότητα και Ασφάλεια Μέρος 1 Σχεδιασμός Βάσεων Δεδομένων με βάση slides από A. Silberschatz, H. Korth, S. Sudarshan, Database System Concepts, 5 th edition Περιορισμοί πεδίου τιμών Περιορισμοί ακεραιότητας
Διαβάστε περισσότεραInverse trigonometric functions & General Solution of Trigonometric Equations. ------------------ ----------------------------- -----------------
Inverse trigonometric functions & General Solution of Trigonometric Equations. 1. Sin ( ) = a) b) c) d) Ans b. Solution : Method 1. Ans a: 17 > 1 a) is rejected. w.k.t Sin ( sin ) = d is rejected. If sin
Διαβάστε περισσότεραΚεφάλαιο 13 Δοσοληψίες
Κεφάλαιο 13 Δοσοληψίες Σύνοψη Στο παρόν κεφάλαιο θα παρουσιασθούν βασικά στοιχεία όσον αφορά τις δοσοληψίες, την έννοια της σειριοποιησιμότητας και των διαφόρων επιπέδων απομόνωσης. Προαπαιτούμενη γνώση
Διαβάστε περισσότεραFractional Colorings and Zykov Products of graphs
Fractional Colorings and Zykov Products of graphs Who? Nichole Schimanski When? July 27, 2011 Graphs A graph, G, consists of a vertex set, V (G), and an edge set, E(G). V (G) is any finite set E(G) is
Διαβάστε περισσότερα