{"id":{"repo_id":"greece","oai_identifier":"oai:10442/0172"},"canonical_url":"https://search.dev.ndltd.org/etd/greece/oai:10442/0172","repository":{"repo_id":"greece","name":"Greek National Archive of PhD Theses","base_url":"https://phdtheses.ekt.gr/eadd_oai/request"},"display":{"title":"ΠΡΟΒΛΗΜΑΤΑ ΣΥΝΤΟΝΙΣΜΟΥ ΤΑΥΤΟΧΡΟΝΩΝ ΠΡΟΣΠΕΛΑΣΕΩΝ ΣΕ ΒΑΣΕΙΣ ΔΕΔΟΜΕΝΩΝ","abstract":"THIS THESIS DEALS WITH SOME ISSUES IN CONCURRENCY CONTROL OF DATABASE ACCESSES. MULTIVERSION SCHEDULERS ARE NOW A WIDELY ACCEPTED METHOD FOR ENHANCING THE PERFORMANCE OF THE CONCURRENCY CONTROL COMPONENT OF A DATABASE. IN THE 2ND CHAPTER OF THE THESIS WE INTRODUCE A NEW NOTION OF MULTIVERSION SERIALIZABILITY (MVSR) BASED ON CONFLICTS (MVCSR) AND DISCUSS ITS RELATION WITH THE WELL KNOWN SINGLE VERSION CONFLICT SERIALIZABILITY (CSR). WE PROVE THAT IT IS NP-COMPLETE TO DECIDE WHETHER A SET OF SCHEDULES IS ON-LINE SCHEDULABLE (OLS). WE INTRODUCE THE CONCEPT OF MAXIMAL OLS SETS AND SHOW THAT NO EFFICIENT SCHEDULER CAN BEDESGNED THAT RECOGNIZES MAXIMAL SUBSETS OF MVSR OR MVCSR. FINALLY A GENERAL FRAMEWORK FOR ALGORITHMS BASED ON MVCSR IS PRESENTED. IN CHAPTER 3 WE SOLVE AN OPEN PROBLEM FOR THE WELL KNOWN CONFLICT GRAPH SCHEDULER: WHEN CAN A NODE BE DELETED FROM THE GRAPH AFTER THE COMPLETION OF THE CORRESPONDING TRANSACTION? WE GIVE A SUFFICIENT AND NECESSARY CONDITION FOR THIS. WE EXAMINE THE DYNAMIC PROBLEM, I.E. REPEATEDLY DELETING NODES AS THE SCHEDULE PROCEEDS AND WE STUDY THE PROBLEM UNDER SEVERAL VARIATIONS OF THE TRANSACTIONS MODEL.","abstract_html":"THIS THESIS DEALS WITH SOME ISSUES IN CONCURRENCY CONTROL OF DATABASE ACCESSES. MULTIVERSION SCHEDULERS ARE NOW A WIDELY ACCEPTED METHOD FOR ENHANCING THE PERFORMANCE OF THE CONCURRENCY CONTROL COMPONENT OF A DATABASE. IN THE 2ND CHAPTER OF THE THESIS WE INTRODUCE A NEW NOTION OF MULTIVERSION SERIALIZABILITY (MVSR) BASED ON CONFLICTS (MVCSR) AND DISCUSS ITS RELATION WITH THE WELL KNOWN SINGLE VERSION CONFLICT SERIALIZABILITY (CSR). WE PROVE THAT IT IS NP-COMPLETE TO DECIDE WHETHER A SET OF SCHEDULES IS ON-LINE SCHEDULABLE (OLS). WE INTRODUCE THE CONCEPT OF MAXIMAL OLS SETS AND SHOW THAT NO EFFICIENT SCHEDULER CAN BEDESGNED THAT RECOGNIZES MAXIMAL SUBSETS OF MVSR OR MVCSR. FINALLY A GENERAL FRAMEWORK FOR ALGORITHMS BASED ON MVCSR IS PRESENTED. IN CHAPTER 3 WE SOLVE AN OPEN PROBLEM FOR THE WELL KNOWN CONFLICT GRAPH SCHEDULER: WHEN CAN A NODE BE DELETED FROM THE GRAPH AFTER THE COMPLETION OF THE CORRESPONDING TRANSACTION? WE GIVE A SUFFICIENT AND NECESSARY CONDITION FOR THIS. WE EXAMINE THE DYNAMIC PROBLEM, I.E. REPEATEDLY DELETING NODES AS THE SCHEDULE PROCEEDS AND WE STUDY THE PROBLEM UNDER SEVERAL VARIATIONS OF THE TRANSACTIONS MODEL.","abstract_has_math":false,"creators":["Hatzilacos, Thanasis","Χατζηλάκος, Αθανάσιος"],"institution":"University of Patras","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":1986,"date_issued":"1986","date_published":"1986","updated_at":"2026-07-24T02:25:05Z","subjects":["Βάσεις δεδομένων","ΔΙΑΓΡΑΦΗΔΟΣΟΛΗΨΙΩΝ","ΘΕΩΡΙΑ ΒΑΣΕΩΝ ΔΕΔΟΜΕΝΩΝ","ΠΛΗΡΟΤΗΤΑ ΣΤΟ NP","Πληροφορική","ΣΕΙΡΙΟΠΟΙΗΣΙΜΟΤΗΤΑ ΑΝΤΙΘΕΣΕΩΝ","ΣΥΝΤΟΝΙΣΜΟΣ ΜΕ ΑΝΤΙΓΡΑΦΑ","ΣΥΝΤΟΝΙΣΜΟΣ ΠΡΟΣΠΕΛΑΣΕΩΝ","Συντονιστές","ΣΥΝΤΟΝΙΣΤΗΣ ΓΡΑΦΟΥ ΑΝΤΙΘΕΣΕΩΝ","CONCURRENCY CONTROL","CONFLICT GRAPH SCHEDULER","CONFLICT SERIALIZABILITY","DATABASE SYSTEMS","DELETING TRANSACTIONS","MULTIVERSION CONCURRENCY","NP - completeness","Schedulers","Φυσικές Επιστήμες","Επιστήμη Ηλεκτρονικών Υπολογιστών και Πληροφορική","Επιστήμες Μηχανικού και Τεχνολογία","Επιστήμη Ηλεκτρολόγου Μηχανικού, Ηλεκτρονικού Μηχανικού, Μηχανικού Η/Υ","Natural Sciences","Computer and Information Sciences","Engineering and Technology","Electrical Engineering, Electronic Engineering, Information Engineering"],"languages":["gre"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["10.12681/eadd/0172"],"render_values":[{"text":"10.12681/eadd/0172","href":"https://doi.org/10.12681/eadd/0172","code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/10442/hedi/0172","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Hatzilacos, Thanasis","Χατζηλάκος, Αθανάσιος"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["1986"]},{"key":"dc:publisher","label":"Institution","values":["University of Patras","Πανεπιστήμιο Πατρών"]},{"key":"dc:type","label":"Dc Type","values":["PhD Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Βάσεις δεδομένων","ΔΙΑΓΡΑΦΗΔΟΣΟΛΗΨΙΩΝ","ΘΕΩΡΙΑ ΒΑΣΕΩΝ ΔΕΔΟΜΕΝΩΝ","ΠΛΗΡΟΤΗΤΑ ΣΤΟ NP","Πληροφορική","ΣΕΙΡΙΟΠΟΙΗΣΙΜΟΤΗΤΑ ΑΝΤΙΘΕΣΕΩΝ","ΣΥΝΤΟΝΙΣΜΟΣ ΜΕ ΑΝΤΙΓΡΑΦΑ","ΣΥΝΤΟΝΙΣΜΟΣ ΠΡΟΣΠΕΛΑΣΕΩΝ","Συντονιστές","ΣΥΝΤΟΝΙΣΤΗΣ ΓΡΑΦΟΥ ΑΝΤΙΘΕΣΕΩΝ","CONCURRENCY CONTROL","CONFLICT GRAPH SCHEDULER","CONFLICT SERIALIZABILITY","DATABASE SYSTEMS","DELETING TRANSACTIONS","MULTIVERSION CONCURRENCY","NP - completeness","Schedulers","Φυσικές Επιστήμες","Επιστήμη Ηλεκτρονικών Υπολογιστών και Πληροφορική","Επιστήμες Μηχανικού και Τεχνολογία","Επιστήμη Ηλεκτρολόγου Μηχανικού, Ηλεκτρονικού Μηχανικού, Μηχανικού Η/Υ","Natural Sciences","Computer and Information Sciences","Engineering and Technology","Electrical Engineering, Electronic Engineering, Information Engineering"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["gre"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["10.12681/eadd/0172","http://hdl.handle.net/10442/hedi/0172"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["THIS THESIS DEALS WITH SOME ISSUES IN CONCURRENCY CONTROL OF DATABASE ACCESSES. MULTIVERSION SCHEDULERS ARE NOW A WIDELY ACCEPTED METHOD FOR ENHANCING THE PERFORMANCE OF THE CONCURRENCY CONTROL COMPONENT OF A DATABASE. IN THE 2ND CHAPTER OF THE THESIS WE INTRODUCE A NEW NOTION OF MULTIVERSION SERIALIZABILITY (MVSR) BASED ON CONFLICTS (MVCSR) AND DISCUSS ITS RELATION WITH THE WELL KNOWN SINGLE VERSION CONFLICT SERIALIZABILITY (CSR). WE PROVE THAT IT IS NP-COMPLETE TO DECIDE WHETHER A SET OF SCHEDULES IS ON-LINE SCHEDULABLE (OLS). WE INTRODUCE THE CONCEPT OF MAXIMAL OLS SETS AND SHOW THAT NO EFFICIENT SCHEDULER CAN BEDESGNED THAT RECOGNIZES MAXIMAL SUBSETS OF MVSR OR MVCSR. FINALLY A GENERAL FRAMEWORK FOR ALGORITHMS BASED ON MVCSR IS PRESENTED. IN CHAPTER 3 WE SOLVE AN OPEN PROBLEM FOR THE WELL KNOWN CONFLICT GRAPH SCHEDULER: WHEN CAN A NODE BE DELETED FROM THE GRAPH AFTER THE COMPLETION OF THE CORRESPONDING TRANSACTION? WE GIVE A SUFFICIENT AND NECESSARY CONDITION FOR THIS. WE EXAMINE THE DYNAMIC PROBLEM, I.E. REPEATEDLY DELETING NODES AS THE SCHEDULE PROCEEDS AND WE STUDY THE PROBLEM UNDER SEVERAL VARIATIONS OF THE TRANSACTIONS MODEL.","ΣΤΗ ΔΙΑΤΡΙΒΗ ΑΥΤΗ ΜΕΛΕΤΟΥΜΕ ΠΡΟΒΛΗΜΑΤΑ ΣΥΝΤΟΝΙΣΜΟΥ ΤΑΥΤΟΧΡΟΝΩΝ ΠΡΟΣΠΕΛΑΣΕΩΝ ΣΕΒΑΣΕΙΣ ΔΕΔΟΜΕΝΩΝ. ΟΙ ΣΥΝΤΟΝΙΣΤΕΣ ΜΕ ΑΝΤΙΓΡΑΦΑ ΕΙΝΑΙ ΗΔΗ ΕΝΑΣ ΠΛΑΤΙΑ ΑΠΟΔΕΚΤΟΣΜΗΧΑΝΙΣΜΟΣ ΓΙΑ ΒΕΛΤΙΩΣΗ ΤΗΣ ΑΠΟΔΟΣΗΣ ΤΟΥ ΣΥΝΤΟΝΙΣΜΟΥ. ΣΤΟ ΚΕΦΑΛΑΙΟ 2 ΤΗΣ ΔΙΑΤΡΙΒΗΣ ΕΙΣΑΓΟΥΜΕ ΜΙΑ ΝΕΑ ΕΝΝΟΙΑ ΣΕΙΡΙΟΠΟΙΗΣΙΜΟΤΗΤΑΣ ΜΕ ΑΝΤΙΓΡΑΦΑ (MVSR) ΠΟΥ ΒΑΣΙΖΕΤΑΙ ΣΤΗΝ ΕΝΝΟΙΑ ΤΗΣ ΑΝΤΙΘΕΣΗΣ (MVCSR) ΚΑΙ ΜΕΛΕΤΟΥΜΕ ΤΗ ΣΧΕΣΗ ΤΗΣ ΜΕ ΤΗΝ ΚΛΑΣΣΙΚΗ ΕΝΝΟΙΑ ΤΗΣ ΑΝΤΙΘΕΣΗΣ ΧΩΡΙΣ ΑΝΤΙΓΡΑΦΑ (CSR). ΑΠΟΔΕΙΚΝΥΟΥΜΕ ΟΤΙ ΤΟ ΠΡΟΒΛΗΜΑ ΤΟΥ ΑΝ ΕΝΑ ΣΥΝΟΛΟ ΧΡΟΝΙΚΩΝ ΕΙΝΑΙ ΕΠΙΤΟΠΟΥ ΣΥΝΤΟΝΙΣΙΜΟ (ΕΤΣ) ΕΙΝΑΙ ΠΛΗΡΕΣ ΣΤΟΝΡ. ΕΙΣΑΓΟΥΜΕ ΤΗΝ ΕΝΝΟΙΑ ΤΩΝ ΜΕΓΙΣΤΩΝ ΕΤΣ ΣΥΝΟΛΩΝ ΧΡΟΝΙΚΩΝ ΚΑΙ ΑΠΟΔΕΙΚΝΥΟΥΜΕΟΤΙ ΕΙΝΑΙ ΑΔΥΝΑΤΗ Η ΚΑΤΑΣΚΕΥΗ ΑΠΟΔΟΤΙΚΩΝ ΣΥΝΤΟΝΙΣΤΩΝ ΠΟΥ ΝΑ ΑΝΑΓΝΩΡΙΖΟΥΝ ΜΕΓΙΣΤΑ ΕΤΣ ΥΠΟΣΥΝΟΛΑ ΤΟΥ MVSR # ΤΟΥ MVCSR. ΤΕΛΟΣ ΠΑΡΟΥΣΙΑΖΟΥΜΕ ΕΝΑ ΓΕΝΙΚΟ ΑΛΓΟΡΙΘΜΙΚΟ ΠΛΑΙΣΙΟ ΓΙΑ ΣΥΝΤΟΝΙΣΤΕΣ MVCSR. ΣΤΟ 3 ΚΕΦΑΛΑΙΟ ΛΥΝΟΥΜΕ ΤΟ ΠΡΟΒΛΗΜΑ ΤΟΥ ΚΛΕΙΣΙΜΑΤΟΣ ΔΟΣΟΛΗΨΙΩΝ ΓΙΑ ΤΟ ΓΝΩΣΤΟ ΣΥΝΤΟΝΙΣΤΗ ΓΡΑΦΟΥ ΑΝΤΙΘΕΣΕΩΝ. ΤΟ ΠΡΟΒΛΗΜΑ ΕΙΝΑΙ: ΠΟΤΕ ΜΠΟΡΕΙ ΝΑ ΔΙΑΓΡΑΦΕΙ ΕΝΑΣ ΚΟΜΒΟΣ ΑΦΟΥ Η ΑΝΤΙΣΤΟΙΧΗ ΔΟΣΟΛΗΨΙΑ ΕΧΕΙ ΟΛΟΚΛΗΡΩΘΕΙ; ΒΡΙΣΚΟΥΜΕ ΜΙΑ ΑΝΑΓΚΑΙΑ ΚΑΙ ΙΚΑΝΗ ΣΥΝΘΗΚΗ ΓΙ'ΑΥΤΟ. ΜΕΛΕΤΟΥΜΕ ΤΟ ΔΥΝΑΜΙΚΟ ΠΡΟΒΛΗΜΑ ΤΗΣ ΚΑΤΕΠΑΝΑΛΗΨΗ ΔΙΑΓΡΑΦΗΣ ΚΟΜΒΩΝ ΟΣΟ ΠΡΟΧΩΡΕΙ ΤΟ ΧΡΟΝΙΚΟ ΚΑΙ ΜΕΛΕΤΟΥΜΕ ΤΟ ΠΡΟΒΛΗΜΑ ΤΟΥ ΚΛΕΙΣΙΜΑΤΟΣ ΓΙΑ ΟΡΙΣΜΕΝΕΣ ΠΑΡΑΛΛΑΓΕΣ ΤΟΥ ΜΟΝΤΕΛΟΥ ΤΩΝ ΔΟΣΟΛΗΨΙΩΝ."]},{"key":"dc:title","label":"Title","values":["ΠΡΟΒΛΗΜΑΤΑ ΣΥΝΤΟΝΙΣΜΟΥ ΤΑΥΤΟΧΡΟΝΩΝ ΠΡΟΣΠΕΛΑΣΕΩΝ ΣΕ ΒΑΣΕΙΣ ΔΕΔΟΜΕΝΩΝ","ISSUES IN DATABASE CONCURRENCY CONTROL"]}]}],"canonical_facts":{"dc:creator":["Hatzilacos, Thanasis","Χατζηλάκος, Αθανάσιος"],"dc:date":["1986"],"dc:description":["THIS THESIS DEALS WITH SOME ISSUES IN CONCURRENCY CONTROL OF DATABASE ACCESSES. MULTIVERSION SCHEDULERS ARE NOW A WIDELY ACCEPTED METHOD FOR ENHANCING THE PERFORMANCE OF THE CONCURRENCY CONTROL COMPONENT OF A DATABASE. IN THE 2ND CHAPTER OF THE THESIS WE INTRODUCE A NEW NOTION OF MULTIVERSION SERIALIZABILITY (MVSR) BASED ON CONFLICTS (MVCSR) AND DISCUSS ITS RELATION WITH THE WELL KNOWN SINGLE VERSION CONFLICT SERIALIZABILITY (CSR). WE PROVE THAT IT IS NP-COMPLETE TO DECIDE WHETHER A SET OF SCHEDULES IS ON-LINE SCHEDULABLE (OLS). WE INTRODUCE THE CONCEPT OF MAXIMAL OLS SETS AND SHOW THAT NO EFFICIENT SCHEDULER CAN BEDESGNED THAT RECOGNIZES MAXIMAL SUBSETS OF MVSR OR MVCSR. FINALLY A GENERAL FRAMEWORK FOR ALGORITHMS BASED ON MVCSR IS PRESENTED. IN CHAPTER 3 WE SOLVE AN OPEN PROBLEM FOR THE WELL KNOWN CONFLICT GRAPH SCHEDULER: WHEN CAN A NODE BE DELETED FROM THE GRAPH AFTER THE COMPLETION OF THE CORRESPONDING TRANSACTION? WE GIVE A SUFFICIENT AND NECESSARY CONDITION FOR THIS. WE EXAMINE THE DYNAMIC PROBLEM, I.E. REPEATEDLY DELETING NODES AS THE SCHEDULE PROCEEDS AND WE STUDY THE PROBLEM UNDER SEVERAL VARIATIONS OF THE TRANSACTIONS MODEL.","ΣΤΗ ΔΙΑΤΡΙΒΗ ΑΥΤΗ ΜΕΛΕΤΟΥΜΕ ΠΡΟΒΛΗΜΑΤΑ ΣΥΝΤΟΝΙΣΜΟΥ ΤΑΥΤΟΧΡΟΝΩΝ ΠΡΟΣΠΕΛΑΣΕΩΝ ΣΕΒΑΣΕΙΣ ΔΕΔΟΜΕΝΩΝ. ΟΙ ΣΥΝΤΟΝΙΣΤΕΣ ΜΕ ΑΝΤΙΓΡΑΦΑ ΕΙΝΑΙ ΗΔΗ ΕΝΑΣ ΠΛΑΤΙΑ ΑΠΟΔΕΚΤΟΣΜΗΧΑΝΙΣΜΟΣ ΓΙΑ ΒΕΛΤΙΩΣΗ ΤΗΣ ΑΠΟΔΟΣΗΣ ΤΟΥ ΣΥΝΤΟΝΙΣΜΟΥ. ΣΤΟ ΚΕΦΑΛΑΙΟ 2 ΤΗΣ ΔΙΑΤΡΙΒΗΣ ΕΙΣΑΓΟΥΜΕ ΜΙΑ ΝΕΑ ΕΝΝΟΙΑ ΣΕΙΡΙΟΠΟΙΗΣΙΜΟΤΗΤΑΣ ΜΕ ΑΝΤΙΓΡΑΦΑ (MVSR) ΠΟΥ ΒΑΣΙΖΕΤΑΙ ΣΤΗΝ ΕΝΝΟΙΑ ΤΗΣ ΑΝΤΙΘΕΣΗΣ (MVCSR) ΚΑΙ ΜΕΛΕΤΟΥΜΕ ΤΗ ΣΧΕΣΗ ΤΗΣ ΜΕ ΤΗΝ ΚΛΑΣΣΙΚΗ ΕΝΝΟΙΑ ΤΗΣ ΑΝΤΙΘΕΣΗΣ ΧΩΡΙΣ ΑΝΤΙΓΡΑΦΑ (CSR). ΑΠΟΔΕΙΚΝΥΟΥΜΕ ΟΤΙ ΤΟ ΠΡΟΒΛΗΜΑ ΤΟΥ ΑΝ ΕΝΑ ΣΥΝΟΛΟ ΧΡΟΝΙΚΩΝ ΕΙΝΑΙ ΕΠΙΤΟΠΟΥ ΣΥΝΤΟΝΙΣΙΜΟ (ΕΤΣ) ΕΙΝΑΙ ΠΛΗΡΕΣ ΣΤΟΝΡ. ΕΙΣΑΓΟΥΜΕ ΤΗΝ ΕΝΝΟΙΑ ΤΩΝ ΜΕΓΙΣΤΩΝ ΕΤΣ ΣΥΝΟΛΩΝ ΧΡΟΝΙΚΩΝ ΚΑΙ ΑΠΟΔΕΙΚΝΥΟΥΜΕΟΤΙ ΕΙΝΑΙ ΑΔΥΝΑΤΗ Η ΚΑΤΑΣΚΕΥΗ ΑΠΟΔΟΤΙΚΩΝ ΣΥΝΤΟΝΙΣΤΩΝ ΠΟΥ ΝΑ ΑΝΑΓΝΩΡΙΖΟΥΝ ΜΕΓΙΣΤΑ ΕΤΣ ΥΠΟΣΥΝΟΛΑ ΤΟΥ MVSR # ΤΟΥ MVCSR. ΤΕΛΟΣ ΠΑΡΟΥΣΙΑΖΟΥΜΕ ΕΝΑ ΓΕΝΙΚΟ ΑΛΓΟΡΙΘΜΙΚΟ ΠΛΑΙΣΙΟ ΓΙΑ ΣΥΝΤΟΝΙΣΤΕΣ MVCSR. ΣΤΟ 3 ΚΕΦΑΛΑΙΟ ΛΥΝΟΥΜΕ ΤΟ ΠΡΟΒΛΗΜΑ ΤΟΥ ΚΛΕΙΣΙΜΑΤΟΣ ΔΟΣΟΛΗΨΙΩΝ ΓΙΑ ΤΟ ΓΝΩΣΤΟ ΣΥΝΤΟΝΙΣΤΗ ΓΡΑΦΟΥ ΑΝΤΙΘΕΣΕΩΝ. ΤΟ ΠΡΟΒΛΗΜΑ ΕΙΝΑΙ: ΠΟΤΕ ΜΠΟΡΕΙ ΝΑ ΔΙΑΓΡΑΦΕΙ ΕΝΑΣ ΚΟΜΒΟΣ ΑΦΟΥ Η ΑΝΤΙΣΤΟΙΧΗ ΔΟΣΟΛΗΨΙΑ ΕΧΕΙ ΟΛΟΚΛΗΡΩΘΕΙ; ΒΡΙΣΚΟΥΜΕ ΜΙΑ ΑΝΑΓΚΑΙΑ ΚΑΙ ΙΚΑΝΗ ΣΥΝΘΗΚΗ ΓΙ'ΑΥΤΟ. ΜΕΛΕΤΟΥΜΕ ΤΟ ΔΥΝΑΜΙΚΟ ΠΡΟΒΛΗΜΑ ΤΗΣ ΚΑΤΕΠΑΝΑΛΗΨΗ ΔΙΑΓΡΑΦΗΣ ΚΟΜΒΩΝ ΟΣΟ ΠΡΟΧΩΡΕΙ ΤΟ ΧΡΟΝΙΚΟ ΚΑΙ ΜΕΛΕΤΟΥΜΕ ΤΟ ΠΡΟΒΛΗΜΑ ΤΟΥ ΚΛΕΙΣΙΜΑΤΟΣ ΓΙΑ ΟΡΙΣΜΕΝΕΣ ΠΑΡΑΛΛΑΓΕΣ ΤΟΥ ΜΟΝΤΕΛΟΥ ΤΩΝ ΔΟΣΟΛΗΨΙΩΝ."],"dc:identifier":["10.12681/eadd/0172","http://hdl.handle.net/10442/hedi/0172"],"dc:language":["gre"],"dc:publisher":["University of Patras","Πανεπιστήμιο Πατρών"],"dc:subject":["Βάσεις δεδομένων","ΔΙΑΓΡΑΦΗΔΟΣΟΛΗΨΙΩΝ","ΘΕΩΡΙΑ ΒΑΣΕΩΝ ΔΕΔΟΜΕΝΩΝ","ΠΛΗΡΟΤΗΤΑ ΣΤΟ NP","Πληροφορική","ΣΕΙΡΙΟΠΟΙΗΣΙΜΟΤΗΤΑ ΑΝΤΙΘΕΣΕΩΝ","ΣΥΝΤΟΝΙΣΜΟΣ ΜΕ ΑΝΤΙΓΡΑΦΑ","ΣΥΝΤΟΝΙΣΜΟΣ ΠΡΟΣΠΕΛΑΣΕΩΝ","Συντονιστές","ΣΥΝΤΟΝΙΣΤΗΣ ΓΡΑΦΟΥ ΑΝΤΙΘΕΣΕΩΝ","CONCURRENCY CONTROL","CONFLICT GRAPH SCHEDULER","CONFLICT SERIALIZABILITY","DATABASE SYSTEMS","DELETING TRANSACTIONS","MULTIVERSION CONCURRENCY","NP - completeness","Schedulers","Φυσικές Επιστήμες","Επιστήμη Ηλεκτρονικών Υπολογιστών και Πληροφορική","Επιστήμες Μηχανικού και Τεχνολογία","Επιστήμη Ηλεκτρολόγου Μηχανικού, Ηλεκτρονικού Μηχανικού, Μηχανικού Η/Υ","Natural Sciences","Computer and Information Sciences","Engineering and Technology","Electrical Engineering, Electronic Engineering, Information Engineering"],"dc:title":["ΠΡΟΒΛΗΜΑΤΑ ΣΥΝΤΟΝΙΣΜΟΥ ΤΑΥΤΟΧΡΟΝΩΝ ΠΡΟΣΠΕΛΑΣΕΩΝ ΣΕ ΒΑΣΕΙΣ ΔΕΔΟΜΕΝΩΝ","ISSUES IN DATABASE CONCURRENCY CONTROL"],"dc:type":["PhD Thesis"]},"updated_at":"2026-07-24T02:25:05Z"}