Parallel Database Systems The Future of High Performance Database Systems. Authors: David DeWitt and Jim Gray Presenter: Jennifer Tom Based on Presentation by Ajith Karimpana. Outline. Why Parallel Databases? Parallel Database Implementation Parallel Database Systems
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Authors: David DeWitt and Jim Gray
Presenter: Jennifer Tom
Based on Presentation by Ajith Karimpana
Why do the relational queries allow for parallelization?
Why are linear speedup and linear scaleup indicators of good parallelism?
Should we look at both transactional scaleup and batch scaleup for all situations when assessing performance?
Give example situations where you might come across interference and skew barriers?
Why do shared-nothing systems work well for database systems?
How would you compose a set of operations for an SQL query to be done in parallel?
Can you give brief examples of each? Which parallelism is generally better for databases?
What operations/situations are ideal (or not ideal) for the above partitioning types?
What issues to database performance may arise due to partitioning?
How could these skew problems be minimized?
Are there situations in which parallel dataflow does not work well?
How might other relational algorithms/operations (like sorting) be parallelized to improve query performance?
Should we focus on the use of commodity hardware to build parallel database systems?
Which of these issues may be extremely difficult to resolve?