10 Result(s)

Reference Work Entry In depth

Query Processing over Uncertain Data

Nilesh Dalvi, Dan Olteanu in Encyclopedia of Database Systems (2018)

Reference Work Entry In depth

Uncertainty Management in Scientific Database Systems

Nilesh Dalvi in Encyclopedia of Database Systems (2018)

Living Reference Work Entry In depth

Query Processing over Uncertain Data

Nilesh Dalvi, Dan Olteanu in Encyclopedia of Database Systems

Living Reference Work Entry In depth

Uncertainty Management in Scientific Database Systems

Nilesh Dalvi in Encyclopedia of Database Systems

Article

Query Evaluation on a Database Given by a Random Graph

We consider random graphs, and their extensions to random structures, with edge probabilities of the form β n ^−α , where n is the number of ...

Nilesh Dalvi in Theory of Computing Systems (2009)

Reference Work Entry In depth

Uncertainty Management in Scientific Database Systems

Nilesh Dalvi in Encyclopedia of Database Systems (2009)

Article

Efficient query evaluation on probabilistic databases

We describe a framework for supporting arbitrarily complex SQL queries with “uncertain” predicates. The query semantics is based on a probabilistic model and the results are ranked, much like in Information Re...

Nilesh Dalvi, Dan Suciu in The VLDB Journal (2007)

Chapter and Conference Paper

Query Evaluation on a Database Given by a Random Graph

We consider random graphs, and their extensions to random structures, with edge probabilities of the form βn ^{− − α}, where n is the number of vertices, α, β are fixed and α> 1 (α> arity ...

Nilesh Dalvi in Database Theory – ICDT 2007 (2006)

Chapter and Conference Paper

Asymptotic Conditional Probabilities for Conjunctive Queries

We study the asymptotic probabilities of conjunctive queries on random graphs.We consider a probabilistic model where the expected graph size remains constant independent of the number of vertices. While it ha...

Nilesh Dalvi, Gerome Miklau, Dan Suciu in Database Theory - ICDT 2005 (2005)