Abstract
Algorithms for top-k query are widely used in massive data query, which return k most important objects based on aggregate functions. The classical Threshold Algorithm (TA) is one of the most famous algorithms for top-k query. It requires sequential and random accesses to the lists. The time cost of TA will be very high when data is massive. This paper proposes a new algorithm TABE (Top-k Algorithm Based on Extraction) to minimize the query time. TABE first extracts the objects which have higher ranking on each attribute, and then execute the Threshold Algorithm on these objects. Test results show that TABE has high accuracy to meet the general query requirements, and the experimental results of comparing TABE with NRA (No Random Accesses) show that our proposed algorithm TABE can largely reduce the query time.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Fagin, R., Lotem, A., Naor, M.: Optimal aggregation algorithms for middleware. In: Proceedings of the 20th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS 2001), California, USA, pp. 102–113 (2001)
Fagin, R., Lotem, A., Naor, M.: Optimal aggregation algorithms for middleware. Journal of Computer and System Sciences 66(4), 614–656 (2003)
Pang, H., Ding, X., Zheng, B.: Efficient processing of exact Top-k queries over disk-resident sorted lists. VLDB Journal 19(3), 437–456 (2010)
Han, X., Yang, D., Li, J.: TKEP: an efficient Top-k query processing algorithm on massive data. Chinese Journal of Computers 33(8), 1405–1417 (2010)
Mamoulis, N., Cheng, K.H., Yiu, M.L., Cheung, D.W.: Efficient aggregation of ranked inputs. In: Proceedings of the 22nd International Conference on Data Engineering (ICDE 2006), Atlanta, GA, USA, pp. 72–83 (2006)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag GmbH Berlin Heidelberg
About this paper
Cite this paper
Li, L., Zeng, X., Lu, G. (2012). Top-k Algorithm Based on Extraction. In: Gaol, F., Nguyen, Q. (eds) Proceedings of the 2011 2nd International Congress on Computer Applications and Computational Science. Advances in Intelligent and Soft Computing, vol 144. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28314-7_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-28314-7_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28313-0
Online ISBN: 978-3-642-28314-7
eBook Packages: EngineeringEngineering (R0)