BARTOŇ, Stanislav and 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. 1st ed. Los Alamitos, CA, USA: IEEE Computer Society, 2006, p. 253 -- 257. ISBN 0-7695-2702-7.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Designing and Evaluating an Index for Graph Structured Data
Name in Czech 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 1. vyd. Los Alamitos, CA, USA, Proceedings of The Second International Workoshop on Mining Complex Data at 6th IEEE ICDM Conference, p. 253 -- 257, 5 pp. 2006.
Publisher IEEE Computer Society
Other information
Original language English
Type of outcome Proceedings paper
Field of Study 10201 Computer sciences, information science, bioinformatics
Country of publisher Hong Kong
Confidentiality degree is not subject to a state or trade secret
RIV identification code RIV/00216224:14330/06:00015402
Organization unit Faculty of Informatics
ISBN 0-7695-2702-7
UT WoS 000245603100047
Keywords in English graph structured data; indexing structures; rhoIndex
Tags graph structured data, indexing structures, rhoIndex
Tags International impact, Reviewed
Changed by Changed by: RNDr. Stanislav Bartoň, Ph.D., učo 608. Changed: 27/12/2006 09:47.
Abstract
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.
Abstract (in Czech)
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.
Links
1ET100300419, research and development projectName: 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: 27/5/2024 19:29