Parallelism in Databases Data can be partitioned across multiple disks for parallel l/O Individual relational operations (e.g.,sort,join,aggregation)can be executed in parallel data can be partitioned and each processor can work independently on its own partition. Queries are expressed in high level language(SQL,translated to relational algebra) makes parallelization easier. Different queries can be run in parallel with each other. Concurrency control takes care of conflicts. Thus,databases naturally lend themselves to parallelism. Database System Concepts-5th Edition,Aug 22,2005. 21.4 ©Silberschat乜，Korth and SudarshanDatabase System Concepts - 5 21.4 ©Silberschatz, Korth and Sudarshan th Edition, Aug 22, 2005. Parallelism in Databases Data can be partitioned across multiple disks for parallel I/O. Individual relational operations (e.g., sort, join, aggregation) can be executed in parallel data can be partitioned and each processor can work independently on its own partition. Queries are expressed in high level language (SQL, translated to relational algebra) makes parallelization easier. Different queries can be run in parallel with each other. Concurrency control takes care of conflicts. Thus, databases naturally lend themselves to parallelism