Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Uncertain data are inherent in many applications such as environmental surveillance and quantitative economics research. As an important problem in many applications, KNN query has been extensively investigated in the literature. ,  study the problem of processing rank based KNN query against uncertain data. Besides applying the expected rank semantic to compute KNN,  also introduce the median rank which is less sensitive to the outliers.  show both ranking methods satisfy nice top-k properties such as exact-k, containment, unique ranking, value invariance, stability and fairfulness. For given query q, IO and CPU efficient algorithms are proposed in the paper to compute KNN based on expected (median) ranks of the uncertain objects. To tackle the correlations of the uncertain objects and high IO cost caused by large number of instances of the uncertain objects, randomized algorithms are proposed to approximately compute KNN with theoretical guarantees. Comprehensive experiments are conducted on both real and synthetic data to demonstrate the efficiency of our techniques.
['Ying Zhang', 'Xuemin Lin', 'Gaoping Zhu', 'Wenjie Zhang', 'Qianlu Lin']
I am writing a research paper on a idea Efficient rank based KNN query processing over uncertain data
[{"from": "human", "value": "I am writing a research paper on a idea Efficient rank based KNN query processing over uncertain data"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Uncertain data are inherent in many applications such as environmental surveillance and quantitative economics research. As an important problem in many applications, KNN query has been extensively investigated in the literature. ,  study the problem of processing rank based KNN query against uncertain data. Besides applying the expected rank semantic to compute KNN,  also introduce the median rank which is less sensitive to the outliers.  show both ranking methods satisfy nice top-k properties such as exact-k, containment, unique ranking, value invariance, stability and fairfulness. For given query q, IO and CPU efficient algorithms are proposed in the paper to compute KNN based on expected (median) ranks of the uncertain objects. To tackle the correlations of the uncertain objects and high IO cost caused by large number of instances of the uncertain objects, randomized algorithms are proposed to approximately compute KNN with theoretical guarantees. Comprehensive experiments are conducted on both real and synthetic data to demonstrate the efficiency of our techniques."}]