Sciweavers

719 search results - page 84 / 144
» Adaptive Online Time Allocation to Search Algorithms
Sort
View
ICAC
2005
IEEE
15 years 3 months ago
Feedback-based Scheduling for Back-end Databases in Shared Dynamic Content Server Clusters
This paper introduces a self-configuring architecture for scaling the database tier of dynamic content web servers. We use a unified approach to load and fault management based ...
Gokul Soundararajan, Kaloian Manassiev, Jin Chen, ...
SIGCOMM
2009
ACM
15 years 4 months ago
ROAR: increasing the flexibility and performance of distributed search
To search the web quickly, search engines partition the web index over many machines, and consult every partition when answering a query. To increase throughput, replicas are adde...
Costin Raiciu, Felipe Huici, Mark Handley, David S...
SSDBM
2010
IEEE
181views Database» more  SSDBM 2010»
14 years 7 months ago
Stratified Reservoir Sampling over Heterogeneous Data Streams
Reservoir sampling is a well-known technique for random sampling over data streams. In many streaming applications, however, an input stream may be naturally heterogeneous, i.e., c...
Mohammed Al-Kateb, Byung Suk Lee
DISCEX
2003
IEEE
15 years 3 months ago
Improving Failure Responsiveness in Jini Leasing
Distributed systems require strategies to detect and recover from failures. Many protocols for distributed systems employ a strategy based on leases, which grant a leaseholder acc...
Scott Rose, Kevin Bowers, Stephen Quirolgico, Kevi...
KDD
2008
ACM
239views Data Mining» more  KDD 2008»
15 years 10 months ago
Mining adaptively frequent closed unlabeled rooted trees in data streams
Closed patterns are powerful representatives of frequent patterns, since they eliminate redundant information. We propose a new approach for mining closed unlabeled rooted trees a...
Albert Bifet, Ricard Gavaldà