511 search results - page 8 / 103 » Approximate Selection Queries over Imprecise Data |
ICDE
2002
IEEE
14 years 1 months ago
2002
IEEE
We consider the use of data reduction techniques for the problem of approximate query answering. We focus on applications for which accurate answers to selective queries are requi...
SIGMOD
2006
ACM
14 years 8 months ago
2006
ACM
This paper introduces the Tuple Graph (TuG) synopses, a new class of data summaries that enable accurate selectivity estimates for complex relational queries. The proposed summari...
WAIM
2004
Springer
14 years 1 months ago
2004
Springer
A top-N selection query against a relation is to find the N tuples that satisfy the query condition the best but not necessarily completely. In this paper, we propose a new method ...
SSDBM
2009
IEEE
14 years 3 months ago
2009
IEEE
Scientific experiments produce large volumes of data represented as complex objects that describe independent events such as particle collisions. Scientific analyses can be express...
LICS
2002
IEEE
14 years 1 months ago
2002
IEEE
Monadic query languages over trees currently receive considerable interest in the database community, as the problem of selecting nodes from a tree is the most basic and widesprea...