Detailed Information on Publication Record
2009
Indexing Structure for Graph-Structured Data
BARTOŇ, Stanislav and Pavel ZEZULABasic information
Original name
Indexing Structure for Graph-Structured Data
Name in Czech
Indexing Structure for Graph-Structured Data
Authors
BARTOŇ, Stanislav (203 Czech Republic, guarantor, belonging to the institution) and Pavel ZEZULA (203 Czech Republic, belonging to the institution)
Edition
1. vyd. Berlin, Studies in Computational Intelligence, Volume 165, Mining Complex Data, p. 167-188, 22 pp. 2009
Publisher
Springer Berlin / Heidelberg
Other information
Language
English
Type of outcome
Stať ve sborníku
Field of Study
10201 Computer sciences, information science, bioinformatics
Country of publisher
France
Confidentiality degree
není předmětem státního či obchodního tajemství
Publication form
printed version "print"
RIV identification code
RIV/00216224:14330/09:00065769
Organization unit
Faculty of Informatics
ISBN
978-3-540-88066-0
ISSN
Keywords in English
graph structured data; rho-index; citation analysis
Tags
International impact, Reviewed
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.
In Czech
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.
Links
| GP201/07/P240, research and development project |
| ||
| 1ET100300419, research and development project |
|