Query Processing in a Self-Organized Storage System
Hannes Mühleisen, supervised by Robert Tolksdorf
1
Query Processing in a Self-Organized Storage System Hannes - - PowerPoint PPT Presentation
Query Processing in a Self-Organized Storage System Hannes Mhleisen, supervised by Robert Tolksdorf 1 Distributed DBs - Goals Scalability Data, Queries, Nodes Robustness Node/Network failure Adaptiveness Fair
Hannes Mühleisen, supervised by Robert Tolksdorf
1
2
S1 S2 S3 S4 S5 S6 C1
3
[Bernstein81, Epstein78]
S1 S2 S3 S6 S5 S4
1-2 0-1 2-3 3-4 4-5 5-6
4
[Harren02,Karnstedt04,Rösch05]
S1 S2 S3 S6 S5 S4
#B
70% 25% 95% 50% 50% 95% 10% 85%
#B?
5
[Lindgren03]
[Wilensky97, NetLogo Ants model]
6
Scalability Adaptability Robustness Completeness Complex Queries Stand-Alone Federated Global-Law Probabilistic e.g. Swarms
7
8
↺
↺
9
[Papadimos03,Battré08]
10
↺
↺
↺
11
↺
↺
12
↺
13
3,75 7,5 11,25 15 Query 1 Query 2 Query 3 Query4
Optimal Plan Moving Mutable Plans Static Plan Routing
14
150 300 450 600 Query 1 Query 2 Query 3 Query4
Optimal Plan Moving Mutable Plans Static Plan Routing
Web Page: http://hannes.muehleisen.org