511 search results - page 29 / 103 » Approximate Selection Queries over Imprecise Data |
260
click to vote
ICDE
2005
IEEE
16 years 7 months ago
2005
IEEE
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
163
click to vote
SAC
2006
ACM
15 years 12 months ago
2006
ACM
Structured data and complex schemas are becoming the main way to represent the information many Digital Libraries provide, thus impacting the services they offer. When searching i...
265
click to vote
ICDE
2008
IEEE
16 years 7 months ago
2008
IEEE
Scientific and intelligence applications have special data handling needs. In these settings, data does not fit the standard model of short coded records that had dominated the dat...
245
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
This paper describes query processing in the DBO database system. Like other database systems designed for ad-hoc, analytic processing, DBO is able to compute the exact answer to ...
156
click to vote
VLDB
2005
ACM
15 years 11 months ago
2005
ACM
The largest databases in use today are so large that answering a query exactly can take minutes, hours, or even days. One way to address this problem is to make use of approximati...