Abstract
Exact top-k query processing has attracted much attention recently because of its wide use in many research areas. Since missing the truly best answers is inherent and unavoidable due to the user’s subjective judgment, and the cost of processing exact top-k queries is highly expensive for datasets with huge volume, it is intriguing to answer approximate top-k query instead. In this paper, we first define a novel kind of approximate top-k query, called μ - approximate top-k query. Then we introduce an efficient index structure, i.e. cube index, based on which, we propose our novel Cube Index Algorithm (CIA). We analyze the complexity of both constructing cube index and CIA algorithm. Moreover, extensive experiments show that CIA performs much better than the well-known approximate TA θ algorithm [3].
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
Ilyas, I., Beskales, G., Soliman, M.A.: A Survey of Top-k Query Processing Techniques in Relational Database Systems. In: ACM Computing Surveys, New York (2008)
Michel, S., Triantafillou, P., Weikum, G.: KLEE: A frame work for distributed top-k query algorithms. In: VLDB (2005)
Fagin, R., Lotem, A., Naor, M.: Optimal aggregation algorithms for middleware. In: PODS (2001)
Gong, N.Z., Sun, G.Z.: Parallel Algorithms for Top-k Query Processing. ACM SIGMOD (2010)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2001)
Theobald, M., Weikum, G., Schenkel, R.: Top-k Query Evaluation with Probabilistic Guarantees. In: VLDB (2004)
Zou, L., Chen, L.: Dominant Graph An Efficient Indexing Structure to Answer Top-K Queries. In: ICDE (2008)
Amato, G., Rabitti, F., Savino, P., Zezula, P.: Region Proximity in Metric Spaces and Its Use For Approximate Similarity Search. ACM Trans. Inform. Syst. (2003)
Xin, D., Han, J., Cheng, H., Li, X.: Answering Top-k Queries with Multi-Dimensional Selections: The Ranking Cube Approach. In: VLDB (2006)
Fagin, R., Kumar, R., Sivakumar, D.: Comparing Top K Lists. ACM-SIAM SODA (2003)
Donjerkovic, D., Ramakrishnan, R.: Probabilistic Optimization of Top N Queries. In: VLDB (1999)
Hellerstein, J., Haas, P., Wang, H.: Online Aggregation. ACM SIGMOD (1997)
Ilyas, I., Aref, W., Elmagarmid, A.: Supporting Top-K Join Queries in Relational Databases. In: VLDB (2004)
Kendall, M., Gibbons, J.D.: Rank Correlation Methods. Oxford University Press, Oxford (1990)
Re, C., Dalvi, N., Suciu, D.: Efficient Top-K Query Evaluation on Probabilistic Data. In: ICDE (2007)
Balke, W.-T., Nejdl, W., Siberski, W., Thaden, U.: Progressive distributed top-k retrieval 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)
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)
Chaudhuri, S., Gravano, L., Marian, A.: Optimizing top-k selection queries over multimedia repositories. IEEE Trans. on Knowledge and Data Engineering 16(8) (2004)
Nepal, S., Ramakrishna, M.V.: Query processing issues in image (multimedia) databases. In: ICDE Conf. (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, D., Sun, GZ., Gong, N.Z. (2011). Efficient Approximate Top-k Query Algorithm Using Cube Index. In: Du, X., Fan, W., Wang, J., Peng, Z., Sharaf, M.A. (eds) Web Technologies and Applications. APWeb 2011. Lecture Notes in Computer Science, vol 6612. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20291-9_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-20291-9_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20290-2
Online ISBN: 978-3-642-20291-9
eBook Packages: Computer ScienceComputer Science (R0)