Designing Indexing Structure for Discovering Relationships in RDF Graphs

@inproceedings{Barton2004DesigningIS,
  title={Designing Indexing Structure for Discovering Relationships in RDF Graphs},
  author={Stanislav Barton},
  booktitle={DATESO},
  year={2004}
}
Discovering the complex relationships between entities is one way of benefitting from the Semantic Web. This paper discusses new approaches to implementing ρ-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… CONTINUE READING
Highly Cited
This paper has 23 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 16 extracted citations

References

Publications referenced by this paper.
Showing 1-6 of 6 references

Resource description framework schema specification

  • D. Brickley, R. V. Guha
  • 2000
Highly Influential
5 Excerpts

The rho operator: Discovering and ranking on the semantic web

  • Kemafor Anyanwu, Amit Sheth
  • 2003
1 Excerpt

Similar Papers

Loading similar papers…