* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
Download Physical data organization Disks, blocks, tuples, schemas
Data Protection Act, 2012 wikipedia , lookup
Clusterpoint wikipedia , lookup
Data center wikipedia , lookup
Operational transformation wikipedia , lookup
Data analysis wikipedia , lookup
Forecasting wikipedia , lookup
Information privacy law wikipedia , lookup
Data vault modeling wikipedia , lookup
Physical data organization Disks, blocks, tuples, schemas 107 Physical data organization Execution Engine Query Compiler SQL Translation Logical query plan Logical plan optimization Optimized logical query plan Physical plan selection Physical query plan Result "Machine code" "Intermediate code" Statistics and Metadata Physical Data Storage In order to select a physical plan we need to know: • The physical algorithms available to implement the relational algebra operators e.g., scan a relation to implement a selection • The situations in which each algorithm is best applied (situation x calls for algorithm A, situation y calls for algorithm B, . . . ). 108 Physical data organization Physical algorithms depend on • The representation of data on disk • The data structures used We hence need to know how data is physically organized before studying algorithms This is the subject of chapters 13 and 14 in the book 109 Physical data organization Database Management System • Are responsible for enormous quantities of data (current scale: exabytes = 1 million gigabytes) • Must query this data as efficiently as possible • Must store data as reliably as possible Hence we should wonder: • What are the available storage media? • How much “time” does it take to read from/write to these media? • How can we minimize this costs? • How can we prevent data loss due to disk crashes? The answers to these questions may be found in chapter 13 110 Physical data organization The types of data that we will need to store are: • Schemas • Records • Relations How can we represent them efficiently “on disk”? The answer may be found in chapter 13 111