511 search results - page 3 / 103 » Approximate Selection Queries over Imprecise Data |
VLDB
2007
ACM
14 years 5 months ago
2007
ACM
Several recent papers have focused on OLAP over imprecise data, where each fact can be a region, instead of a point, in a multidimensional space. They have provided a multiple-wor...
AAAI
2006
13 years 7 months ago
2006
In this paper, we motivate the need for and challenges involved in supporting imprecise queries over Web databases. Then we briefly explain our solution, AIMQ - a domain independe...
EDBT
2009
ACM
13 years 9 months ago
2009
ACM
We propose efficient techniques for processing various TopK count queries on data with noisy duplicates. Our method differs from existing work on duplicate elimination in two sign...
COOPIS
2004
IEEE
13 years 9 months ago
2004
IEEE
Querying and integrating sources of structured data from the Web in most cases requires similarity-based concepts to deal with data level conflicts. This is due to the often errone...
VLDB
2000
ACM
13 years 9 months ago
2000
ACM
Strict consistency of replicated data is infeasible or not required by many distributed applications, so current systems often permit stale replication, in which cached copies of ...