792 search results - page 29 / 159 » Computing Iceberg Queries Efficiently |
136
click to vote
ESCIENCE
2007
IEEE
15 years 7 months ago
2007
IEEE
Data sources, storage, computing resources and services are entities on Grids that require mechanisms for publication and lookup. A discovery service relies on efficient lookup to...
221
Voted
ICDE
2008
IEEE
16 years 4 months ago
2008
IEEE
We study the problem of computing query results with confidence values in ULDBs: relational databases with uncertainty and lineage. ULDBs, which subsume probabilistic databases, o...
241
Voted
ICDE
2005
IEEE
16 years 4 months ago
2005
IEEE
The ability to compute top-k matches to XML queries is gaining importance due to the increasing number of large XML repositories. The efficiency of top-k query evaluation relies o...
210
click to vote
SIGMOD
2007
ACM
16 years 3 months ago
2007
ACM
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
144
click to vote
DIS
2006
Springer
15 years 7 months ago
2006
Springer
The purpose of this paper is two-fold: First, we give efficient algorithms for answering itemset support queries for collections of itemsets from various representations of the fre...