Sciweavers

189 search results - page 2 / 38
» Approximating predicates and expressive queries on probabili...
Sort
View
PVLDB
2008
111views more  PVLDB 2008»
13 years 4 months ago
Approximate lineage for probabilistic databases
In probabilistic databases, lineage is fundamental to both query processing and understanding the data. Current systems s.a. Trio or Mystiq use a complete approach in which the li...
Christopher Ré, Dan Suciu
VLDB
1990
ACM
116views Database» more  VLDB 1990»
13 years 9 months ago
A Probabilistic Framework for Vague Queries and Imprecise Information in Databases
A probabilistic learning model for vague queries and missing or imprecise information in databases is described. Instead of retrieving only a set of answers, our approach yields a...
Norbert Fuhr
ICDT
2009
ACM
166views Database» more  ICDT 2009»
14 years 5 months ago
A compositional framework for complex queries over uncertain data
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
Christoph Koch, Michaela Götz
ADC
2008
Springer
141views Database» more  ADC 2008»
13 years 11 months ago
Approximate Retrieval of XML Data with ApproXPath
Several XML query languages have been proposed that use XPath expressions to locate data. But XPath expressions might miss some data because of irregularities in the data and sche...
Lin Xu, Curtis E. Dyreson
SIGMOD
2011
ACM
249views Database» more  SIGMOD 2011»
12 years 8 months ago
ProApproX: a lightweight approximation query processor over probabilistic trees
We demonstrate a system for querying probabilistic XML documents with simple XPath queries. A user chooses between a variety of query answering techniques, both exact and approxim...
Pierre Senellart, Asma Souihli