Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Multiple issues with SQL's handling of nulls have been ll documented. Having efficiency as its key goal, evaluation of SQL queries disregards the standard notion of correctness on incomplete databases - certain ansrs - due to its high complexity. As a result, it may produce ansrs that are just plain wrong. It was recently shown that SQL evaluation can be modified, at least for first-order queries, to return only correct ansrs. But while these modifications came with good theoretical complexity bounds, they have not been tested in practice. The goals of this proof-of-concept paper are to understand whether wrong ansrs can be produced by SQL queries in real-world scenarios, and whether proposed techniques for avoiding them can be made practically feasible.    use the TPC-H benchmark, and show that for some typical queries involving negation, wrong ansrs are very common. On the other hand, existing solutions for fixing the problem do not work in practice at all. By analyzing the reasons for this,  come up with a new modified way of rewriting SQL queries that restores correctness.  conduct experiments which show the feasibility of our solution: the small price tag it imposes can be often tolerated to ensure correct results, and  do not miss correct ansrs that the usual SQL evaluation produces. The overall conclusion is that correct evaluation can be realistically achieved in the presence of nulls, at least for the SQL fragment that corresponds to first-order queries.
['Paolo Guagliardo', 'Leonid Libkin']
I am writing a research paper on a idea Making SQL Queries Correct on Incomplete Databases: A Feasibility Study
[{"from": "human", "value": "I am writing a research paper on a idea Making SQL Queries Correct on Incomplete Databases: A Feasibility Study"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Multiple issues with SQL's handling of nulls have been ll documented. Having efficiency as its key goal, evaluation of SQL queries disregards the standard notion of correctness on incomplete databases - certain ansrs - due to its high complexity. As a result, it may produce ansrs that are just plain wrong. It was recently shown that SQL evaluation can be modified, at least for first-order queries, to return only correct ansrs. But while these modifications came with good theoretical complexity bounds, they have not been tested in practice. The goals of this proof-of-concept paper are to understand whether wrong ansrs can be produced by SQL queries in real-world scenarios, and whether proposed techniques for avoiding them can be made practically feasible.    use the TPC-H benchmark, and show that for some typical queries involving negation, wrong ansrs are very common. On the other hand, existing solutions for fixing the problem do not work in practice at all. By analyzing the reasons for this,  come up with a new modified way of rewriting SQL queries that restores correctness.  conduct experiments which show the feasibility of our solution: the small price tag it imposes can be often tolerated to ensure correct results, and  do not miss correct ansrs that the usual SQL evaluation produces. The overall conclusion is that correct evaluation can be realistically achieved in the presence of nulls, at least for the SQL fragment that corresponds to first-order queries."}]