NRank: A Unified Platform Independent Approach for Top-K Algorithms
Martin Čech, Jaroslav Pokorný
2012
Abstract
Due to increasing capacity of storage devices and speed of computer networks during last years, it is still more required to sort and search data effectively. A query result containing thousands of rows from a relational database is usually useless and unreadable. In that situation, users may prefer to define constraints and sorting priorities in the query, and see only several top rows from the result. This paper deals with top-k queries problems, extension of relational algebra by new operators and their implementation in a database system. It focuses on optimization of operations join and sort. The work also includes implementation and comparison of some algorithms in standalone .NET library NRank.
References
- Abid, A. and Tagliasacchi, M. (2011). Parallel Data Access for Multiway Rank Joins. In ICWE 2011, S. Auer, O. Diaz, and G.A. Papadopoulos (Eds.), LNCS 6757, 44-58.
- Bruno, N., Chaudhuri, S., and Gravano, L. (2002). Top-k Scoring Queries over Databases: Mapping strategies and Performance Evaluation. ACM Transactions on Database Systems, Vol. 27, No. 2, 153-187.
- Fagin, R., Lotem, A. and Naor, M. (2003). Optimal aggregation algorithms for middleware. Journal of Computer and System Sciences 66, 614-656.
- Finger, J. and Polyzotis, N. (2009). Robust and Efficient Algorithms for Rank Join Evaluation. In ACM SIGMOD International Conference on Management of Data, Providence, Rhode Island, USA, June 29 - July 2, 415-428.
- Hornicák, E., Ondreicka, M., Pokorný, J., Vojtáš, P. (2011). Multi-user Searching of Top-k Objects with Data on Remote Servers. In: ADBIS 2011 - Research Communications, J. Eder, M. Bielikova, and A Min Thoa (Eds.), Oesterreichische Comp. Gesellschaft, Vienna, Austria, Sep. 20-30, 200-211.
- Ilyas, I. F., Aref, W. G. and Elmagarmid, A. K. (2004). Supporting Top-k Join Queries in Databases. The VLDB Journal (2004) 13: 207-221.
- Ilyas, I. F., Shah, R., Aref, W. G., Vitter, J. S. and Elmagarmid, A. K. (2004). Rank-aware query optimization. In ACM SIGMOD International Conference on Management of Data, Paris, France, June 13-18, 203-214.
- Ilyas, I. F., Beskales, G. and Soliman, M. A. (2008). A Survey of Top-k Query Processing Techniques in Relational Database Systems. ACM Computing Surveys, Vol. 40, No. 4, Article 11, 58 p.
- Khalefa, M. E., Mokbel, M. F. and Levandoski, J. J. (2011). PrefJoin: An Efficient Preference-aware Join Operator. In 27th International Conference on Data Engineering (ICDE), IEEE, 995-1006.
- Kini, A. and Naughton, J. F. (2007). Database Support for Weighted Match Joins. In: Proceedings of 19th International Conference on Scientific and Statistical Database Management (SSDBM 2007), IEEE, 10 p.
- Li, Ch., Chang, K. Ch., Ilyas, I. F. and Song, S. (2005). RankSQL: Query Algebra and Optimization for Top-k Queries. In ACM SIGMOD International Conference on Management of Data, Baltimore, Maryland, USA, June 14-16, 131-142.
- Mamoulis, N., Yiu, M. L., Cheng, K. H., Cheung, D. W. (2007). Efficient Top-k Aggregation of Ranked Inputs. ACM Transactions on Database Systems, Vol. 32, August, Article 19.
Paper Citation
in Harvard Style
Čech M. and Pokorný J. (2012). NRank: A Unified Platform Independent Approach for Top-K Algorithms . In Proceedings of the International Conference on Data Technologies and Applications - Volume 1: DATA, ISBN 978-989-8565-18-1, pages 111-116. DOI: 10.5220/0003966901110116
in Bibtex Style
@conference{data12,
author={Martin Čech and Jaroslav Pokorný},
title={NRank: A Unified Platform Independent Approach for Top-K Algorithms},
booktitle={Proceedings of the International Conference on Data Technologies and Applications - Volume 1: DATA,},
year={2012},
pages={111-116},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003966901110116},
isbn={978-989-8565-18-1},
}
in EndNote Style
TY - CONF
JO - Proceedings of the International Conference on Data Technologies and Applications - Volume 1: DATA,
TI - NRank: A Unified Platform Independent Approach for Top-K Algorithms
SN - 978-989-8565-18-1
AU - Čech M.
AU - Pokorný J.
PY - 2012
SP - 111
EP - 116
DO - 10.5220/0003966901110116