Acknowledgement
Supported by : 한국연구재단
References
- 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)
- 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.
- 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)
- 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)
- 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. https://doi.org/10.1109/TKDE.2010.240
- 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.
- 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.
- 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.
- 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. https://doi.org/10.1016/S0022-0000(03)00026-6
- Census- Original data (1987) [Online]. Available: http://archive.ics.uci.edu/ml/