1. Database Design and Implementation
CCT396, Fall 2011
Database Design and Implementation
Yuri Takhteyev
University of Toronto
This presentation is licensed under Creative Commons Attribution License, v To view a copy of this license, visit This presentation incorporates images from the Crystal Clear icon collection by Everaldo Coelho, available under LGPL from

2. Week 12 Storage, Structure, and Performance

3. Persistent Easy to read Easy to update Cost-effective
Storage
Persistent
Easy to read
Easy to update
Cost-effective

5. image sources http://en. wikipedia. org/wiki/File:Hard_disk_dismantled
image sources /File:Memory_module_DDRAM_ jpg

6. caching

7. “hierarchical
storage
management”

8. Structure Finding a “storable” representation - Not losing information
- Allowing for easy retrieval
- Allowing for easy update
- Minimizing storage size

9. CSV simple! relatively small but what to do with NULLs?
and how would it perform?

10. CSV
, ,23.47
, ,590.32
, ,44.66
, ,
+ another billion rows

11. CSV
, ,23.47⏎
, ,590.32⏎
, ,44.66⏎
, , ⏎
+ another billion rows

12. CSV
, ,23. 47⏎ , ,590.32⏎ , ,44.66⏎ , , ⏎.....

13. Fixed-Length
+ another billion rows
start of Nth row = N * length of row

14. Fixed-Length
+ another billion rows
How do we add a row?
How do we delete a row?
How do we find a row?

15. Sort it?
+ another billion rows
Finding is easier!
Inserting is harder!

16. And the second field?
+ another billion rows
Sort by the 2nd field?
But avoid duplication!
(Essentially an index.)

17. Trees 755280276,889208095,590.32 and other items that start with 751 2 3 4 5 6 7 8 9 1 2 3 4 5 6 7 8 9
, ,590.32
and other items that start with 75
(does not need to be ordered)

18. Fixed: E.g., ISAM Balanced: E.g., B+ Trees
Fixed vs Balanced
Fixed:
E.g., ISAM
Balanced:
E.g., B+ Trees
A: 4%
M: 9.5%
Q: 0

19. Balanced Tree Antonov Aaronson Zhang O'Neil Zhukov Thomson Silva
Peters
Kim

20. Balanced Tree Antonov O'Neil Thomson Aaronson Silva Peters Kim Zhang
Zhukov

21. Balanced Tree Antonov Kim O'Neil Aaronson Peters Silva Thomson Zhang
Zhukov

22. Balanced Tree Antonov Kim O'Neil Aaronson Peters Silva Thomson Zhang
Zhukov

23. Balanced Tree Antonov Kim O'Neil Aaronson Peters Silva Thomson Zhang
Zhukov

24. Balanced Tree Antonov Aaronson Silva Kim Thomson O'Neil Zhang Peters
Zhukov

25. Balanced Tree Silva Antonov Aaronson Kim Thomson O'Neil Zhang Peters
Zhukov

26. Balanced Tree Silva Antonov Aaronson Kim Thomson O'Neil Zhang Peters
Zhukov

27. Balanced Tree Silva Antonov Aaronson Kim Thomson O'Neil Zhang Peters
Zhukov

28. Balanced Tree Silva Antonov Zhang Aaronson Kim Thomson Zhukov O'Neil
Peters

29. Storage Engines CVS yes, it's an option MyISAM
the default before MySQL 5.5
relatively simple
InnoDB
more features
the new default (since 5.5)

30. The Extra Features Foreign Key Constraints not in MyISAM! Transactions
start transaction;
update table1 ...;
update table2 ...;
commit;
Downside: complexity

31. More Engines Memory no harddrive → faster Blackhole
doesn't actually store anything
Federated
allows remote tables
Etc.

32. Picking an Engine create table superhero ( id integer,
primary key (id),
name char(100)
) engine=MyISAM;

33. Creating an Index Easy retrieval by field create index username_index
- usually automatic for PK
- optional for other fields
- downsides:
additional space
harder inserts
create index username_index
on user(username);

34. Distributed Performance Revisited
Distributing the work:
one big machine
vs. many small ones
Some things are easier to split
Distributing RDBMS is hard
(hence the interest in “NoSQL”)

35. The Exam Reading create statements ER diagrams
Other questions about a schema
Normalization
SQL queries
Broader questions
Practice. Practice. Practice.