Browse > Article
http://dx.doi.org/10.5626/KTCP.2015.21.1.76

Efficient Top-k Query Processing Algorithm Using Grid Index-based View Selection Method  

Hong, Seungtae (Chonbuk National Univ.)
Youn, Deulnyeok (Chonbuk National Univ.)
Chang, Jae Woo (Chonbuk National Univ.)
Publication Information
KIISE Transactions on Computing Practices / v.21, no.1, 2015 , pp. 76-81 More about this Journal
Abstract
Research on top-k query processing algorithms for analyzing big data have been spotlighted recently. However, because existing top-k query processing algorithms do not provide an efficient index structure, they incur high query processing costs and cannot support various types of queries. To solve these problems, we propose a top-k query processing algorithm using a view selection method based on a grid index. The proposed algorithm reduces the query processing time by retrieving the minimum number of grid cells for the query range, by using a grid index-based view selection method. Finally, we show from our performance analysis that the proposed scheme outperforms an existing scheme, in terms of both query processing time and query result accuracy.
Keywords
big data; top-k query processing; grid index; view selection method;
Citations & Related Records
Times Cited By KSCI : 2  (Citation Analysis)
연도 인용수 순위
1 S. Hong, S. Lee, S. Lee, "Efficient Execution of Range Top - k Queries in a Hierarchical Max R - Tree," Proc. of the KIISE Korea Spring Conference, Vol. 30, No. 1, pp. 746-748, 2003. (in Korean)
2 I. F. Ioannidis, W. G. Aref, and A. K. Elmagarmid. "Supporting top-k join queries in relational databases system," Journal on Very Large Databases, Vol. 13 No. 3, pp. 207-221, 2004.
3 M. H. Yeo, D. O. Seong, J. S. Yoo, "A Cluster- Based Top-k Query Processing Algorithm in Wireless Sensor Networks," Journal of KIISE : Database, Vol. 36, No. 4, pp. 306-313, 2009. (in Korean)   과학기술학회마을
4 J. S. Park, "A Sampling-based Algorithm for Top-k Similarity Joins," Journal of KIISE : Database, Vol. 41, No. 4, pp. 256-261, 2014. (in Korean)   과학기술학회마을
5 L. Zou and L. Chen, "Pareto-based dominant graph: An efficient indexing structure to answer top-k queries," Journal of the Knowledge and Data Engineering, IEEE Transaction, Vol. 23, No. 5, pp. 727- 741, 2011.   DOI
6 S. Hwang and K. C. Chang, "Optimizing top-k queries for middleware access: A unified cost-based approach," Journal of the ACM Transactions on Database Systems, Vol. 32, No. 1, 2007.
7 G. Das, D. Gunopulos, N. Koudas, and D. Tsirogiannis, "Answering top-k queries using views," Proc. of the 32nd international conference on Very large data bases, pp. 451-462, 2006.
8 Min Xie, Laks V.S. Lakshmanan, Peter T. Wood, "Efficient Top-k Query Answering using Cached Views," Proc. of the 16th International Conference on Extending Database Technology, pp. 498-500, 2013.
9 R. Fagin, A. Lotem, and M. Naor, "Optimal aggregation algorithms for middleware," Journal of Computer and System Sciences, Vol. 66, No. 4, pp. 614- 656, Jun. 2003.   DOI
10 Census- Original data (1987) [Online]. Available: http://archive.ics.uci.edu/ml/