Abstract
Efficient processing of top-k queries has become a classical research area. Fagin et al. proposed the “middleware cost” for a top-k query algorithm. In some scenario, there is no way to perform a random access, and Fagin et al. proposed NRA (No Random Access) algorithm for that. In this paper, we investigate the intrinsic relation between top-k queries and K-skyband queries. Based on that relation, we propose a novel algorithm DNRA (Dominate-NRA). The main idea of DNRA is to partition the original dataset into two sub-datasets depending on whether they belong to K-skyband or not. We prove that DNRA performs no more sorted accesses than NRA on any dataset. Furthermore, we partition the dataset into N sub-datasets (N is the number of objects in the dataset), and then we propose our algorithm ADNRA (Advanced-DNRA). The partition of the dataset is pre-computed, and we discuss two techniques to fulfill it. Extensive experiments show that our algorithms perform several orders of magnitude fewer accesses than NRA and that ADNRA performs significantly fewer accesses than DNRA on some datasets.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Fagin, R., Lotem, A., Naor, M.: Optimal aggregation algorithms for middleware. In: PODS Conf. (2001)
Guntzer, U., Balke, W.-T., KieSling, W.: Towards efficient multi-feature queries in heterogeneous environments. In: IEEE Int’l Conf. on Information Technology, ITCC (2001)
Ilyas, I.F., Aref, W.G., Elmagarmid, A.K.: Joining ranked inputs in practice. In: VLDB Conf. (2002)
Ilyas, I.F., Aref, W.G., Elmagarmid, A.K.: Supporting top-k join queries in relational databases. In: VLDB Conf. (2003)
Börzsönyi, S., Kossmann, D., Stocker, K.: The skyline operator. In: ICDE Conf. (2001)
Balke, W.-T., Nejdl, W., Siberski, W., Thaden, U.: Progressive distributed top-k retrie-val in peer-to-peer networks. In: ICDE Conf. (2005)
Kimelfeld, B., Sagiv, Y.: Finding and approximating top-k answers in keyword proximity search. In: PODS Conf. (2006)
Babcock, B., Olston, C.: Distributed top-k monitoring. In: SIGMOD Conf. (2003)
Cao, P., Wang, Z.: Efficient top-k query calculation in distributed networks. In: PODC Conf. (2004)
Akbarinia, R., Pacitti, E., Valduriez, P.: Reducing network traffic in unstructured P2P systems using Top-k queries. Distributed and Parallel Databases 19(2) (2006)
Akbarinia, R., Pacitti, E., Valduriez, P.: Processing top-k queries in distributed hash tables. In: Kermarrec, A.-M., Bougé, L., Priol, T. (eds.) Euro-Par 2007. LNCS, vol. 4641, pp. 489–502. Springer, Heidelberg (2007)
Yuan, J., Sun, G.Z., Tian, Y., Chen, G.L., Liu, Z.: Selective-NRA Algorithms for Top-k Queries. In: APWeb/ WAIM Conf. (2009)
Tan, K., Eng, P., Ooi, B.: Efficient Progressive Skyline Computation. In: VLDB Conf. (2001)
Papadias, D., Tao, Y., Fu, G., Seeger, B.: Progressive skyline computation in database systems. ACM Transactions on Database Systems 30(1), 41–82 (2005)
Vlachou, A., Doulkeridis, C., Norvag, K., Vazirgiannis, M.: On Efficient Top-k Query Pro-cessing in Highly Distributed Environments. In: SIGMOD Conf. (2008)
Zou, L., Chen, L.: Dominant Graph: An Efficient Indexing Structure to Answer Top-K Queries. In: ICDE Conf. (2008)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to algorithms. MIT Press, Cambridge (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Gong, Z., Sun, GZ., Yuan, J., Zhong, Y. (2009). Efficient Top-k Query Algorithms Using K-Skyband Partition. In: Mueller, P., Cao, JN., Wang, CL. (eds) Scalable Information Systems. INFOSCALE 2009. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 18. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10485-5_21
Download citation
DOI: https://doi.org/10.1007/978-3-642-10485-5_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10484-8
Online ISBN: 978-3-642-10485-5
eBook Packages: Computer ScienceComputer Science (R0)