Scalable In-memory RDFS Closure on Billions of Triples

@inproceedings{Goodman2010ScalableIR,
  title={Scalable In-memory RDFS Closure on Billions of Triples},
  author={Eric L. Goodman and David Mizell},
  year={2010}
}
We present an RDFS closure algorithm, specifically designed and implemented on the Cray XMT supercomputer, that obtains inference rates of 13 million inferences per second on the largest system configuration we used. The Cray XMT, with its large global memory (4TB for our experiments), permits the construction of a conceptually straightforward algorithm, fundamentally a series of operations on a shared hash table. Each thread is given a partition of triple data to process, a dedicated copy of… CONTINUE READING
9 Citations
16 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 16 references

A Navigational Language for RDF

  • J. Pérez, M. Arenas
  • Proceedings of the 7 th International Semantic…
  • 2008

Similar Papers

Loading similar papers…