104 search results - page 19 / 21 » The Partition Bound for Classical Communication Complexity a... |
PODS
2002
ACM
14 years 7 months ago
2002
ACM
We study two classes of view update problems in relational databases. We are given a source database S, a monotone query Q, and the view Q(S) generated by the query. The first pro...
IPPS
2009
IEEE
14 years 2 months ago
2009
IEEE
Graph-theoretic abstractions are extensively used to analyze massive data sets. Temporal data streams from socioeconomic interactions, social networking web sites, communication t...
ICDE
2000
IEEE
14 years 8 months ago
2000
IEEE
Time-series data, which are a series of one-dimensional real numbers, have been studied in various database applications. In this paper, we extend the traditional similarity searc...
CRYPTO
2000
Springer
13 years 11 months ago
2000
Springer
Private information retrieval (PIR) enables a user to retrieve a data item from a database, replicated among one or more servers, while hiding the identity of the retrieved item. ...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
The classical problem of reliable point-to-point digital communication is to achieve a low probability of error while keeping the rate high and the total power consumption small. ...