fixing links

src/teaching/cse-350/2024sp/index.erb

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