Informační systém Masarykovy univerzity 

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

česky | in English

BARTOŇ, Stanislav a Pavel ZEZULA. rhoIndex – Designing and Evaluating an Indexing Structure for Graph Structured Data. Brno, Czech republic: FI MU, 2006. Technical Reports FIMU-RS-2006-07.
Další formáty:   BibTeX LaTeX RIS
Základní údaje
Originální název rhoIndex – Designing and Evaluating an Indexing Structure for Graph Structured Data
Název česky rhoIndex – Návrh a evaluace indexační struktury pro grafově strukturovaná data
Autoři BARTOŇ, Stanislav (203 Česká republika, garant) a Pavel ZEZULA (203 Česká republika).
Vydání Brno, Czech republic, Technical Reports FIMU-RS-2006-07, 2006.
Nakladatel FI MU
Další údaje
Originální jazyk angličtina
Typ výsledku Audiovizuální tvorba
Obor Informatika
Stát vydavatele Česká republika
Utajení není předmětem státního či obchodního tajemství
Kód RIV RIV/00216224:14330/06:00015424
Organizační jednotka Fakulta informatiky
Klíčová slova anglicky indexing structure; graphs
Štítky graphs, indexing structure
Změnil Změnil: prof. Ing. Pavel Zezula, CSc., učo 47485. Změněno: 23. 6. 2009 13:10.
Anotace
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 evaluation of the search algorithm that uses the rhoIndex.
Anotace česky
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 evaluation of the search algorithm that uses the rhoIndex.
Návaznosti
1ET100300419, projekt VaVNázev: Inteligentní modely, algoritmy, metody a nástroje pro vytváření sémantického webu
Investor: Akademie věd ČR, Informační společnost (Národní program výzkumu)
VytisknoutZobrazeno: 12. 12. 2017 15:11

Relevantní odkazy 


Nahoru | Aktuální datum a čas: 12. 12. 2017 15:11, 50. (sudý) týden

Kontakty: istech(zavináč/atsign)fi(tečka/dot)muni(tečka/dot)cz, studijní odd., správci práv, is-technici, e-technici, IT podpora | Použití cookies | Více o Informačním systému