Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
References
Li, X., Wang, Y., Li, X., Wang, X., Yu, J.: GDPS: an efficient approach for skyline queries over distributed uncertain data. Big Data Res. 1, 23–36 (2014)
Flesca, S., Furfaro, F., Parisi, F.: Consistency checking and querying in probabilistic databases under integrity constraints. J. Comput. Syst. Sci. 80, 1448–1489 (2014)
Cao, P., Wang, Z.: Efficient top-k query calculation in distributed networks. In: Proceedings of the Twenty-third Annual Association for Computing Machinery Symposium on Principles of Distributed Computing, PODC’04, pp. 206–215. Association for Computing Machinery, New York, NY, USA (2004)
AbdulAzeem, Y.M., ElDesouky, A.I., Ali, H.A.: A framework for ranking uncertain distributed database. Data Knowl. Eng. 92, 1–19 (2014)
Soliman, M.A., Ilyas, I.F., Ben-David, S.: Supporting ranking queries on uncertain and incomplete data. Int. J. Very Large Data Bases 19, 477–501 (2010)
Li, F., Yi, K., Jestes, J.: Ranking distributed probabilistic data. Assoc. Comput. Mach. 1–13 (2009)
Ye, M., Liu, X., Lee, W.-C., Lee, D.L.: Probabilistic top-k query processing in distributed sensor networks. In: Proceedings of the 26th IEEE International Conference on Data Engineering, pp. 585–588. IEEE Computer Society, Los Alamitos, CA, USA (2010)
Akbarinia, R., Pacitti, E., Valduriez, P.: Best position algorithms for top-k queries. Assoc. Comput. Mach. (2007)
Li, F., Yi, K., Jestes, J.: Ranking distributed probabilistic data. In: Proceedings of the 2009 ACM SIGMOD International Conference on Management of Data, SIGMOD’09, pp. 361–374. ACM, New York, NY, USA (2009)
Ge, T., Zdonik, S., Madden, S.: Top-k queries on uncertain data: on score distribution and typical answers. In: Association for Computing Machinery (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer Science+Business Media Singapore
About this paper
Cite this paper
Lalithamani, N. (2017). Ranking Uncertain Distributed Database at Tuple Level. In: Sahana, S.K., Saha, S.K. (eds) Advances in Computational Intelligence. ICCI 2015. Advances in Intelligent Systems and Computing, vol 509. Springer, Singapore. https://doi.org/10.1007/978-981-10-2525-9_22
Download citation
DOI: https://doi.org/10.1007/978-981-10-2525-9_22
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-2524-2
Online ISBN: 978-981-10-2525-9
eBook Packages: EngineeringEngineering (R0)