Project outlines
This commit is contained in:
parent
47b07c7599
commit
6842c834e9
|
|
@ -34,7 +34,7 @@ the group's report, deliverables, and any related tools and technology.
|
|||
3. At the final stage, students are expected to provide a roughly 5-page report
|
||||
detailing their project, any algorithms or data structures developed, and
|
||||
evaluating their project against any comparable state of the art systems and
|
||||
techniques. Groups will also be expected to demon- strate their project and
|
||||
techniques. Groups will also be expected to demonstrate their project and
|
||||
present their findings in-class, or in a meeting with both instructors if
|
||||
necessitated by time constraints. This report and presentation constitute
|
||||
50% of the final grade.
|
||||
|
|
@ -73,30 +73,30 @@ After the taking the course, students should be able to:
|
|||
|
||||
## Course Schedule
|
||||
|
||||
* **Aug. 28** : Introduction ( [group formation](group_formation.html) | slides )
|
||||
* **Aug. 28** : Introduction [ [groups](group_formation.html) | [slides](slides/2017-08-28-Intro.pdf) ]
|
||||
* **Aug. 30** : Project Seeds - Mimir
|
||||
* **Sept. 01** : Project Seeds - JITDs & PocketData
|
||||
* **Sept. 04** : Database Cracking ( [Cracking](http://stratos.seas.harvard.edu/files/IKM_CIDR07.pdf) )
|
||||
* **Sept. 04** : Database Cracking [ [paper](http://stratos.seas.harvard.edu/files/IKM_CIDR07.pdf) | [feedback](feedback/01-cracking.html) ]
|
||||
* **Sept. 06** : Functional Data Structures
|
||||
* **Sept. 12** : Just-in-Time Data Structures ( [JITDs](http://odin.cse.buffalo.edu/papers/2015/CIDR-jitd-final.pdf) )
|
||||
* **Sept. 12** : Just-in-Time Data Structures [ [paper](http://odin.cse.buffalo.edu/papers/2015/CIDR-jitd-final.pdf) ]
|
||||
* **Sept. 8** : Incomplete Databases 1
|
||||
* **Sept. 11** : Incomplete Databases 2
|
||||
* **Sept. 13** : Incomplete Databases 3
|
||||
* **Sept. 15** : Mimir ( [Mimir](http://odin.cse.buffalo.edu/papers/2015/VLDB-lenses-final.pdf) )
|
||||
* **Sept. 18** : MayBMS ( [MayBMS](http://maybms.sourceforge.net/download/INFOSYS-TR-2007-2.pdf) )
|
||||
* **Sept. 20** : Sampling From Probabilistic Queries ( [MCDB](http://dl.acm.org/citation.cfm?id=1376686) )
|
||||
* **Sept. 22** : Probabilistic Constraint Repair ( [Sampling from Repairs](https://cs.uwaterloo.ca/~ilyas/papers/BeskalesVLDBJ2014.pdf) )
|
||||
* **Sept. 15** : Mimir [ [paper](http://odin.cse.buffalo.edu/papers/2015/VLDB-lenses-final.pdf) ]
|
||||
* **Sept. 18** : MayBMS [ [paper](http://maybms.sourceforge.net/download/INFOSYS-TR-2007-2.pdf) ]
|
||||
* **Sept. 20** : Sampling From Probabilistic Queries [ [paper](http://dl.acm.org/citation.cfm?id=1376686) ]
|
||||
* **Sept. 22** : Probabilistic Constraint Repair [ [paper](https://cs.uwaterloo.ca/~ilyas/papers/BeskalesVLDBJ2014.pdf) ]
|
||||
* **Sept. 25** : R-Trees and Multidimensional Indexing
|
||||
* **Sept. 27 - Sept. 29** : Student Project Presentations
|
||||
* **Oct. 2** : BloomL ( [Bloom/Bud](http://cidrdb.org/cidr2011/Papers/CIDR11_Paper35.pdf), [BloomL](http://dl.acm.org/citation.cfm?id=2391230) )
|
||||
* **Oct. 2** : BloomL [ [paper-1](http://cidrdb.org/cidr2011/Papers/CIDR11_Paper35.pdf), [paper-2](http://dl.acm.org/citation.cfm?id=2391230) ]
|
||||
* **Oct. 4 - Oct. 6** : *Oliver Away* (Content TBD)
|
||||
* **Oct. 9** : NoDB ( [NoDB](http://www.vldb.org/pvldb/vol7/p1119-karpathiotakis.pdf) )
|
||||
* **Oct. 9** : NoDB [ [paper](http://www.vldb.org/pvldb/vol7/p1119-karpathiotakis.pdf) ]
|
||||
* **Oct. 11 - Oct. 13** : Student Project Presentations
|
||||
* **Oct. 16** : Lazy Transactions ( [Stickies](http://dl.acm.org/citation.cfm?id=2610529) )
|
||||
* **Oct. 18** : Streaming ( [Cayuga](http://www.cs.cornell.edu/johannes/papers/2007/2007-CIDR-Cayuga.pdf) )
|
||||
* **Oct. 20** : Scan Sharing ( [Crescando](http://dl.acm.org/citation.cfm?id=1807326) )
|
||||
* **Oct. 16** : Lazy Transactions [ [paper](http://dl.acm.org/citation.cfm?id=2610529) ]
|
||||
* **Oct. 18** : Streaming [ [paper](http://www.cs.cornell.edu/johannes/papers/2007/2007-CIDR-Cayuga.pdf) ]
|
||||
* **Oct. 20** : Scan Sharing [ [paper](http://dl.acm.org/citation.cfm?id=1807326) ]
|
||||
* **Oct. 23 - Oct. 27** : Checkpoint 2 Reviews
|
||||
* **Oct. 30** : Declarative Games ( [SGL](https://infoscience.epfl.ch/record/166858/files/31-sigmod2007_games.pdf) )
|
||||
* **Oct. 30** : Declarative Games [ [paper](https://infoscience.epfl.ch/record/166858/files/31-sigmod2007_games.pdf) ]
|
||||
* **Nov. 1 - Nov. 3** : Student Project Presentations
|
||||
* **Nov. 6 - Nov. 10** : *Oliver Away* (Content TBD)
|
||||
* **Nov. 13** : *Buffer*
|
||||
|
|
@ -172,6 +172,19 @@ The aim of this project would be to implement a simple frontend to an existing d
|
|||
* [DBExplain](https://cudbg.github.io/lab/dbexplain)
|
||||
* [Scorpion](http://sirrice.github.io/files/papers/scorpion-vldb13.pdf)
|
||||
|
||||
#### Physical Layouts for Multiversion (Uncertain) Data
Classical versioning is a monotone operation: It’s rare that someone will want to maintain parallel versions of the data. Conversely, data cleaning requires us to keep track of many different versions of a dataset. For example, there exist some very powerful regression algorithms that can detect outliers very effectively. However, these techniques can't really point out why those outliers are there. Maybe there's missing context that would explain the outlier? Maybe there's an actual data error? Maybe there's a problem with how the data is being interpreted. In short, every outlier should be classified as an "optional" version. In other words, for every outlier, we may wish to fork the data, creating one set of versions with and an otherwise equivalent set without the outlier. Obviously, this will create an exponential number of versions, so we need some ways to eliminate redundancy in the stored version.
Fundamentally, the aim of this project is to outline a range of different workflow options for uncertain data, and derive one or more techniques for how to store, sort, index, and query this data.
###### Background Material:
* [C-Tables](http://dl.acm.org/citation.cfm?id=1886)
* [Data Polygamy](http://dl.acm.org/citation.cfm?id=2915245)
* [MauveDB](http://dl.acm.org/citation.cfm?id=1142483)
* [Indexing Uncertain Data](http://dl.acm.org/citation.cfm?id=1559816)
|
||||
|
||||
#### Garbage Collection in Embedded Databases
|
||||
|
||||
The [PocketData](http://pocketdata.info) project explores the performance of database systems designed for embedded devices (e.g., smartphones, tablets, or sensor networks). As part of this project, we have developed several benchmark workloads aimed at Android and other Java-based settings. Although Java is a garbage-collected language, the short duration of most of our workloads means that they rarely (if ever) involve interactions with the garbage collector. The aim of this project is to develop an understanding of when (if ever) the garbage collector impacts the performance of embedded databases like SQLite or BerkeleyDB.
|
||||
|
||||
(This project will be co-advised by Lukasz Ziarek)
|
||||
|
||||
###### Background Material:
|
||||
|
||||
* [The PocketData Benchmark](http://odin.cse.buffalo.edu/research/pocketdata/)
|
||||
* [PocketBench on GitHub](https://github.com/UBOdin/PocketBench)
|
||||
|
||||
|
||||
#### Adaptive Multidimensional Indexing
|
||||
|
||||
|
|
@ -188,13 +201,7 @@ Partitioning is especially a problem in 2-dimensional (and 3-, 4-, etc... dimens
|
|||
|
||||
#### Mimir on SparkSQL
|
||||
|
||||
(Summary In Progress)
|
||||
|
||||
#### Garbage Collection in Embedded Databases
|
||||
|
||||
(Summary In Progress)
|
||||
|
||||
|
||||
Spark's DataFrames are a powerful set of relational-algebra-like primitives for defining computation that can efficiently run locally or in a distributed setting. However, because Spark aimed at predominantly analytical workloads, it can not be used directly as a drop-in replacement for SQLite. The aim of this project is to transition a large database application (Mimir) from a classical relational database to Spark. Key challenges include:
1. Spark is generally designed to be read-only. Mimir needs to keep track of a variety of metadata. That means this metadata needs to be stored somewhere on the side. Step one will to create a metadata storage and lookup layer.
2. Rewriting components of Mimir to use this metadata layer.
* The [View Manager](https://github.com/UBOdin/mimir/blob/master/src/main/scala/mimir/views/ViewManager.scala) stores and tracks view definitions and associated metadata.
* The [Adaptive Schema Manager](https://github.com/UBOdin/mimir/blob/master/src/main/scala/mimir/adaptive/AdaptiveSchemaManager.scala) stores and tracks adaptive schema definitions and associated metadata.
* The [Model Manager](https://github.com/UBOdin/mimir/blob/master/src/main/scala/mimir/models/ModelManager.scala) stores and tracks materialized instances of a variety of different models.
3. The [Compiler](https://github.com/UBOdin/mimir/blob/master/src/main/scala/mimir/exec/Compiler.scala) infrastructure and [Backend](https://github.com/UBOdin/mimir/blob/master/src/main/scala/mimir/sql/Backend.scala) will need to be modified to work with Spark Data Frames. Because Data Frames are relatively close to relational algebra, it may be best to go directly from one to the other without using SQL as an intermediate.
|
||||
|
||||
-----
|
||||
|
||||
|
|
|
|||
BIN
src/teaching/cse-662/2017fa/slides/2017-08-28-Intro.pdf
Normal file
BIN
src/teaching/cse-662/2017fa/slides/2017-08-28-Intro.pdf
Normal file
Binary file not shown.
Loading…
Reference in a new issue