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

Kód výsledku v 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>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

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

Popis výsledku v původním jazyce

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

Název v anglickém jazyce

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

Popis výsledku anglicky

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

Druh

A - Audiovizuální tvorba

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/1ET100300419" target="_blank" >1ET100300419: Inteligentní modely, algoritmy, metody a nástroje pro vytváření sémantického webu</a><br>

Návaznosti

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

Rok uplatnění

2006

Kód důvěrnosti údajů

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

ISBN

—

Místo vydání

Brno, Czech republic

Název nakladatele resp. objednatele

FI MU

Verze

Technical Reports FIMU-RS-2006-07

Identifikační číslo nosiče

FIMU-RS-2006-07