Adaptive algorithms for join processing in distributed database systems
Analíticas: Mostrar analíticasTipo de contenido:- texto
- sin mediación
- volumen
Contenidos:
En: Distributed and parallel databases (vol. 5, nro. 3, Jul. 1997), p. 233-269S.T.:H004.652.4 DIS PP2672
Distributed query processing algorithms usually perform data reduction by using a semijoin program, but the problem with these approaches is that they still require an explicit join of the reduced relations in the final phase. We introduce an efficient algorithm for join processing in distributed database systems that makes use of bipartite graphs in order to reduce data communication costs and local processing costs.
No hay ítems correspondientes a este registro
Distributed query processing algorithms usually perform data reduction by using a semijoin program, but the problem with these approaches is that they still require an explicit join of the reduced relations in the final phase. We introduce an efficient algorithm for join processing in distributed database systems that makes use of bipartite graphs in order to reduce data communication costs and local processing costs.
No hay comentarios en este titulo.
Ingresar a su cuenta para colocar un comentario.