#### Filter Results:

- Full text PDF available (9)

#### Publication Year

1970

2016

- This year (0)
- Last 5 years (5)
- Last 10 years (11)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Brain Region

#### Key Phrases

#### Method

#### Organism

Learn More

- David Trastour, Robert Fink, Fen Liu
- 2009 IEEE International Symposium on Policies for…
- 2009

The IT Infrastructure Library (ITIL) is a set of best practices that are widely accepted for IT service management. Change management is a core ITIL process that oversees the handling of IT changes and ensures that all change requests are carefully prioritized and authorized, that business and technical impacts are understood, and that required resources… (More)

- Robert Fink, Dan Olteanu
- ICDT
- 2011

This paper investigates the problem of approximating conjunctive queries without self-joins on probabilistic databases by lower and upper bounds that can be computed more efficiently. We study this problem via an indirection: Given a propositional formula &phis;, find formulas in a more restricted language that are greatest lower bound and least upper… (More)

- Robert Fink, Dan Olteanu
- ACM Trans. Database Syst.
- 2016

This article charts the tractability frontier of two classes of relational algebra queries in tuple-independent probabilistic databases. The first class consists of queries with join, projection, selection, and negation but without repeating relation symbols and union. The second class consists of quantified queries that express the following binary… (More)

- Robert Fink, Dan Olteanu, Swaroop Rath
- 2011 IEEE 27th International Conference on Data…
- 2011

Extensive work has recently been done on the evaluation of positive queries on probabilistic databases. The case of queries with negation has notoriously been left out, since it raises serious additional challenges to efficient query evaluation.

- Robert Fink, Larisa Han, Dan Olteanu
- PVLDB
- 2012

This paper presents a query evaluation technique for positive relational algebra queries with aggregates on a representation system for probabilistic data based on the algebraic structures of semiring and semimodule. The core of our evaluation technique is a procedure that compiles semimodule and semiring expressions into so-called decomposition trees, for… (More)

- R Fink, J C Marshall, P W Halligan, R J Dolan
- Journal of cognitive neuroscience
- 2000

! " # ! $ %$ ! & $ ' ( ))*+ $ , $ $ ! . / " 012 130 44 / " $ / 5 / "66 3 130 # .7 $ + , 44 $ $ $ / // $ ! / $ $ $ $ / / "66 2 $ $ 44 / 8 $ // $ $ $ $ $ "66 $ / $ $ / $ $ / # / 9 $ / 9 $ $ / $ + 5 / / $ $ 5 $ $ $ #:7;:<+" = $ $ $ / $ / $ , $ / #> , " ))?@ > , " ))A +" $ / $$ $ $ / ! #> , " ))?@ > , " ))A + / $ #> , " ))A + 8 $ / $ #> , ( ' )))+" 012 $ 5 $ $… (More)

- Robert Fink, Andrew Hogue, Dan Olteanu, Swaroop Rath
- SIGMOD Conference
- 2011

SPROUT² is a query answering system that allows users to ask structured queries over tables embedded in Web pages, over Google Fusion tables, and over uncertain tables that can be extracted from answers to Google Squared. At the core of this service lies SPROUT, a query engine for probabilistic databases. This demonstration allows users to compose and… (More)

- Robert Fink, Dan Olteanu
- PODS
- 2014

This paper shows that any non-repeating conjunctive relational query with negation has either polynomial time or #P-hard data complexity on tuple-independent probabilistic databases. This result extends a dichotomy by Dalvi and Suciu for non-repeating conjunctive queries to queries with negation. The tractable queries with negation are precisely the… (More)

- Robert Fink, Jiewen Huang, Dan Olteanu
- The VLDB Journal
- 2013

This article describes an approximation algorithm for computing the probability of propositional formulas over discrete random variables. It incrementally refines lower and upper bounds on the probability of the formulas until the desired absolute or relative error guarantee is reached. This algorithm is used by the SPROUT query engine to approximate the… (More)

- Sebastiaan J. van Schaik, Dan Olteanu, Robert Fink
- EDBT
- 2014

This paper introduces ENFrame, a unified data processing platform for querying and mining probabilistic data. Using ENFrame, users can write programs in a fragment of Python with constructs such as bounded-range loops, list comprehension, aggregate operations on lists, and calls to external database engines. The program is then interpreted probabilistically… (More)