It is shown that the data complexity of some queries is #P-complete, which implies that these queries do not admit any efficient evaluation methods, and an optimization algorithm is described that can compute efficiently most queries.Expand

This paper views classification as a game between the classifier and the adversary, and produces a classifier that is optimal given the adversary's optimal strategy, and experiments show that this approach can greatly outperform a classifiers learned in the standard way.Expand

The foundations of managing data where the uncertainties are quantified as probabilities are described, and some fundamental theoretical result for query evaluation on probabilistic databases is presented.Expand

This paper considers the problem of designing optimal strategies for asking questions to humans that minimize the expected number of questions asked, and analyzes several strategies that can be claimed as "optimal" for this problem in a recent work but can perform arbitrarily bad in theory.Expand

This paper obtains bounds on the error rate of the algorithm and shows it is governed by the expansion of the graph, and demonstrates, using several synthetic and real datasets, that the algorithm outperforms the state of the art.Expand

This paper describes a novel approach, which computes and ranks efficiently the top-k answers to a SQL query on a probabilistic database, which is to run in parallel several Monte-Carlo simulations, one for each candidate answer, and approximate each probability only to the extent needed to compute correctly the top -k answers.Expand

The dichotomy property is a fundamental result on query evaluation on probabilistic databases and it gives a complete classification of the complexity of conjunctive queries.Expand

This work considers unions of conjunctive queries, UCQ, which are equivalent to positive, existential First Order Logic sentences, and also to nonrecursive datalog programs, and proves the following dichotomy theorem.Expand

22nd International Conference on Data Engineering…

3 April 2006

TLDR

Robust techniques to estimate the cardinality and the computational cost of Skyline are proposed and through an empirical comparison, it is shown that this technique is substantially more effective than traditional approaches.Expand