Efficient Query Evaluation of Probabilistic Top-k Queries in Wireless Sensor Networks

Indecisive data arises in a number of domains, including data addition and sensor networks. Top-k queries that grade results according to some user-defined score are an significant tool for exploring large indecisive data sets. So, we introduce the ordered query evaluation of the Enough set-based (ESB), necessary set-based (NSB), and boundary-based (BB) algorithm for distributed processing in Top-K queries in wireless sensor networks, for inter cluster query processing with delimited rounds of communications and in responding to dynamic changes of data giving out in the network, we build up an adaptive algorithm that dynamically switches between the three proposed algorithms to diminish the transmission cost. The general method to evaluate the reliability of a data robotically retrieved from the web. Finally results given that the proposed algorithms decrease data transmissions drastically and acquire only small constant rounds of data communications for reliability. The investigational results also demonstrate the superiority of the adaptive algorithm, which achieves a near-optimal performance under various conditions