izpis_h1_title_alt

Štetje dogodkov s porazdeljenimi podatkovnimi tipi za dosego močne zakasnjene konsistentnosti
ŠILOVINAC, LUKA (Author), Lavbič, Dejan (Mentor) More about this mentor... This link opens in a new window

.pdfPDF - Presentation file, Download (1,72 MB)

Abstract
Sodobne spletne aplikacije se soočajo z vse večjim obsegom spletnega prometa. Ker morajo takšne aplikacije hraniti vedno več s tem povezanih podatkov, se je v zadnjih letih razvilo več pristopov k hranjenju podatkov za različne namene. V diplomskem delu raziščemo problem štetja dogodkov in zanesljivega shranjevanja števcev v okoljih, kjer sta pomembna visoka razpoložljivost in skalabilnost. Z uporabo števcev je mogoče rešiti različne probleme, ki se pojavljajo v spletnih aplikacijah. V delu s simulacijo prometa primerjamo tri različne podatkovne baze, ki jih je mogoče uporabiti za shranjevanje števcev, in ugotovimo, da lahko s tipi CRDT učinkovito rešimo problem štetja.

Language:Slovenian
Keywords:porazdeljeni sistemi, podatkovne baze, štetje dogodkov, CRDT, MongoDB, HBase
Work type:Undergraduate thesis (m5)
Organization:FRI - Faculty of computer and information science
Year:2016
Views:363
Downloads:76
Metadata:XML RDF-CHPDL DC-XML DC-RDF
 
Average score:(0 votes)
Your score:Voting is allowed only to logged in users.
:
Share:AddThis
AddThis uses cookies that require your consent. Edit consent...

Secondary language

Language:English
Title:Counting events with distributed data types to achieve strong eventual consistency
Abstract:
Modern web applications face an ever increasing amount of web traffic. The requirement to store data of this traffic at an increasing rate lead to development of a large number of database solutions for different purposes. We explore the problem of counting events and reliably storing counters in environments where high availability and scalability are a requirement. Counters can be used to solve different problems in web applications. We evaluate three different distributed database solutions that can be used to store counters by simulating network traffic and conclude that CRDT data types can be an effective solution to the problem of counting.

Keywords:distributed systems, databases, counting events, CRDT, MongoDB, HBase

Similar documents

Similar works from RUL:
Similar works from other Slovenian collections:

Comments

Leave comment

You have to log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back