Towards Web Scale RDF
暂无分享,去创建一个
We are witnessing the first stages of the document web becoming a data web, with the implied new opportunities for discovering, re-purposing, ”meshing up” and analyzing linked data. There is an increasing volume of linked open data and the first data web search engines are taking shape. Dealing with queries against the nascent data web may easily add two orders of magnitude in computing power requirements on top of what a text search engine faces. Queries may involve arbitrary joining, aggregation, filtering and so forth, compounded by the need for inference and on the fly schema mapping. This is the environment for which Virtuoso Cluster Edition is intended. This paper presents the main challenges encountered and solutions arrived at during the development of this software product. We present adaptations of RDF load and query execution and query planning suited for distributed memory platforms, with special emphasis on dealing with message latency and the special operations required by
[1] Werner Vogels,et al. Dynamo: amazon's highly available key-value store , 2007, SOSP.
[2] Jens Lehmann,et al. What Have Innsbruck and Leipzig in Common? Extracting Semantics from Wiki Content , 2007, ESWC.
[3] Orri Erling,et al. RDF Support in the Virtuoso DBMS , 2007, CSSW.
[4] Wilson C. Hsieh,et al. Bigtable: A Distributed Storage System for Structured Data , 2006, TOCS.