Publication details

Designing and Evaluating an Index for Graph Structured Data


BARTOŇ Stanislav ZEZULA Pavel

Year of publication 2006
Type Article in Proceedings
Conference Proceedings of The Second International Workoshop on Mining Complex Data at 6th IEEE ICDM Conference
MU Faculty or unit

Faculty of Informatics

Field Informatics
Keywords graph structured data; indexing structures; rhoIndex
Description 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.
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.

More info