415 search results - page 34 / 83 » Efficient Processing of Relational Queries with Sum Constrai... |
WEBI
2010
Springer
13 years 5 months ago
2010
Springer
Abstract--Expertise matching, aiming to find the alignment between experts and queries, is a common problem in many real applications such as conference paper-reviewer assignment, ...
BTW
2007
Springer
14 years 1 months ago
2007
Springer
B-tree and index into two layers of abstraction. In addition, this paper provides algorithms for (i) concurrency control and recovery including locking of individual keys and of co...
SIGMOD
2008
ACM
14 years 7 months ago
2008
ACM
We present a novel design and implementation of relational join algorithms for new-generation graphics processing units (GPUs). The most recent GPU features include support for wr...
ICDE
1995
IEEE
14 years 8 months ago
1995
IEEE
The model of flexible relations supports heterogeneous sets of tuples in a strongly typed way. The elegance of the standard relational model is preserved by using a single, generi...
ICDE
2003
IEEE
14 years 8 months ago
2003
IEEE
Expressing complex OLAP queries using group-by, aggregation, and joins can be extremely difficult. As a result of this, many alternate ways of expressing such queries have been de...