Indexing Structure for Graph-Structured Data
| Authors | |
|---|---|
| Year of publication | 2009 |
| Type | Article in Proceedings |
| Conference | Studies in Computational Intelligence, Volume 165, Mining Complex Data |
| MU Faculty or unit | |
| Citation | |
| Doi | http://dx.doi.org/10.1007/978-3-540-88067-7_10 |
| Field | Informatics |
| Keywords | graph structured data; rho-index; citation analysis |
| Description | 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. |
| Related projects: |