Izak Lipnik (2014) Search in Unstructured Data using String B-trees. EngD thesis.
![[img]](http://eprints.fri.uni-lj.si/style/images/fileicons/application_pdf.png)
| PDF Download (914Kb) |
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.
| Item Type: | Thesis (EngD thesis) | ||||||
|---|---|---|---|---|---|---|---|
| Keywords: | String B-tree, Suffix Tree, String Dictionary, memory hirearchy, searching in strings | ||||||
| Number of Pages: | 77 | ||||||
| Language of Content: | Slovenian | ||||||
| Mentor / Comentors: |
| ||||||
| Link to COBISS: | http://www.cobiss.si/scripts/cobiss?command=search&base=50070&select=(ID=00010691156) | ||||||
| Institution: | University of Ljubljana | ||||||
| Department: | Faculty of Computer and Information Science | ||||||
| Item ID: | 2591 | ||||||
| Date Deposited: | 26 Jun 2014 10:32 | ||||||
| Last Modified: | 28 Jul 2014 14:32 | ||||||
| URI: | http://eprints.fri.uni-lj.si/id/eprint/2591 |
Actions (login required)
| View Item |
