Year-end Sale % OFF 
Abstract
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.
Highlights
Фрагментный параллелизм [1] продолжает оставаться основной формой параллелизма в системах баз данных для многопроцессорных платформ с распределенной памятью
We present a theorem, which gives estimation for the amount of tuples which have to be transferred during processing partitioned relation
Parallel Query Processing in Shared Disk Database Systems / Rahm E
Summary
Фрагментный параллелизм (data parallelism) [1] продолжает оставаться основной формой параллелизма в системах баз данных для многопроцессорных платформ с распределенной памятью. Пусть сначала l ∈ Mj. Тогда из (4) следует γ−1 (l) ∈ Rj. Отсюда, в силу (1) получаем φ(γ−1 (l)) = j. Используя (2), отсюда, в свою очередь, получаем γ mod k = j, что эквивалентно l mod k = j. Учитывая (7), отсюда получаем l ∈ Mj , откуда в силу (8) следует В силу (1), из последнего равенства следует γ−1 (l) ∈ Rj. Тогда из (4) следует l ∈ Mj. Учитывая (10), отсюда получаем
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Bulletin of the South Ural State University. Series "Computational Mathematics and Software Engineering"
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
