izpis_h1_title_alt

Obstojne podatkovne strukture
ID PAVLIN, UROŠ (Author), ID Hočevar, Tomaž (Mentor) More about this mentor... This link opens in a new window

.pdfPDF - Presentation file, Download (625,31 KB)
MD5: 6558E8C0DB28808734994AF6ACE7709A

Abstract
V tej diplomski nalogi je predstavljena obstojnost v podatkovnih strukturah, pri katerih, za razliko od običajnih efemernih struktur, stari podatki niso izgubljeni. Prikazali smo več načinov doseganja dveh različnih nivojev obstojnosti, kjer si lahko pri enem le ogledamo stare verzije, pri drugem jih pa tudi spreminjamo. Osredotočali smo se na doseganje obstojnosti pri binarnem iskalnem drevesu. Poiskali smo tudi različne možne uporabe obstojnih podatkovnih struktur in implementirali tako strukturo, da smo z njo rešili eno izmed teh možnih uporab.

Language:Slovenian
Keywords:podatkovne strukture, algoritmi, binarno iskalno drevo, obstojnost podatkov
Work type:Bachelor thesis/paper
Typology:2.11 - Undergraduate Thesis
Organization:FRI - Faculty of Computer and Information Science
Year:2023
PID:20.500.12556/RUL-151062 This link opens in a new window
COBISS.SI-ID:169303811 This link opens in a new window
Publication date in RUL:28.09.2023
Views:585
Downloads:51
Metadata:XML DC-XML DC-RDF
:
Copy citation
Share:Bookmark and Share

Secondary language

Language:English
Title:Persistent data structures
Abstract:
This thesis presents persistence in data structures, where, unlike conventional ephemeral structures, old data is not lost. We have shown several ways of achieving two different levels of persistence, one where we can only see the old versions, and the other where we can modify them. We focused on achieving persistence in the binary search tree. We have also looked for different possible uses of persistent data structures and implemented a structure such that it solves one of these possible uses.

Keywords:data structures, algorithms, binary search tree, data persistence

Similar documents

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

Back