91 search results - page 1 / 19 » Scalable computation of acyclic joins |
PODS
2006
ACM
14 years 5 months ago
2006
ACM
CASES
2006
ACM
13 years 11 months ago
2006
ACM
Computer architects are constantly faced with the need to improve performance and increase the efficiency of computation in their designs. To this end, it is increasingly common ...
VLDB
1991
ACM
13 years 8 months ago
1991
ACM
Shared nothing multiprocessor archit.ecture is known t.obe more scalable to support very large databases. Compared to other join strategies, a hash-ba9ed join algorithm is particu...
FOCS
1998
IEEE
13 years 9 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
DEXA
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. The development of scalable parallel database systems requires the design of efficient algorithms for the join operation which is the most frequent and expensive operatio...