Indexing Structure for Graph-Structured Data

Logo poskytovatele

Varování

Publikace nespadá pod Ekonomicko-správní fakultu, ale pod Fakultu informatiky. Oficiální stránka publikace je na webu muni.cz.
Autoři

BARTOŇ Stanislav ZEZULA Pavel

Rok publikování 2009
Druh Článek ve sborníku
Konference Studies in Computational Intelligence, Volume 165, Mining Complex Data
Fakulta / Pracoviště MU

Fakulta informatiky

Citace
Doi http://dx.doi.org/10.1007/978-3-540-88067-7_10
Obor Informatika
Klíčová slova graph structured data; rho-index; citation analysis
Popis 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.
Související projekty:

Používáte starou verzi internetového prohlížeče. Doporučujeme aktualizovat Váš prohlížeč na nejnovější verzi.