2009
Indexing Structure for Graph-Structured Data
BARTOŇ, Stanislav a Pavel ZEZULAZákladní údaje
Originální název
Indexing Structure for Graph-Structured Data
Název česky
Indexing Structure for Graph-Structured Data
Autoři
BARTOŇ, Stanislav (203 Česká republika, garant, domácí) a Pavel ZEZULA (203 Česká republika, domácí)
Vydání
1. vyd. Berlin, Studies in Computational Intelligence, Volume 165, Mining Complex Data, od s. 167-188, 22 s. 2009
Nakladatel
Springer Berlin / Heidelberg
Další údaje
Jazyk
angličtina
Typ výsledku
Stať ve sborníku
Obor
10201 Computer sciences, information science, bioinformatics
Stát vydavatele
Francie
Utajení
není předmětem státního či obchodního tajemství
Forma vydání
tištěná verze "print"
Kód RIV
RIV/00216224:14330/09:00065769
Organizační jednotka
Fakulta informatiky
ISBN
978-3-540-88066-0
ISSN
Klíčová slova anglicky
graph structured data; rho-index; citation analysis
Příznaky
Mezinárodní význam, Recenzováno
Změněno: 28. 4. 2014 11:33, RNDr. Pavel Šmerk, Ph.D.
V originále
An own design of an indexing structure for general graph structured data called Rho-index 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 Rho-index is a multilevel balanced tree structure where each node is created with a certain graph transformation and described by modified adjacency matrix. Hence, Rho-index 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 Rho-index. We also present an experimental evaluation of the process of creating the Rho-index on graphs with different sizes and also a complexity evaluation of the search algorithm that uses the Rho-index.
Česky
An own design of an indexing structure for general graph structured data called Rho-index 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 Rho-index is a multilevel balanced tree structure where each node is created with a certain graph transformation and described by modified adjacency matrix. Hence, Rho-index 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 Rho-index. We also present an experimental evaluation of the process of creating the Rho-index on graphs with different sizes and also a complexity evaluation of the search algorithm that uses the Rho-index.
Návaznosti
| GP201/07/P240, projekt VaV |
| ||
| 1ET100300419, projekt VaV |
|