Sciweavers

9 search results - page 2 / 2
» Set Containment Joins: The Good, The Bad and The Ugly
Sort
View
EDBT
2012
ACM
247views Database» more  EDBT 2012»
11 years 7 months ago
Heuristics-based query optimisation for SPARQL
Query optimization in RDF Stores is a challenging problem as SPARQL queries typically contain many more joins than equivalent relational plans, and hence lead to a large join orde...
Petros Tsialiamanis, Lefteris Sidirourgos, Irini F...
ICDCN
2011
Springer
12 years 8 months ago
Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information
We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the ...
Valerie King, Steven Lonargan, Jared Saia, Amitabh...
DMIN
2009
144views Data Mining» more  DMIN 2009»
13 years 3 months ago
Fish or Shark - Data Mining Online Poker
In this paper, data mining techniques are used to analyze data gathered from online poker. The study focuses on short-handed Texas Hold'em, and the data sets used contain thou...
Ulf Johansson, Cecilia Sönströd
INFOCOM
2003
IEEE
13 years 10 months ago
Associative Search in Peer to Peer Networks: Harnessing Latent Semantics
— The success of a P2P file-sharing network highly depends on the scalability and versatility of its search mechanism. Two particularly desirable search features are scope (abil...
Edith Cohen, Amos Fiat, Haim Kaplan