Indexing Structure for Graph-Structured Data
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F09%3A00065769" target="_blank" >RIV/00216224:14330/09:00065769 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-540-88067-7_10" target="_blank" >http://dx.doi.org/10.1007/978-3-540-88067-7_10</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-540-88067-7_10" target="_blank" >10.1007/978-3-540-88067-7_10</a>
Alternative languages
Result language
angličtina
Original language name
Indexing Structure for Graph-Structured Data
Original language 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.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2009
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Studies in Computational Intelligence, Volume 165, Mining Complex Data
ISBN
9783540880660
ISSN
1860-949X
e-ISSN
—
Number of pages
22
Pages from-to
167-188
Publisher name
Springer Berlin / Heidelberg
Place of publication
Berlin
Event location
Berlin
Event date
Jan 1, 2009
Type of event by nationality
CST - Celostátní akce
UT code for WoS article
—