ODIn
/
Website
9
0
Fork 1
Code Pull Requests Releases Wiki Activity

Fixing typos

master
Oliver Kennedy 2016-08-30 10:03:45 -04:00
parent f04b26208f
commit 2a5f69ed31
1 changed files with 1 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
ReadingList-Probabilistic-DBs.md

@ -55,9 +55,7 @@ The central idea behind MayBMS is a practical implementation of Probabilistic C-
#### Sprout (Oxford)
Sprout grew out of the MayBMS project, and has functionally replaced it. It uses a similar data model, but work on sprout has focused largely on optimizing query evaluation. In particular, much of the work involves clever tricks for making it easier/faster to compute reliable approximations of boolean formulas -- the lifeblood of probabilistic databases.
; The work on sprout has focused largely on optimizing query evaluation, ain
Sprout grew out of the MayBMS project, and has functionally replaced it. It uses a similar data model, but work on sprout has focused largely on optimizing query evaluation. In particular, much of the work involves clever tricks for making it easier/faster to compute reliable approximations of boolean formulas -- the main bottleneck in most probabilistic database computations.
* [Approximate Confidence Computation in Probabilistic Databases](http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=5447826)
* [SPROUT: Lazy vs. Eager Query Plans for Tuple-Independent Probabilistic Databases](http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=4812442)