Iskanje v nestrukturiranih podatkih z uporabo B-dreves nizov : diplomsko delo

Lipnik, Izak (author), Brodnik, Andrej (mentor)

Naloga predstavlja novo strukturo B-dreves nizov, namenjeno iskanju v nestrukturiranih podatkih. V nalogi smo strukturo primerjali s strukturama priponskih dreves in slovarja nizov. Podrobneje smo se posvetili izkoriščenosti pomnilniške hirearhije. Izkazalo se je, da je med vsemi strukturami struktura B-dreves nizov najhitrejša pri iskanju in najbolje izkorišča pomnilniško hirearhijo.

• Language: Slovenian
• Keywords: B-drevesa znakov, priponska drevesa, slovarji nizov, ponilniška hierarhija, iskanje v besedilu, računalništvo, univerzitetni študij, diplomske naloge
• Work type: Undergraduate thesis
• Typology: 2.11 - Undergraduate Thesis
• Organization: FRI - Faculty of Computer and Information Science
• Publisher: [I. Lipnik]
• Year: 2014
• Number of pages: 77 str.
• PID: 20.500.12556/RUL-68667
• UDC: 004(043.2)
• COBISS.SI-ID: 10691156
• Publication date in RUL: 10.07.2015

Secondary language

• Language: English
• Title: Search in Unstructured Data using String B-trees

Abstract

We introduce a new data structure, the String B-tree, intended to search in unstructured data. We were focused on comparing searching in the String B-tree, with searching in Suffix Trees and String Dictionarys. More specifically we focused on efficency use of the memory hierarchies. The results shows, that the String B-tree is the fastest in searching, and has the most efficiency use of the memory hierarchies.

• Keywords: String B-tree, Suffix Tree, String Dictionary, memory hierarchy, searching in strings, computer science, diploma