fixing links
parent
c8a193b45b
commit
0f11bcae04
|
@ -48,19 +48,19 @@ schedule:
|
||||||
- topic: Write-Optimized structures
|
- topic: Write-Optimized structures
|
||||||
detail: We build up LSM trees and Beta-Epsilon Trees from first principles
|
detail: We build up LSM trees and Beta-Epsilon Trees from first principles
|
||||||
docs:
|
docs:
|
||||||
- lsm trees: https://www.cs.umb.edu/~poneil/lsmtree.pdf
|
lsm_trees: https://www.cs.umb.edu/~poneil/lsmtree.pdf
|
||||||
- bslm trees: https://dl.acm.org/doi/10.1145/2213836.2213862
|
bslm_trees: https://dl.acm.org/doi/10.1145/2213836.2213862
|
||||||
- crimsondb: http://daslab.seas.harvard.edu/projects/crimsondb-demo/
|
crimson_db: http://daslab.seas.harvard.edu/projects/crimsondb-demo/
|
||||||
- beta-epsilon: https://www.usenix.org/publications/login/oct15/bender
|
beta_epsilon: https://www.usenix.org/publications/login/oct15/bender
|
||||||
- notes: slide/07-write-optimized.pdf
|
notes: slide/07-write-optimized.pdf
|
||||||
- topic: The Shuffle Operation
|
- topic: The Shuffle Operation
|
||||||
detail: We explore on-disk hashing and related strategies for partitioning data into manageable chunks
|
detail: We explore on-disk hashing and related strategies for partitioning data into manageable chunks
|
||||||
docs:
|
docs:
|
||||||
- notes: slide/08-shuffling.pdf
|
notes: slide/08-shuffling.pdf
|
||||||
- topic: Bloom Filters
|
- topic: Bloom Filters
|
||||||
detail: Using compact summary structures to avoid expensive on-disk operations
|
detail: Using compact summary structures to avoid expensive on-disk operations
|
||||||
docs:
|
docs:
|
||||||
- notes: slide/07-write-optimized.pdf
|
notes: slide/07-write-optimized.pdf
|
||||||
- topic: Dataframe Storage
|
- topic: Dataframe Storage
|
||||||
detail: We design, from first principles, a storage format for persistent, mutable dataframes (aka relational tables)
|
detail: We design, from first principles, a storage format for persistent, mutable dataframes (aka relational tables)
|
||||||
- topic: TBD
|
- topic: TBD
|
||||||
|
|
Loading…
Reference in New Issue