Other formats:
BibTeX
LaTeX
RIS
@inproceedings{778078,
author = {Bartoň, Stanislav and Zezula, Pavel},
address = {Berlin},
booktitle = {Studies in Computational Intelligence, Volume 165, Mining Complex Data},
doi = {http://dx.doi.org/10.1007/978-3-540-88067-7_10},
edition = {1.},
keywords = {graph structured data; rho-index; citation analysis},
howpublished = {tištěná verze "print"},
language = {eng},
location = {Berlin},
isbn = {978-3-540-88066-0},
pages = {167-188},
publisher = {Springer Berlin / Heidelberg},
title = {Indexing Structure for Graph-Structured Data},
year = {2009}
}
TY - JOUR
ID - 778078
AU - Bartoň, Stanislav - Zezula, Pavel
PY - 2009
TI - Indexing Structure for Graph-Structured Data
PB - Springer Berlin / Heidelberg
CY - Berlin
SN - 9783540880660
KW - graph structured data
KW - rho-index
KW - citation analysis
N2 - 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.
ER -
BARTOŇ, Stanislav and Pavel ZEZULA. Indexing Structure for Graph-Structured Data. In \textit{Studies in Computational Intelligence, Volume 165, Mining Complex Data}. 1st ed. Berlin: Springer Berlin / Heidelberg, 2009, p.~167-188. ISBN~978-3-540-88066-0. Available from: https://dx.doi.org/10.1007/978-3-540-88067-7\_{}10.
|
