Sciweavers

239 search results - page 38 / 48
» A practical scalable distributed B-tree
Sort
View
SDM
2003
SIAM
129views Data Mining» more  SDM 2003»
14 years 11 months ago
Approximate Query Answering by Model Averaging
In earlier work we have introduced and explored a variety of different probabilistic models for the problem of answering selectivity queries posed to large sparse binary data set...
Dmitry Pavlov, Padhraic Smyth
SWAP
2007
14 years 11 months ago
Who the FOAF knows Alice? RDF Revocation in DBin 2.0
In this paper we take a view from the bottom to RDF(S) reasoning. We discuss some issues and requirements on reasoning towards effectively building Semantic Web Pipes, aggregating ...
Christian Morbidoni, Axel Polleres, Giovanni Tumma...
DAIS
2009
14 years 11 months ago
Fault-Tolerant Aggregation by Flow Updating
Data aggregation plays an important role in the design of scalable systems, allowing the determination of meaningful system-wide properties to direct the execution of distributed a...
Paulo Jesus, Carlos Baquero, Paulo Sérgio A...
PE
2010
Springer
123views Optimization» more  PE 2010»
14 years 4 months ago
Evaluating fluid semantics for passive stochastic process algebra cooperation
Fluid modelling is a next-generation technique for analysing massive performance models. Passive cooperation is a popular cooperation mechanism frequently used by performance engi...
Richard A. Hayden, Jeremy T. Bradley
EUROSYS
2011
ACM
14 years 1 months ago
Increasing performance in byzantine fault-tolerant systems with on-demand replica consistency
Traditional agreement-based Byzantine fault-tolerant (BFT) systems process all requests on all replicas to ensure consistency. In addition to the overhead for BFT protocol and sta...
Tobias Distler, Rüdiger Kapitza