In distributed database system, the data are located at different locations. As the data are at multiple locations, it may not be accurate. It may contain uncertain values or even some data may be missing. Due to impreciseness and uncertainty in the data, occurrence of error becomes high. This makes the processing of the data difficult. There are many ways to handle uncertain databases. To obtain required data, ranking technique is used. One such technique is the top-k query method where the data are retrieved according to user input. This paper proposes an algorithm that ranks and retrieves the data in minimum time at tuple level. In addition, the number of records traversed during this ranking and retrieval process is minimized. The time taken for retrieval of the records is also analyzed.
N. Lalithamani, “Ranking uncertain distributed databases at tuple level”, in Advances in Computational Intelligence - Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 509), 2017, vol. 509, pp. pp.221-229.