Informační systém Masarykovy univerzity 

Designing and Evaluating an Index for Graph Structured Data

česky | in English

BARTOŇ, Stanislav a Pavel ZEZULA. Designing and Evaluating an Index for Graph Structured Data. In Proceedings of The Second International Workoshop on Mining Complex Data at 6th IEEE ICDM Conference. 1. vyd. Los Alamitos, CA, USA: IEEE Computer Society, 2006. s. 253 -- 257, 5 s. ISBN 0-7695-2702-7.
Další formáty:   BibTeX LaTeX RIS
Základní údaje
Originální název Designing and Evaluating an Index for Graph Structured Data
Název česky Návrh a evaluace indexační struktury pro grafově strukturovaná data
Autoři BARTOŇ, Stanislav (203 Česká republika, garant) a Pavel ZEZULA (203 Česká republika).
Vydání 1. vyd. Los Alamitos, CA, USA, Proceedings of The Second International Workoshop on Mining Complex Data at 6th IEEE ICDM Conference, od s. 253 -- 257, 5 s. 2006.
Nakladatel IEEE Computer Society
Další údaje
Originální jazyk angličtina
Typ výsledku Článek ve sborníku
Obor Informatika
Stát vydavatele Hongkong
Utajení není předmětem státního či obchodního tajemství
Kód RIV RIV/00216224:14330/06:00015402
Organizační jednotka Fakulta informatiky
ISBN 0-7695-2702-7
UT WoS 000245603100047
Klíčová slova anglicky graph structured data; indexing structures; rhoIndex
Štítky graph structured data, indexing structures, rhoIndex
Příznaky Mezinárodní význam, Recenzováno
Změnil Změnil: RNDr. Stanislav Bartoň, Ph.D., učo 608. Změněno: 27. 12. 2006 09:47.
Anotace
In this paper we present own design of an indexing structure for general graph structured data called rhoIndex that allows an effective processing of special path queries. 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.
Anotace česky
In this paper we present own design of an indexing structure for general graph structured data called rhoIndex that allows an effective processing of special path queries. 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.
Návaznosti
1ET100300419, projekt VaVNázev: Inteligentní modely, algoritmy, metody a nástroje pro vytváření sémantického webu
Investor: Akademie věd ČR, Informační společnost (Národní program výzkumu)
VytisknoutZobrazeno: 24. 10. 2017 07:43

Relevantní odkazy 


Nahoru | Aktuální datum a čas: 24. 10. 2017 07:43, 43. (lichý) týden

Kontakty: istech(zavináč/atsign)fi(tečka/dot)muni(tečka/dot)cz, studijní odd., správci práv, is-technici, e-technici, IT podpora | Použití cookies | Více o Informačním systému