izpis_h1_title_alt

Predpomnilnik in indeksiranje nestrukturiranih podatkov : diplomsko delo
Mesić, Hasir (Author), Brodnik, Andrej (Mentor) More about this mentor... This link opens in a new window

URLURL - Presentation file, Visit http://eprints.fri.uni-lj.si/2607/ This link opens in a new window

Abstract
V diplomski nalogi sta predstavljena algoritma za gradnjo podatkovnih struktur, ki hranita dolga besedila. Na začetku je predstavljena struktura molekule DNK, kot primer dolgega besedila. Opisani so različni primeri podatkovnih struktur. V istem sklopu je opisana tudi pomnilniška hierarhija, ki vpliva na hitrost izvajanja algoritmov. V osrednjem delu je posamezen algoritem predstavljen v svojem poglavju, kjer je postopek gradnje podatkovne strukture razdeljen v več faz. Vsaka faza je podrobno opisana in ponazorjena s konkretnim primerom. V zadnjem sklopu je podana primerjava algoritmov glede na časovno in prostorsko zahtevnost, tako za gradnjo podatkovne strukture kot za poizvedbe. Predstavljeni so tudi rezultati časovnih meritev in meritev V/I dostopov.

Language:Slovenian
Keywords:DNK, podatkovna struktura, predpomnilnik, ERA, COSD, računalništvo, visokošolski strokovni študij, računalništvo in informatika, diplomske naloge
Work type:Bachelor thesis/paper (mb11)
Tipology:2.11 - Undergraduate Thesis
Organization:FRI - Faculty of computer and information science
Year:2014
Publisher:[H. Mesić]
Number of pages:60 str.
UDC:004.2(043.2)
COBISS.SI-ID:10694228 Link is opened in a new window
Views:691
Downloads:156
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:Cache and indexing of unstructured data
Abstract:
In this thesis algorithms for construction of data structures for a long texts, are introduced. In the beginning, the overview of the DNA structure is given, as an example of a long text. Several examples of data structures are described. In the same part of thesis, the memory hierarchy, which influences algorithm execution speed, is described. In the main part each algorithm is presented in its own chapter, where the construction process is divided into number of stages. Each stage is described and illustrated with concrete example. The last part gives the comparison of algorithms with respect to time and space complexity, both for the construction of data structures as queries. It also presents the results of time measurements and measurements of I/O accesses.

Keywords:DNA, data structure, cache, ERA, COSD, computer science, computer and information science, diploma

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