511 search results - page 82 / 103 » Approximate Selection Queries over Imprecise Data |
269
click to vote
SIGMOD
2005
ACM
16 years 6 months ago
2005
ACM
Complex queries over high speed data streams often need to rely on approximations to keep up with their input. The research community has developed a rich literature on approximat...
161
click to vote
CASCON
2001
15 years 7 months ago
2001
On Line Analytical Processing (OLAP) aims at gaining useful information quickly from large amounts of data residing in a data warehouse. To improve the quickness of response to qu...
156
click to vote
WWW
2007
ACM
16 years 6 months ago
2007
ACM
We describe a query-driven indexing framework for scalable text retrieval over structured P2P networks. To cope with the bandwidth consumption problem that has been identified as ...
178
click to vote
SSDBM
2008
IEEE
16 years 12 days ago
2008
IEEE
Random sampling is a popular technique for providing fast approximate query answers, especially in data warehouse environments. Compared to other types of synopses, random sampling...
251
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
Database queries are often exploratory and users often find their queries return too many answers, many of them irrelevant. Existing work either categorizes or ranks the results t...