his.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
How to implement Bounded-Delay replication in DeeDS
University of Skövde, Department of Computer Science.
2002 (English)Independent thesis Basic level (degree of Bachelor)Student thesis
Abstract [en]

In a distributed database system, pessimistic concurrency control is often used to ensure consistency which implies that the execution time of a transaction is not predictable. The execution time of a transaction is not dependent on the local transactions only, but on every transaction in the system.

In real-time database systems it is important that transactions are predictable. One way to make transactions predictable is to use eventual consistency where transactions commit locally before they are propagated to other nodes in the system. It is then possible to get predictable transactions due to the fact that the execution time of the transaction only depends on concurrent transactions on the local node and not on delays on other nodes and delays from a network.

In this report an investigation is made on how a replication protocol using eventual consistency can be designed for, and implemented in, DeeDS, a distributed real-time database prototype. The protocol consists of three parts: a propagation method, a conflict detection algorithm, and a conflict resolution mechanism. The conflict detection algorithm is based on version vectors. The focus is on the propagation mechanism and the conflict detection algorithm of the replication protocol.

An implementation design of the replication protocol is made. A discussion on how the version vectors may be applied in terms of granularity (container, page, object or attribute) and how the log filter should be designed and implemented to suit the particular conflict detection algorithm is carried out. A number of test cases with focus on regression testing have been defined.

It is concluded that the feasibility of the conflict detection algorithm is dependent on the application type that uses DeeDS.

Place, publisher, year, edition, pages
Skövde: Institutionen för datavetenskap , 2002. , 45 p.
Keyword [en]
Real-Time Systems, Database Systems, Replication, Eventual Consistency
National Category
Computer Science
Identifiers
URN: urn:nbn:se:his:diva-646OAI: oai:DiVA.org:his-646DiVA: diva2:3039
Presentation
(English)
Uppsok

Supervisors
Available from: 2008-01-30 Created: 2008-01-30 Last updated: 2009-06-10

Open Access in DiVA

fulltext(745 kB)93 downloads
File information
File name FULLTEXT01.psFile size 745 kBChecksum MD5
e9cb9b88fe465d389bf18ed2d1f7a6fc829a704ef13ff462fa562a9ddce817b3245e19f1
Type fulltextMimetype application/postscript
fulltext(150 kB)59 downloads
File information
File name FULLTEXT02.pdfFile size 150 kBChecksum SHA-512
a073e24848eaa2ef6df5afc2b6c21c934ce9336b2435e1a7dc55ca27b6c8affdf9be29c38173fc731252edb0552865b8ab62dfa7b56aa3a1525d67319dc06ee0
Type fulltextMimetype application/pdf

By organisation
Department of Computer Science
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 152 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 116 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf