BARTOŇ, Stanislav. Indexing Structure for Discovering Relationships in RDF Graph Recursively Applying Tree Transformation. In Semantic Web Workshop at 27th Annual International ACM SIGIR Conference. Sheffield: University of Sheffield, 2004, p. 58-68.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Indexing Structure for Discovering Relationships in RDF Graph Recursively Applying Tree Transformation
Name in Czech Indexační struktura pro vyhledávání vzathů v RDF grafu tvořená rekurzivní aplikací stromových transformací
Authors BARTOŇ, Stanislav (203 Czech Republic, guarantor).
Edition Sheffield, Semantic Web Workshop at 27th Annual International ACM SIGIR Conference, p. 58-68, 11 pp. 2004.
Publisher University of Sheffield
Other information
Original language English
Type of outcome Proceedings paper
Field of Study 20206 Computer hardware and architecture
Country of publisher United Kingdom of Great Britain and Northern Ireland
Confidentiality degree is not subject to a state or trade secret
RIV identification code RIV/00216224:14330/04:00019264
Organization unit Faculty of Informatics
Keywords in English RDF graphs; tree signatures; graph transformations; path indexing
Tags graph transformations, path indexing, RDF graphs, tree signatures
Changed by Changed by: RNDr. Stanislav Bartoň, Ph.D., učo 608. Changed: 27/4/2006 12:12.
Abstract
Discovering the complex relationships between entities is one way of benefitting from the Semantic Web. This paper discusses new approaches to implementing Rho-operators into RDF querying engines which will enable discovering such relationships viable. The cornerstone of such implementation is creating an index which describes the original RDF graph. The index is created by recursive application of a transformation of graph to forest of trees. At each step, the RDF graph is transformed into forest of trees and then to each tree its extended signature is created. The signatures are accompanied by the additional information about transformed problematic nodes breaking the tree structure. The components described by the signatures are assumed as a single node in the following step. The transitions between the signatures represent edges.
Abstract (in Czech)
Základním kamenem tvorby indexu je rekurzivní aplikace transformací grafu na les stromů. V každém kroku je RDF graf přeměněn na les stromů ke kterým jsou následně vytvořeny jejich signatury. Spolu se signaturami jsou uloženy i informace o transformaci problémových uzlů. V dalším kroku jsou potom tyto stromy považovány za jednotlivé uzly nového grafu a hrany jsou přechody mezi těmito stromy.
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: 6/6/2024 21:58