Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  address the problem of finding a "best" deterministic query ansr to a query over a probabilistic database. For this purpose,  propose the notion of a consensus world (or a consensus ansr) which is a deterministic world (ansr) that minimizes the expected distance to the possible worlds (ansrs). This problem can be seen as a generalization of the ll-studied inconsistent information aggregation problems (e.g. rank aggregation) to probabilistic databases.  consider this problem for various types of queries including SPJ queries, Top-k ranking queries, group-by aggregate queries, and clustering. For different distance metrics,  obtain polynomial time optimal or approximation algorithms for computing the consensus ansrs (or prove NP-hardness). Most of our results are for a general probabilistic database model, called and/xor tree model, which significantly generalizes previous probabilistic database models like x-tuples and block-independent disjoint models, and is of independent interest.
['Jian Li', 'Amol Deshpande']
I am writing a research paper on a idea Consensus answers for queries over probabilistic databases
[{"from": "human", "value": "I am writing a research paper on a idea Consensus answers for queries over probabilistic databases"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  address the problem of finding a \"best\" deterministic query ansr to a query over a probabilistic database. For this purpose,  propose the notion of a consensus world (or a consensus ansr) which is a deterministic world (ansr) that minimizes the expected distance to the possible worlds (ansrs). This problem can be seen as a generalization of the ll-studied inconsistent information aggregation problems (e.g. rank aggregation) to probabilistic databases.  consider this problem for various types of queries including SPJ queries, Top-k ranking queries, group-by aggregate queries, and clustering. For different distance metrics,  obtain polynomial time optimal or approximation algorithms for computing the consensus ansrs (or prove NP-hardness). Most of our results are for a general probabilistic database model, called and/xor tree model, which significantly generalizes previous probabilistic database models like x-tuples and block-independent disjoint models, and is of independent interest."}]