Publication details
Designing Indexing Structure for Discovering Relationships in RDF Graphs
| Authors | |
|---|---|
| Year of publication | 2004 |
| Type | Article in Proceedings |
| Conference | Proceedings of the Dateso 2004 Annual International Workshop on DAtabases, TExts, Specifications and Objects |
| 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 in two steps. Firstly, it transforms the RDF graph into forest of trees and then to each tree creates its extended signature. The signatures are accompanied by the additional information about transformed problematic nodes breaking the tree structure. |
| Related projects: |