rhoIndex – Designing and Evaluating an Indexing Structure for Graph Structured Data
BARTOŇ, Stanislav and Pavel ZEZULA. rhoIndex – Designing and Evaluating an Indexing Structure for Graph Structured Data. Brno, Czech republic: FI MU, 2006. Technical Reports FIMU-RS-2006-07. |
Other formats:
BibTeX
LaTeX
RIS
|
Basic information | |
---|---|
Original name | rhoIndex – Designing and Evaluating an Indexing Structure for Graph Structured Data |
Name in Czech | rhoIndex – Návrh a evaluace indexační struktury pro grafově strukturovaná data |
Authors | BARTOŇ, Stanislav (203 Czech Republic, guarantor) and Pavel ZEZULA (203 Czech Republic). |
Edition | Brno, Czech republic, Technical Reports FIMU-RS-2006-07, 2006. |
Publisher | FI MU |
Other information | |
---|---|
Original language | English |
Type of outcome | Audiovisual works |
Field of Study | 10201 Computer sciences, information science, bioinformatics |
Country of publisher | Czech Republic |
Confidentiality degree | is not subject to a state or trade secret |
RIV identification code | RIV/00216224:14330/06:00015424 |
Organization unit | Faculty of Informatics |
Keywords in English | indexing structure; graphs |
Tags | graphs, indexing structure |
Changed by | Changed by: prof. Ing. Pavel Zezula, CSc., učo 47485. Changed: 23/6/2009 13:10. |
Abstract |
---|
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. |
Abstract (in Czech) |
---|
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. |
Links | |
---|---|
1ET100300419, research and development project | Name: Inteligentní modely, algoritmy, metody a nástroje pro vytváření sémantického webu |
Investor: Academy of Sciences of the Czech Republic, Intelligent Models, Algorithms, Methods and Tools for the Semantic Web (realization) |
PrintDisplayed: 30/7/2024 02:12