10-Top-k: Index-access optimized top-k query processing

VLDB 2006 - Proceedings of the 32nd International Conference on Very Large Data Bases

Volumn , Issue , 2006, Pages 475-486

  Bast, Holger ^a   Majumdar, Debapriyo ^a   Schenkel, Ralf ^a   Theobald, Martin ^a   Weikum, Gerhard ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DATA INTEGRATION; INFORMATION RETRIEVAL; QUERY PROCESSING;

BUILDING BLOCKES; CONDITION; LOG DATA; RANDOM ACCESS; RANKED RETRIEVAL; SENSORS DATA; SEQUENTIAL ACCESS; THRESHOLD ALGORITHMS; TOP-K QUERY; TOP-K QUERY PROCESSING;

SCHEDULING;

EID: 84893849762     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (30)

1. S. Agrawal et al. Automated ranking of database query results. CIDR, 2003.
2. R. Avnur, J. M. Hellerstein. Eddies: Continuously adaptive query processing. SIGMOD 2000, pages 261-272, 2000.
3. W.-T. Balke, U. Giintzer, J. X. Zheng. Efficient distributed skylining for web information systems. EDBT 2004, pages 256-273, 2004.
4. H. Bast et al. IO-Top-k: Index-access optimized top-k query processing. Techn. Rep. MPI-I-2006-5-002, MPI Informatik, 2006. http://domino.mpi-sb.mpg.de/ internet/reports.nsf/NumberView/2006-5-002/.
5. N. Bruno, L. Gravano, A. Marian. Evaluating top-k queries over web-accessible databases. ICDE 2002, pages 369-380, 2002.
6. C. Buckley, G. Salton, J. Allan. The effect of adding relevance information in a relevance feedback environment. SIGIR 1994, pages 292-300, 1994.
7. P. Cao, Z. Wang. Efficient top-k query calculation in distributed networks. PODC 2004, pages 206-215, 2004.
8. M. J. Carey, D. Kossmann. On saying "enough already!," in SQL. SIGMOD 1997, pages 219-230, 1997.
9. K. C.-C. Chang, S.-W. Hwang. Minimal probing: supporting expensive predicates for top-k queries. SIGMOD 2002, pages 346-357, 2002.
10. S. Chaudhuri, L. Gravano, A. Marian. Optimizing top-k selection queries over multimedia repositories. IEEE TKDE, 16(8):992-1009, 2004.
11. R. Fagin. Combining fuzzy information: an overview. SIGMOD Record, 31(2):109-118, 2002.
12. R. Fagin, A. Lotem, M. Naor. Optimal aggregation algorithms for middleware. JCSS, 66(4):614-656, 2003.
13. D. A. Grossmann, O. Frieder. Information Retrieval. Springer, 2005.
14. U. Giintzer, W.-T. Balke, W. Kießling. Towards efficient multi-feature queries in heterogeneous environments. ITCC 2001, pages 622-628, 2001.
15. I. F. Ilyas, W. G. Aref, A. K. Elmagarmid. Supporting top-k join queries in relational databases. VLDB J-, 13(3):207-221, 2004.
16. I. F. Ilyas et al. Rank-aware query optimization. SIGMOD 2004, pages 203-214, 2004.
17. Y. E. Ioannidis. The history of histograms (abridged). VLDB 2003, pages 19-30, 2003.
18. R. Kaushik et al. On the integration of structure indexes and inverted lists. SIGMOD 2004, pages 779-790, 2004.
19. N. Lester et al. Space-limited ranked query evaluation using adaptive pruning. WISE 2005, pages 470-477, 2005.
20. C. Li et al. RankSQL: Query algebra and optimization for relational top-k queries. SIGMOD 2005, pages 131-142, 2005.
21. X. Long, T. Suel. Optimized query execution in large search engines with global page ordering. VLDB 2003, pages 129-140, 2003.
22. A. Marian, N. Bruno, L. Gravano. Evaluating top-k queries over web-accessible databases. ACM TODS, 29(2):319-362, 2004.
23. A. Marian et al. Adaptive processing of top-k queries in XML. ICDE 2005, pages 162-173, 2005.
24. A. Moffat, J. Zobel. Self-indexing inverted files for fast text retrieval. ACM TOIS, 14(4):349-379, 1996.
25. S. Nepal, M. V. Ramakrishna. Query processing issues in image (multimedia) databases. ICDE 1999, pages 22-29, 1999.
26. M. Persin, J. Zobel, R. Sacks-Davis. Filtered document retrieval with frequency-sorted indexes. JASIS, 47(10):749-764, 1996.
27. W. H. Press et al. Numerical Recipes in C. Cambridge University Press, 1992.
28. M. Theobald, R. Schenkel, G. Weikum. An efficient and versatile query engine for TopX search. VLDB 2005, pages 625-636, 2005.
29. M. Theobald, G. Weikum, R. Schenkel. Top-k query evaluation with probabilistic guarantees. VLDB 2004, pages 648-659, 2004.
30. H. Yu et al. Efficient processing of distributed top-k queries. DEXA 2005, pages 65-74, 2005.