390 search results - page 73 / 78 » Approximate Query Answering in Locally Closed Databases |
STOC
2009
ACM
15 years 10 months ago
2009
ACM
We prove lower bounds on the redundancy necessary to represent a set S of objects using a number of bits close to the information-theoretic minimum log2 |S|, while answering vario...
181
click to vote
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
In recent years, the data management community has begun to consider situations in which data access is closely tied to network routing and distributed acquisition: examples includ...
WWW
2008
ACM
15 years 10 months ago
2008
ACM
Because of the high volume and unpredictable arrival rate, stream processing systems may not always be able to keep up with the input data streams-- resulting in buffer overflow a...
PODS
2010
ACM
15 years 2 months ago
2010
ACM
A fundamental problem in data management is to draw a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With large, streamin...
WWW
2003
ACM
15 years 10 months ago
2003
ACM
The Semantic Web envisions a World Wide Web in which data is described with rich semantics and applications can pose complex queries. To this point, researchers have defined new l...