I/O Parallelism (Cont.) Partitioning techniques(cont.): 。Range partitioning: Choose an attribute as the partitioning attribute. A partitioning vector [vo,v1,...vn-2]is chosen. Let v be the partitioning attribute value of a tuple.Tuples such that v< vit1 go to node /1.Tuples with v<vo go to node 0 and tuples with v> Vn-2 go to node n-1. E.g.,with a partitioning vector [5,11] a tuple with partitioning attribute value of 2 will go to node 0, a tuple with value 8 will go to node 1,while a tuple with value 20 will go to node2. Database System Concepts-7th Edition 21.7 ©Silberscha乜，Korth and SudarshanDatabase System Concepts - 7 21.7 ©Silberschatz, Korth and Sudarshan th Edition I/O Parallelism (Cont.) Partitioning techniques (cont.): ▪ Range partitioning: • Choose an attribute as the partitioning attribute. • A partitioning vector [vo , v1 , ..., vn-2 ] is chosen. • Let v be the partitioning attribute value of a tuple. Tuples such that vi  vi+1 go to node I + 1. Tuples with v < v0 go to node 0 and tuples with v  vn-2 go to node n-1. E.g., with a partitioning vector [5,11] ▪ a tuple with partitioning attribute value of 2 will go to node 0, ▪ a tuple with value 8 will go to node 1, while ▪ a tuple with value 20 will go to node2