Efficient top-k aggregation of ranked inputs

ACM Transactions on Database Systems

Volumn 32, Issue 3, 2007, Pages

  Mamoulis, Nikos ^a   Yiu, Man Lung ^b   Cheng, Kit Hung ^a   Cheung, David W ^a  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

^b AALBORG UNIVERSITY   (Denmark)

Author keywords

Rank aggregation; Top k queries

Indexed keywords

ALGORITHMS; COMPUTATIONAL EFFICIENCY; COST EFFECTIVENESS; STORAGE ALLOCATION (COMPUTER);

RANDOM ACCESSES ALGORITHM; RANK AGGREGATION; TOP-K QUERIES; TOP-K SEARCH;

QUERY LANGUAGES;

EID: 34548407283     PISSN: 03625915     EISSN: 15574644     Source Type: Journal    
DOI: 10.1145/1272743.1272749     Document Type: Article

References (32)

1. AGRAWAL, R. AND WIMMERS, E. L. 2000. A framework for expressing and combining preferences. In Proceedings of the ACM SIGMOD Conference on the Management of Data. ACM, New York, 297-306.
2. BALKE, W.-T. AND GÜNTZER, U. 2004. Multi-objective query processing for database systems. In Proceedings of the Conference on Very Large Databases. 936-947.
3. BEYER, K. S., GOLDSTEIN, J., RAMAKRISHNAN, R., AND SHAFT, U. 1999. When is "nearest neighbor" meaningful? In Proceedings of the 7th International Conference on Database Theory (ICDT). 217-235.
4. BÖRZSÖNYI, S., KOSSMANN, D., AND STOCKER, K. 2001. The skyline operator. In Proceedings of the IEEE International Conference on Data Engineering. IEEE Computer Society Press, Los Alamitos, CA, 421-430.
5. BRUNO, N., CHAUDHURI, S., AND GRAVANO, L. 2002. Top-k selection queries over relational databases: Mapping strategies and performance evaluation. ACM Trans. Datab. Syst. 27, 2, 153-187.
6. CAREY, M. J. AND KOSSMANN, D. 1997. On saying "enough already!" in SQL. In Proceedings of the ACMSIGMOD Conference on the Management of Data. ACM, New York. 219-230.
7. CHANG, K. C.-C. AND HWANG, S.-W. 2002. Minimal probing: supporting expensive predicates for top-k queries. In Proceedings of the ACM SIGMOD Conference on the Management of Data. ACM, New York, 346-357.
8. 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. In Proceedings of the ACM SIGMOD Conference on the Management of Data. ACM, New York, 391-402.
9. DE VRIES, A. P., MAMOULIS, N., NES, N., AND KERSTEN, M. L. 2002. Efficient k-nn search on vertically decomposed data. In Proceedings of the ACM SIGMOD Conference on the Management of Data. ACM, New York, 322-333.
10. FAGIN, R. 1999. Combining fuzzy information from multiple systems. J. Comput. Syst. Scie. 58, 1, 83-99.
11. FAGIN, R. 2002. Combining fuzzy information: an overview. SIGMOD Record 31, 2, 109-118.
12. FAGIN, R., KUMAR, R., AND SIVAKUMAR, D. 2003. Efficient similarity search and classification via rank aggregation. In Proceedings of the ACM SIGMOD Conference on the Management of Data. ACM, New York, 301-312.
13. FAGIN, R., LOTEM, A., AND NAOR, M. 2001. Optimal aggregation algorithms for middleware. In Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. ACM, New York, 102-113.
14. GRAY, J., CHAUDHURI, S., BOSWORTH, A., LAYMAN, A., REICHART, D., VENKATRAO, M., PELLOW, F., AND PIRAHESH, H. 1997. Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub totals. Data Mining Knowl. Disc. 1, 1, 29-53.
15. GÜNTZER, U., BALKE, W.-T., AND KIEBLING, W. 2000. Optimizing multi-feature queries for image databases. In Proceedings of the Conference On Very Large Databases. 419-428.
16. GÜNTZER, U., BALKE, W.-T., AND KIEBLING, W. 2001. Towards efficient multi-feature queries in heterogeneous environments. In Proceedings of the IEEE International Conference on Information Technology (ITCC). IEEE Computer Society Press, Los Alamitos, CA, 622-628.
17. HRISTIDIS, V. AND PAPAKONSTANTINOU, Y. 2004. Algorithms and applications for answering ranked queries using ranked views. The VLDB J. 13, 1, 49-70.
18. ILYAS, I. F., AREF, W. G., AND ELMAGARMID, A. K. 2002. Joining ranked inputs in practice. In Proceedings of the Conference Very Large Databases. 950-961.
19. ILYAS, I. F., AREF, W. G., AND ELMAGARMID, A. K. 2003. Supporting top-k join queries in relational databases. In Proceedings of the Conference on Very Large Databases. 754-765.
20. ILYAS, I. F., SHAH, R., AREF, W. G., VITTER, J. S., AND ELMAGARMID, A. K. 2004. Rank-aware query optimization. In Proceedings of the ACM SIGMOD Conference on the Management of Data. ACM, New York, 203-214.
21. KIEBLING, W. 2002. Foundations of preferences in database systems. In Proceedings of the Conference on Very Large Databases. 311-322.
22. MAMOULIS, N., CHENG, K. H., YIU, M. L., AND CHEUNG, D. W. 2006. Efficient aggregation of ranked inputs. In Proceedings of the IEEE International Conference on Data Engineering. IEEE Computer Society Press, Los Alamitos, CA.
23. MARIAN, A., BRUNO, N., AND GRAVANO, L. 2004. Evaluating top-queries over web-accessible databases. ACM Trans. Datab. Syst. 29, 2, 319-362.
24. MOURATIDIS, K., BAKIRAS, S., AND PAPADIAS, D. 2006. Continuous monitoring of top-k queries over sliding windows. In Proceedings of the ACM SIGMOD Conference on the Management of Data. ACM, New York, 635-646.
25. NATSEV, A., CHANG, Y.-C., SMITH, J. R., LI, C.-S., AND VITTER, J. S. 2001. Supporting incremental join queries on ranked inputs. In Proceedings of the Conference on Very Large Databases. 281-290.
26. NEPAL, S. AND RAMAKRISHNA, M. V. 1999. Query processing issues in image (multimedia) databases. In Proceedings of the IEEE International Conference on Data Engineering. IEEE Computer Society Press, Los Alamitos, CA, 22-29.
27. ORTEGA, M., RUI, Y., CHAKRABARTI, K., MEHROTRA, S., AND HUANG, T. 1997. Supporting similarity queries in MARS. In Proceedings of the ACM International Multimedia Conference. ACM, New York, 403-414.
28. ROUSSOPOULOS, N., KELLEY, S., AND VINCENT, F. 1995. Nearest neighbor queries. In Proceedings of the ACM SIGMOD Conference on the Management of Data. ACM, New York, 71-79.
29. TAO, Y., HRISTIDIS, V., PAPADIAS, D., AND PAPAKONSTANTINOU, Y. 2007. Branch-and-bound processing of ranked queries. Inf. Syst. 32, 3, 424-445.
30. THEOBALD, M., WEIKUM, G., AND SCHENKEL, R. 2004. Top-k query evaluation with probabilistic guarantees. In Proceedings of Conference on the Very Large Databases. 648-659.
31. TSAPARAS, P., PALPANAS, T., KOTIDIS, Y., KOUDAS, N., AND SRIVASTAVA, D. 2003. Ranked join indices. In Proceedings of the IEEE International Conference on Data Engineering. IEEE Computer Society Press, Los Alamitos, CA, 277-288.
32. YI, K., YU, H., YANG, J., XIA, G., AND CHEN, Y. 2003. Efficient maintenance of materialized top-k views. In Proceedings of the IEEE International Conference on Data Engineering. IEEE Computer Society Press, Los Alamitos, CA, 189-200.