353 search results - page 23 / 71 » Processing Top-k Join Queries |
DAMON
2007
Springer
14 years 2 months ago
2007
Springer
We propose a general framework for improving the query processing performance on multi-level memory hierarchies. Our motivation is that (1) the memory hierarchy is an important pe...
CDB
2004
Springer
14 years 1 months ago
2004
Springer
Constraint Processing and Database techniques overlap significantly. We discuss here the application of a constraint satisfaction technique, called dynamic bundling, to databases....
SSDBM
2007
IEEE
14 years 2 months ago
2007
IEEE
In stream join processing with limited memory, uniform random sampling is useful for approximate query evaluation. In this paper, we address the problem of reservoir sampling over...
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
Genetic algorithms (GAs) have long been used for large join query optimization (LJQO). Previous work takes all queries as based on one granularity to optimize GAs and compares the...
ADBIS
2003
Springer
14 years 1 months ago
2003
Springer
Let a tuple of n objects obeying a query graph (QG) be called the n-tuple. The “Ddistance-value” of this n-tuple is the value of a linear function of distances of the n objects...