Implementace efektivních datových struktur

Thumbnail Image

Files

ZNO0011_FEI_B2647_2612R025_2014.pdf (1.64 MB)
ZNO0011_FEI_B2647_2612R025_2014_priloha.zip (122.33 MB)
ZNO0011_FEI_B2647_2612R025_2014_posudek_vedouci_Robenek_Daniel.pdf (49.5 KB)
ZNO0011_FEI_B2647_2612R025_2014_posudek_oponent_Platos_Jan.pdf (48.53 KB)

Downloads

1

Date issued

2014

Authors

Znoj, Jiří

Journal Title

Journal ISSN

Volume Title

Publisher

Vysoká škola báňská - Technická univerzita Ostrava

Location

Signature

Abstract

This thesis deals with tree–data structures. Especially with B+ trees and R –trees that are suitable for storing and searching n–grams. N–grams are part of a text used for example for the detection of plagiarism, comparison of DNA detection, spam or translation from one language to the other. This thesis also deals with the implementation of the two structures and test them on appropriate test data.

Description

Import 06/11/2014

Subject(s)

n–gram, searching, B+ tree, R–tree, data structures, trees, binary trees, AVL tree, 2–3–4 tree, red–black tree, B–tree

Citation

Item identifier

http://hdl.handle.net/10084/106091

Collections

Vysokoškolské kvalifikační práce Fakulty elektrotechniky a informatiky / Theses and dissertations of Faculty of Electrical Engineering and Computer Science (FEI)