Back to search

Institutional Repository of Vilnius University

Grafų indeksavimo metodai /

Abstract

dc:description

Graph indexing is a process that optimizes graph searches in large graph-based databases. These techniques are used to rapidly identify graph structures based on certain criteria, such as vertex or edge properties, and are of great importance in areas such as social network and chemical structure analysis, biological networks, and more. The purpose of this bachelor thesis is to determine which of the TreePi, TreePi + GASTON, TreePi + FFSM, and GString methods is better in terms of time and scalability. During the work, the TreePi, TreePi + GASTON, TreePi + FFSM, and GString methods were compared in terms of time and scalability, and it was observed that the GString method is better in terms of both scalability and query processing, and TreePi + GASTON is better in terms of index construction time.

Degree

thesis:*
Grantor dc:publisher
Institutional Repository of Vilnius University
Year dc:date
2025

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Bruson, Matas,

Rights

dc:rights
Statement dc:rights
  • info:eu-repo/semantics/openAccess
Language dc:language
lit

Identifiers

dc:identifier.*

Chain of custody

source
Harvested from
Vilnius University
Base URL
epublications.vu.lt/oai
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Bruson, Matas,. Grafų indeksavimo metodai /. Institutional Repository of Vilnius University, 2025. https://repository.vu.lt/VU:ELABAETD239024210&prefLang=en_US