The Semantic Web
暂无分享,去创建一个
Traditional rdf stream processing engines work completely server-side, which contributes to a high server cost. For allowing a large number of concurrent clients to do continuous querying, we extend the low-cost Triple Pattern Fragments (tpf) interface with support for timesensitive queries. In this poster, we give the overview of a client-side rdf stream processing engine on top of tpf. Our experiments show that our solution significantly lowers the server load while increasing the load on the clients. Preliminary results indicate that our solution moves the complexity of continuously evaluating real-time queries from the server to the client, which makes real-time querying much more scalable for a large amount of concurrent clients when compared to the alternatives.
[1] Slim Abdennadher,et al. Collecting Links between Entities Ranked by Human Association Strengths , 2013, ESWC.
[2] Andreas Dengel,et al. BetterRelations: Using a Game to Rate Linked Data Triples , 2011, KI.
[3] Jens Lehmann,et al. DBpedia - A crystallization point for the Web of Data , 2009, J. Web Semant..