From ecc8d6ce4006f213a5dae2342b795eb4ff736c27 Mon Sep 17 00:00:00 2001 From: Oliver Kennedy Date: Wed, 20 Sep 2017 09:08:30 -0400 Subject: [PATCH] Imputation paper --- src/teaching/cse-662/2017fa/index.md | 5 ++++- 1 file changed, 4 insertions(+), 1 deletion(-) diff --git a/src/teaching/cse-662/2017fa/index.md b/src/teaching/cse-662/2017fa/index.md index b1538693..1c114487 100644 --- a/src/teaching/cse-662/2017fa/index.md +++ b/src/teaching/cse-662/2017fa/index.md @@ -1,5 +1,8 @@ --- title: CSE 662 - Languages and Runtimes for Big Data - Fall 2016 +paper_options: + - title: Query optimization for dynamic imputation + url: http://dl.acm.org/citation.cfm?id=3137641 --- # CSE 662 - Fall 2017 @@ -210,7 +213,7 @@ Partitioning is especially a problem in 2-dimensional (and 3-, 4-, etc... dimens ###### Background Material: * [Database Cracking](http://stratos.seas.harvard.edu/files/IKM_CIDR07.pdf) -* [The R*-tree: an efficient and robust access method for points and rectangles](http://dl.acm.org.gate.lib.buffalo.edu/citation.cfm?id=98741) +* [The R*-tree: an efficient and robust access method for points and rectangles](http://dl.acm.org.gate.lib.buffalo.edu/citation.cfm?id=98741) * [The Big Red Data Spatial Indexing Project](http://www.cs.cornell.edu/database/spatial-indexing/)