Imputation paper
This commit is contained in:
parent
bdd2bbda14
commit
ecc8d6ce40
|
@ -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/)
|
||||
|
||||
|
||||
|
|
Loading…
Reference in a new issue