okennedy created page: ReadingList Probabilistic DBs
parent
42f29e1a20
commit
11466fb16b
|
@ -0,0 +1,47 @@
|
|||
(still in development)
|
||||
|
||||
## Surveys
|
||||
|
||||
* [Morgan & Claypool: Probabilistic Databases](http://www.morganclaypool.com/doi/abs/10.2200/S00362ED1V01Y201105DTM016)
|
||||
|
||||
## Probabilistic Database Systems
|
||||
|
||||
* MayBMS (Cornell)
|
||||
* [MayBMS: Managing incomplete information with probabilistic world-set decompositions](http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4221832)
|
||||
* [${10^{(10^{6})}}$ worlds and beyond: efficient representation and processing of incomplete information](http://dl.acm.org/citation.cfm?id=1644253)
|
||||
* [MayBMS: a probabilistic database management system](http://dl.acm.org/citation.cfm?id=1559984)
|
||||
* A Compositional Query Algebra for Second-Order Logic and Uncertain Databases
|
||||
* On Query Algebras for Probabilistic Databases
|
||||
* On APIs for Probabilistic Databases
|
||||
* From Complete to Incomplete Information and Back
|
||||
* DEMO: [Query language support for incomplete information in the MayBMS system](http://dl.acm.org/citation.cfm?id=1326031)
|
||||
* BOOK CHAPTER: [MayBMS: A system for managing large uncertain and probabilistic databases](http://link.springer.com/content/pdf/10.1007/978-0-387-09690-2.pdf#page=166)
|
||||
* MANUAL: [MayBMS: A Probabilistic Database System.](http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.147.1226&rep=rep1&type=pdf)
|
||||
* Pip (Cornell)
|
||||
* [PIP: A database system for great and small expectations](http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5447879)
|
||||
* MystiQ (UWash)
|
||||
*
|
||||
* Orion (UMD)
|
||||
* Trio (Stanford)
|
||||
* Sprout (Oxford)
|
||||
* Approximate Confidence Computation in Probabilistic Databases
|
||||
* SPROUT: Lazy vs. Eager Query Plans for Tuple-Independent Probabilistic Databases
|
||||
* A dichotomy for non-repeating queries with negation in probabilistic databases
|
||||
* Anytime Approximation in Probabilistic Databases
|
||||
* Aggregates in Probabilistic Databases via Knowledge Compilation
|
||||
* Ranking in Probabilistic Databases: Complexity and Efficient Algorithms
|
||||
* Orchestra (UPenn)
|
||||
* Mimir (UBuff)
|
||||
* [On-Demand Query Result Cleaning](http://www.vldb.org/2014/phd_workshop.proceedings_files/Camera-Ready%20Papers/Paper%201283/p1283-Yang.pdf)
|
||||
* [Detecting the Temporal Context of Queries](http://link.springer.com/chapter/10.1007/978-3-662-46839-5_7)
|
||||
* [Lenses: an on-demand approach to ETL](http://dl.acm.org/citation.cfm?id=2824055)
|
||||
* Jigsaw (Cornell/Microsoft)
|
||||
* [Jigsaw: Efficient optimization over uncertain enterprise data](http://dl.acm.org/citation.cfm?id=1989410)
|
||||
* DEMO: [Fuzzy prophet: parameter exploration in uncertain enterprise scenarios](http://dl.acm.org/citation.cfm?id=1989482)
|
||||
|
||||
|
||||
## Model Database Systems
|
||||
|
||||
* BayesStore
|
||||
* MauveDB
|
||||
* Velox
|
Loading…
Reference in New Issue