Sciweavers

Share
99 search results - page 1 / 20
» A compositional framework for complex queries over uncertain...
Sort
View
ICDT
2009
ACM
166views Database» more  ICDT 2009»
11 years 15 days 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
PODS
2015
ACM
31views Database» more  PODS 2015»
4 years 7 months ago
The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints
A relational database is said to be uncertain if primary key constraints can possibly be violated. A repair (or possible world) of an uncertain database is obtained by selecting a...
Paraschos Koutris, Jef Wijsen
CIKM
2010
Springer
9 years 10 months ago
Skyline query processing for uncertain data
Recently, several research efforts have addressed answering skyline queries efficiently over large datasets. However, this research lacks methods to compute these queries over un...
Mohamed E. Khalefa, Mohamed F. Mokbel, Justin J. L...
PVLDB
2010
134views more  PVLDB 2010»
9 years 10 months ago
Conditioning and Aggregating Uncertain Data Streams: Going Beyond Expectations
Uncertain data streams are increasingly common in real-world deployments and monitoring applications require the evaluation of complex queries on such streams. In this paper, we c...
Thanh T. L. Tran, Andrew McGregor, Yanlei Diao, Li...
FQAS
2009
Springer
202views Database» more  FQAS 2009»
10 years 6 months ago
Controlled Aggregate Tree Shaped Questions over Ontologies
Abstract. Controlled languages (CLs) are ambiguity-free subsets of natural languages such as English offering a good trade-off between the formal rigor of ontology and query langua...
Camilo Thorne, Diego Calvanese
books