Sciweavers

101 search results - page 4 / 21
» Replication is NOT Needed: SINGLE Database, Computationally-...
Sort
View
DPD
2006
141views more  DPD 2006»
13 years 8 months ago
Efficient parallel processing of range queries through replicated declustering
A common technique used to minimize I/O in data intensive applications is data declustering over parallel servers. This technique involves distributing data among several disks so...
Hakan Ferhatosmanoglu, Ali Saman Tosun, Guadalupe ...
CLOUD
2010
ACM
14 years 1 months ago
A self-organized, fault-tolerant and scalable replication scheme for cloud storage
Failures of any type are common in current datacenters, partly due to the higher scales of the data stored. As data scales up, its availability becomes more complex, while differe...
Nicolas Bonvin, Thanasis G. Papaioannou, Karl Aber...
CCS
2011
ACM
12 years 8 months ago
Practical PIR for electronic commerce
We extend Goldberg’s multi-server information-theoretic private information retrieval (PIR) with a suite of protocols for privacypreserving e-commerce. Our first protocol adds ...
Ryan Henry, Femi G. Olumofin, Ian Goldberg
SIGIR
2010
ACM
13 years 6 months ago
DivQ: diversification for keyword search over structured databases
Keyword queries over structured databases are notoriously ambiguous. No single interpretation of a keyword query can satisfy all users, and multiple interpretations may yield over...
Elena Demidova, Peter Fankhauser, Xuan Zhou, Wolfg...
NIPS
1997
13 years 10 months ago
Structure Driven Image Database Retrieval
A new algorithm is presented which approximates the perceived visual similarity between images. The images are initially transformed into a feature space which captures visual str...
Jeremy S. De Bonet, Paul A. Viola