slide cleanup

index.html

@@ -512,7 +512,7 @@ <h3 class="post-subtitle">
                         (run length encoding), hash joins, index joins, sort-merge joins, invisible joins, star schema
                         <h4>Readings</h4>
                         <ul class="mylist">
-                            <li><a target="_blank" style="font-size:18px; text-decoration: underline;" tabindex="-1" href="./slides/CAS-CS561-Class6-Student-Presentation-1.pdf">Slides</a> </li>
+                            <li><a target="_blank" style="font-size:18px; text-decoration: underline;" tabindex="-1" href="./slides/CAS-CS561-Class6.pdf">Slides</a> </li>
                             <li><strong>(P)</strong> <a href="https://dl.acm.org/citation.cfm?doid=1376616.1376712">Column-Stores vs. Row-Stores: How Different Are They Really?</a>, SIGMOD 2008 (paper for <strong class="red"><script type="text/javascript">document.write("REVIEW R"+(review++)); </script></strong>) </li>
                             <li>(B) <a href="https://dl.acm.org/citation.cfm?id=1083658">C-Store: A Column-oriented DBMS</a>, VLDB 2005</li>
                         </ul>
@@ -578,7 +578,7 @@ <h3 class="post-subtitle">
                         <strong>Concepts</strong>: key-value stores, point queries, blind updates, read-modify-write, on-line transaction processing (OLTP), on-line analytical processing (OLAP), locality, immutable file, mutable file, append-only systems, in-place updates
                         <h4>Readings</h4>
                         <ul class="mylist">
-                            <li><a target="_blank" style="font-size:18px; text-decoration: underline;" tabindex="-1" href="./slides/CAS-CS561-Class8-Student-Presentation-2.pdf">Slides</a> </li>
+                            <li><a target="_blank" style="font-size:18px; text-decoration: underline;" tabindex="-1" href="./slides/CAS-CS561-Class8.pdf">Slides</a> </li>
                             <li><strong>(P)</strong> <a href="https://dl.acm.org/citation.cfm?id=3196898">FASTER: A Concurrent Key-Value Store with In-Place Updates</a>, SIGMOD 2018 [<a href="https://www.youtube.com/watch?v=68YBpitMrMI" target="_blank">conf. present. video</a>] (paper for <strong class="red"><script type="text/javascript">document.write("REVIEW R"+(review++)); </script></strong>)</li>
                             <li> (B) <a href="https://dl.acm.org/citation.cfm?id=2610502">H2O: A Hands-free Adaptive Store</a>, SIGMOD 2014</li>
                             <li> (B) <a href="https://www.cidrdb.org/cidr2011/Papers/CIDR11_Paper25.pdf">Towards a One Size Fits All Database Architecture</a>, CIDR 2011</li>
@@ -681,7 +681,7 @@ <h3 class="post-subtitle">
                         <strong>Concepts</strong>: tree indexing, tries, radix, adaptive radix trees
                         <h4>Readings</h4>
                         <ul class="mylist">
-                            <li><a target="_blank" style="font-size:18px; text-decoration: underline;" tabindex="-1" href="./slides/CAS-CS561-Class11-Student-Presentation-3.pdf">Slides</a> </li>
+                            <li><a target="_blank" style="font-size:18px; text-decoration: underline;" tabindex="-1" href="./slides/CAS-CS561-Class11.pdf">Slides</a> </li>
                             <li><a target="_blank" style="font-size:18px; text-decoration: underline;" tabindex="-1" href="./slides/CAS-CS561-Class11.pdf">Auxiliary Slides</a> </li>
                             <li><strong>(P)</strong> <a href="https://db.in.tum.de/~leis/papers/ART.pdf">The Adaptive Radix Tree: ARTful Indexing for Main-Memory Databases</a>, ICDE 2013 (paper for <strong class="red"><script type="text/javascript">document.write("REVIEW R"+(review++)); </script></strong>)
                             </li>