IRTA: AN IMPROVED THRESHOLD ALGORITHM FOR REVERSE TOP-K QUERIES

Cheng Luo, Feng Yu, Wen-Chi Hou, Zhewei Jiang, Dunren Che, Shan He

Abstract

Reverse top-k queries are recently proposed to help producers (or manufacturers) predict the popularity of a particular product. They can also help them design effective marketing strategies to advertise their products to a target audience. This paper designs an innovative algorithm, termed IRTA (Improved Reverse top-k Threshold Algorithm), to answer reverse top-k queries efficiently. Compared with the state-of-the-art RTA algorithm, it further reduces the number of expensive top-k queries. Besides, it utilizes the dominance and reverse-dominance relationships between the query product and the other products to cut down the cost of each top-k query. Comprehensive theoretical analyses and experimental studies show that IRTA is a more effective algorithm than RTA.

References

  1. Akbarinia, R., Pacitti, E., and Valduriez, P. (2007). Best position algorithm for top-k queries. Proc of VLDB, pages 495-506.
  2. Chang, Y.-C., Bergman, L. D., Castelli, V., Li, C.-S., Lo, M.-L., and Smith, J. R. (2000). The onion technique: Indexing for linear optimization queries. Proc of SIGMOD, pages 391-402.
  3. Chaudhuri, S. and Gravano, L. (1999). Evaluating top-k selection queries. Proc of VLDB, pages 397-410.
  4. Dellis, E. and Seeger, B. (2007). Efficient computation of reverse skyline queries. Proc of VLDB, pages 291- 302.
  5. Fagin, R., Lotem, A., and Maor, M. (2001). Optimal aggregation algorithms for middleware. Proc of PODS, pages 102-113.
  6. Hou, W.-C., Luo, C., Jiang, Z., and Yan, F. (2008). Approximate range-sum queries over data cubes using cosine transform. International Journal of Information Technology, 4(4):292-298.
  7. Hristidis, V., Koudas, N., and Papakonstantinou, Y. (2001). Prefer: A system for the efficient execution of multiparametric ranked queries. Proc of SIGMOD, pages 259-270.
  8. Korn, F. and Muthukrishnan, S. (2000). Influence sets based on reverse nearest neighbor queries. Proc of SIGMOD, pages 201-212.
  9. Tan, P.-N., Steinbach, M., and Kumar, V. (2005). Introduction to data mining. Addison-Wesley, page 500.
  10. Vlachou, A., Doulkeridis, C., Kotidis, Y., and Norvag, K. (2010). Reverse top-k queries. Proc of ICDE, pages 365-376.
  11. Xin, D., Cheng, C., and Han, J. (2006). Towards robust indexing for ranked queries. Proc of VLDB, pages 235- 246.
  12. Yi, K., Yu, H., Yang, J., Xia, G., and Chen, Y. (2003). Efficient maintenance of materialized top-k views. Proc of ICDE, pages 189-200.
  13. Zou, L. and Chen, L. (2008). Dominant graph: An efficient indexing structure to answer top-k queries. Proc of ICDE, pages 536-545.
Download


Paper Citation


in Harvard Style

Luo C., Yu F., Hou W., Jiang Z., Che D. and He S. (2011). IRTA: AN IMPROVED THRESHOLD ALGORITHM FOR REVERSE TOP-K QUERIES . In Proceedings of the 13th International Conference on Enterprise Information Systems - Volume 1: ICEIS, ISBN 978-989-8425-53-9, pages 135-140. DOI: 10.5220/0003422501350140


in Bibtex Style

@conference{iceis11,
author={Cheng Luo and Feng Yu and Wen-Chi Hou and Zhewei Jiang and Dunren Che and Shan He},
title={IRTA: AN IMPROVED THRESHOLD ALGORITHM FOR REVERSE TOP-K QUERIES},
booktitle={Proceedings of the 13th International Conference on Enterprise Information Systems - Volume 1: ICEIS,},
year={2011},
pages={135-140},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003422501350140},
isbn={978-989-8425-53-9},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 13th International Conference on Enterprise Information Systems - Volume 1: ICEIS,
TI - IRTA: AN IMPROVED THRESHOLD ALGORITHM FOR REVERSE TOP-K QUERIES
SN - 978-989-8425-53-9
AU - Luo C.
AU - Yu F.
AU - Hou W.
AU - Jiang Z.
AU - Che D.
AU - He S.
PY - 2011
SP - 135
EP - 140
DO - 10.5220/0003422501350140