ABOUT COMMUNICATION COST ESTIMATION FOR PROCESSING OF PARTITIONED RELATION WITH UNIFORM DISTRIBUTION
DOI:
https://doi.org/10.14529/cmse130104Abstract
Query processing in the shared-nothing parallel database systems demands a data exchange
between processor nodes. In the paper, we present a theorem, which gives estimation for the amount
of tuples which have to be transferred during processing partitioned relation. We consider the case
when the transfer function is functionally dependent on an attribute, which is uniformly distributed
relative to the partitioning attribute.
References
Rahm, E. Parallel Query Processing in Shared Disk Database Systems / Rahm E. // ACM SIGMOD Record. – 1993. – Vol. 22, No. 4. – P. 32–37.
Соколинский, Л.Б. Обзор архитектур параллельных систем баз данных / Соколинский Л.Б. // Программирование. – 2004. – No. 6. – С. 49–63.
Лепихов, А.В. Обработка запросов в СУБД для кластерных систем / Лепихов А.В., Соколинский Л.Б. // Программирование. – 2010. – No 4. – С. 25–39.
Hasan, W. Coloring Away Communication in Parallel Query Optimization / Hasan W., Motwani R. // VLDB’95, Proceedings of 21st International Conference on Very Large Data Bases, September 11–15, 1995, Zurich, Switzerland. – Morgan Kaufmann, 1995. – P. 239–250.
