rhoIndex ? Designing and Evaluating an Indexing Structure for Graph Structured Data

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F06%3A00015424" target="_blank" >RIV/00216224:14330/06:00015424 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

rhoIndex ? Designing and Evaluating an Indexing Structure for Graph Structured Data

Original language description

An own design of an indexing structure for general graph structured data called rhoIndex that allows an effective processing of special path queries is presented. These special queries represent for example a search for all paths lying between two arbitrary vertices limited to a certain path length. The rhoIndex is a multilevel balanced tree structure where each node is created with a certain graph transformation and described by modified adjacency matrix. Hence, rhoIndex indexes all the paths to a predefined length l inclusive. The search algorithm is then able to find all the paths shorter than or having the length l and some of the paths longer then the predefined l lying between any two vertices in the indexed graph. The designed search algorithm exploits a special graph structure, a transcription graph, to compute the result using the rhoIndex. We also present an experimental evaluation of the process of creating the rhoIndex on graphs with different sizes and also a complexity ev

Czech name

rhoIndex ? Návrh a evaluace indexační struktury pro grafově strukturovaná data

Czech description

An own design of an indexing structure for general graph structured data called rhoIndex that allows an effective processing of special path queries is presented. These special queries represent for example a search for all paths lying between two arbitrary vertices limited to a certain path length. The rhoIndex is a multilevel balanced tree structure where each node is created with a certain graph transformation and described by modified adjacency matrix. Hence, rhoIndex indexes all the paths to a predefined length l inclusive. The search algorithm is then able to find all the paths shorter than or having the length l and some of the paths longer then the predefined l lying between any two vertices in the indexed graph. The designed search algorithm exploits a special graph structure, a transcription graph, to compute the result using the rhoIndex. We also present an experimental evaluation of the process of creating the rhoIndex on graphs with different sizes and also a complexity ev

Type

A - Audiovisual production

CEP classification

IN - Informatics

OECD FORD branch

—

Project

<a href="/en/project/1ET100300419" target="_blank" >1ET100300419: Intelligent Models, Algorithms, Methods and Tools for the Semantic Web (realization)</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2006

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

ISBN

—

Place of publication

Brno, Czech republic

Publisher/client name

FI MU

Version

Technical Reports FIMU-RS-2006-07

Carrier ID

FIMU-RS-2006-07