Indexing Structure for Discovering Relationships in RDF Graph Recursively Applying Tree Transformation
| Authors | |
|---|---|
| Year of publication | 2004 |
| Type | Article in Proceedings |
| Conference | Semantic Web Workshop at 27th Annual International ACM SIGIR Conference |
| MU Faculty or unit | |
| Citation | |
| Field | Computer hardware and software |
| Keywords | RDF graphs; tree signatures; graph transformations; path indexing |
| Description | 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. |
| Related projects: |