785 search results - page 57 / 157 » Efficient Processing of Top-k Queries in Uncertain Databases |
ICDE
2009
IEEE
14 years 10 months ago
2009
IEEE
Abstract-- Answering approximate queries on string collections is important in applications such as data cleaning, query relaxation, and spell checking, where inconsistencies and e...
ICDE
2009
IEEE
14 years 10 months ago
2009
IEEE
Consider multiple users searching for a hotel room, based on size, cost, distance to the beach, etc. Users may have variable preferences expressed by different weights on the attri...
ICDE
2008
IEEE
15 years 8 months ago
2008
IEEE
This paper introduces an efficient algorithm for Producing Early Results in Multi-join query plans (PermJoin, for short). While most previous research focuses only on the
case of ...
DAWAK
1999
Springer
14 years 1 months ago
1999
Springer
Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on efficient quer...
APWEB
2004
Springer
14 years 2 months ago
2004
Springer
We propose a template-based runtime invalidation approach for maintaining cache consistency in database-generated web contents. In our approach, the invalidator sits between a web...