Ruben Verborgh’s data

Ruben’s data

Query Ruben’s data by triple pattern

Matches in Ruben’s data for { ?s ?p "Clients of Triple Pattern Fragments (TPF) interfaces demonstrate how a SPARQL query engine can run within a browser and re-balance the load from the server to the clients. Imagine connecting these browsers using a browser-to-browser connection, sharing bandwidth and CPU. This builds a fog of browsers where end-user devices collaborate to process SPARQL queries over TPF servers. In this demo, we present Ladda: a framework for query execution in a fog of browsers. Thanks to client-side inter-query parallelism, Ladda reduces the makespan of the workload and improves the overall throughput of the system."@en }

Showing triples 1 to 1 of 1 with 100 triples per page.