A RPW-kBest Query Based on Reduced Possible World in Uncertain Database
Liu Fang-ai · Computer Technology and Development · 2011
Uncertain data arises from a few important applications.Such as wireless sensor networks,P2P systems,mobile computing and RFID technologh.Many data models have been developed,stemming from the core possible world model.For the possible world models contains a huge number of the possible world instances which is far greater than the volume of the uncertain database,so a high-efficiency RPW-kBest Query be proposed,which reduces the possible world and a lower storage cost.The algorithm computes the bound of the probability and filter the data entries as much as possible,which have no chance to influence the query result and process RPW-kBest queries in a smallest search space.Experiments show that the algorithm can process the queries correctly and efficiently improved query efficiency and little memory usage.