Best-Effort top-k query processing under budgetary constraints

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2009, Pages 928-939

  Shmueli Scheuer, Michal ^a   Li, Chen ^a   Mass, Yosimass ^b   Roitman, Haggai ^c   Schenkel, Ralf ^a   Weikum, Gerhard ^a  

^a IBM HAIFA RESEARCH LAB   (Israel)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BEST-EFFORT; BUDGET CONSTRAINT; BUDGETARY CONSTRAINTS; NOVEL ALGORITHM; SCHEDULING DECISIONS; TOP-K QUERY PROCESSING;

INFORMATION RETRIEVAL; QUERY PROCESSING; SCHEDULING ALGORITHMS;

BUDGET CONTROL;

EID: 67649639299     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2009.109     Document Type: Conference Paper

References (17)

1. A. Al-Hamdani and G. Ö zsoyoglu. Selecting topics for web resource discovery: Efficiency issues in a database approach. In DEXA, pages 792 -802, 2003.
2. E. Amitay, D. Carmel, and D. Cohen. Lucene and juru at trec 2007: 1-million queries track.
3. B. Arai, G. Das, D. Gunopulos, and N. Koudas. Anytime measures for top-k algorithms. In VLDB, pages 648 -659, 2007.
4. W.-T. Balke, U. Güntzer, and W. Kießling. On real-time top k querying for mobile services. In DOA/CoopIS/ODBASE, pages 125 -143, London, UK, 2002. Springer-Verlag.
5. H. Bast, D. Majumdar, R. Schenkel, M. Theobald, and G. Weikum. Iotop- k: Index-access optimized top-k query processing. In VLDB, pages 475 -486, 2006.
6. N. Bruno, L. Gravano, and A. Marian. Evaluating top-k queries over web-accessible databases. In ICDE, 2002.
7. K. C.-C. Chang and S. won Hwang. Minimal probing: Supporting expensive predicates for top-k queries. In SIGMOD, 2002.
8. S. Chaudhuri and L. Gravano. Evaluating top-k selection queries. In VLDB, pages 397 -410, 1999.
9. R. Fagin, A. Lotem, and M. Naor. Optimal aggregation algorithms for middleware. In PODS, pages 102 -113, New York, NY, USA, 2001. ACM Press.
10. R. Fagin, A. Lotem, and M. Naor. Optimal aggregation algorithms for middleware. J. Comput. Syst. Sci., 66(4):614 -656, 2003.
11. U. Güntzer, W.-T. Balke, and W. Kießling. Optimizing multi-feature queries for image databases. In VLDB, pages 419 -428, 2000.
12. U. Güntzer, W.-T. Balke, and W. Kießling. Towards efficient multifeature queries in heterogeneous environments. In ITCC, pages 622 -628, 2001.
13. I. F. Ilyas, G. Beskales, and M. A. Soliman. A survey of top-k query processing techniques in relational database systems. In ACM Computing Surveys, 2008. http://www.cs.uwaterloo.ca/~ilyas/papers/ IlyasTopkSurvey.pdf.
14. A. Marian, N. Bruno, and L. Gravano. Evaluating top- queries over web-accessible databases. ACM Trans. Database Syst., 29(2):319 -362, 2004.
15. S. Nepal and M. V. Ramakrishna. Query processing issues in image (multimedia) databases. In ICDE, pages 22 -29, 1999.
16. P. Shisha and A. Zoltners. The multiple-choice knapsack problem. Oper Res., 27(3):503 -515, 1979.
17. M. Theobald, G. Weikum, and R. Schenkel. Top-k query evaluation with probabilistic guarantees. In VLDB, pages 648 -659, 2004.