Další formáty:
BibTeX
LaTeX
RIS
@misc{699821,
author = {Bartoň, Stanislav and Zezula, Pavel},
address = {Brno, Czech republic},
keywords = {indexing structure; graphs},
language = {eng},
location = {Brno, Czech republic},
publisher = {FI MU},
title = {rhoIndex – Designing and Evaluating an Indexing Structure for Graph Structured Data},
year = {2006}
}
TY - GEN
ID - 699821
AU - Bartoň, Stanislav - Zezula, Pavel
PY - 2006
TI - rhoIndex – Designing and Evaluating an Indexing Structure for Graph Structured Data
VL - Technical Reports FIMU-RS-2006-07
PB - FI MU
CY - Brno, Czech republic
KW - indexing structure
KW - graphs
N2 - 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.
ER -
BARTOŇ, Stanislav a Pavel ZEZULA. \textit{rhoIndex – Designing and Evaluating an Indexing Structure for Graph Structured Data}. Brno, Czech republic: FI MU, 2006. Technical Reports FIMU-RS-2006-07.
|
