Adaptive rank-aware query optimization in relational databases

ACM Transactions on Database Systems

Volumn 31, Issue 4, 2006, Pages 1257-1304

  Ilyas, Ihab F ^a   Aref, Walid G ^b   Elmagarmid, Ahmed K ^b   Elmongui, Hicham G ^b   Shah, Rahul ^b   Vitter, Jeffrey Scott ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b PURDUE UNIVERSITY   (United States)

Author keywords

Adaptive processing; Advanced query processing; Rank aware optimization; Ranking; Top k

Indexed keywords

OPTIMAL RANK AGGREGATION ALGORITHMS; PROBABILISTIC MODEL; QUERY OPTIMIZATION; QUERY PROCESSING ENGINES; RANK JOIN OPERATOR; REACTIVE REOPTIMIZATION TECHNIQUES;

ALGORITHMS; COST EFFECTIVENESS; INFORMATION TECHNOLOGY; MATHEMATICAL MODELS; OPTIMIZATION; RELATIONAL DATABASE SYSTEMS; SEMANTICS;

QUERY LANGUAGES;

EID: 33846192864     PISSN: 03625915     EISSN: 15574644     Source Type: Journal    
DOI: 10.1145/1189769.1189772     Document Type: Conference Paper

References (37)

1. AMSALEG, L., FRANKLIN, M. J., TOMASIC, A., AND URHAN, T. 1996. Scrambling query plans to cope with unexpected delays. Distrib. Parall. Datab. Syst. 208-219.
2. AVNUR, R. AND HELLERSTEIN, J. M. 2000. Eddies: Continuously adaptive query processing. In Proceedings of ACM SIGMOD International Conference on Management of Data. 261-272.
3. BRUNO, N. AND CHAUDHURI, S. 2002. Exploiting statistics on query expressions for optimization. In Proceedings of ACM SIGMOD International Conference on Management of Data. 263-274.
4. BRUNO, N., CHAUDHURI, S., AND GRAVANO, L. 2002. Top-k selection queries over relational databases: Mapping strategies and performance evaluation. ACM Trans. Datab. Sys. 27, 2, 369-380.
5. BRUNO, N., GRAVANO, L., AND MARIAN, A. 2002. Evaluating top-k queries over web-accessible databases. In Proceedings of the 18th International Conference on Data Engineering. 153-187.
6. CAREY, M. J. AND KOSSMANN, D. 1997. On saying "Enough already!" in SQL. In Proceedings of ACM SIGMOD International Conference on Management of Data. 219-230.
7. CAREY, M. J. AND KOSSMANN, D. 1998. Reducing the braking distance of an SQL query engine. In Proceedings of the 24th International Conference on Very Large Data Bases. 158-169.
8. CHAKRABARTI, K., ORTEGA-BINDERBERGER, M., MEHROTRA, S., AND PORKAEW, K. 2004. Evaluating refined queries in top-k retrieval systems. IEEE Trans. Knowl. Data Engin. 16, 2, 256-270.
9. CHANG, K. C.-C. AND HWANG, S.-W. 2002. Minimal probing: Supporting expensive predicates for top-k queries. In Proceedings of ACM SIGMOD International Conference on Management of Data. 346-357.
10. DESHPANDE, A. AND HELLERSTEIN, J. M. 2004. Lifting the burden of history from adaptive query processing. In Proceedings of the 30 International Conference on Very LargeData Bases. 948-959.
11. DONJERKOVIC, D. AND RAMAKRISHNAN, R. 1999. Probabilistic optimization of top N queries. In Proceedings of the 25th International Conference on Very Large Data Bases.
12. DWORK, C., KUMAR, S. R., NAOR, M., AND SIVAKUMAR, D. 2001. Rank aggregation methods for the web. In Proceedings of the 10th International World Wide Web Conference. 613-622.
13. FAGIN, R. 1999. Combining fuzzy information from multiple systems. J. Comput. Syst. Sci. 58, 1 (Feb.), 216-226.
14. FAGIN, R., LOTEM, A., AND NAOR, M. 2001. Optimal aggregation algorithms for middleware. In Proceedings of the 20th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. 102-113.
15. GRAEFE, G. AND DEWITT, D. J. 1987. The EXODUS optimizer generator. In Proceedings of ACM SIGMOD International Conference on Management of Data.
16. GRAEFE, G. AND MCKENNA, W. J. 1993. The volcano optimizer generator: Extensibility and efficient search. In Proceedings of the 9th International Conference on Data Engineering. 209-218.
17. GÜNTZER, U., BALKE, W.-T., AND KIEßLING, W. 2000. Optimizing multi-feature queries for image databases. In Proceedings of the 26th International Conference on Very Large Data Bases. 419-428.
18. GÜNTZER, U., BALKE, W.-T., AND KIEßLING, W. 2001. Towards efficient multi-feature queries in heterogeneous environments. In International Symposium on Information Technology (ITCC). 622-628.
19. HAAS, P. J. AND HELLERSTEIN, J. M. 1999. Ripple joins for online aggregation. In Proceedings of ACM SIGMOD International Conference on Management of Data. 287-298.
20. HONG, W. AND STONEBRAKER, M. 1993. Optimization of parallel query execution plans in XPRS. Distribut. Parall. Datab. Syst. 1, 1 (Jan.), 9-32.
21. HRISTIDIS, V., GRAVANO, L., AND P APAKONSTANTINOU, Y. 2003. Efficient IR-style keyword search over relational databases. In Proceedings of the 29th International Conference on Very Large Data Bases.
22. ILYAS, I. F., AREF, W. G., AND ELMAGARMID, A. K. 2002. Joining ranked inputs in practice. In Proceedings of the 28th International Conference on Very Large Data Bases. 950-961.
23. ILYAS, I. F., AREF, W. G., AND ELMAGARMID, A. K. 2003. Supporting top-k join queries in relational databases. In Proceedings of the 29th International Conference on Very Large Data Bases. 754-765.
24. ILYAS, I. F., AREF, W. G., AND ELMAGARMID, A. K. 2004. Supporting top-k join queries in relational databases. VLDB J. 13, 3, 207-221.
25. ILYAS, I. F., SHAH, R., AREF, W. G., VITTER, J. S., AND ELMAGARMID, A. K. 2004. Rank-aware query optimization. In Proceedings of ACM SIGMOD International Conference on Management of Data. 203-214.
26. KABRA, N. AND DEWITT, D. J. 1998. Efficient mid-query re-optimization of suboptimal query execution plans. In Proceedings of ACM SIGMOD International Conference on Management of Data. 106-117.
27. LI, C., CHANG, K. C.-C., ILYAS, I. F., AND SONG, S. 2005. Query algebra and optimization for relational top-k queries. In Proceedings of ACM SIGMOD International Conference on Management of Data.
28. LOHMAN, G. M. 1988. Grammar-like functional rules for representing query optimization alternatives. In Proceedings of ACM SIGMOD International Conference on Management of Data.
29. MARKL, V., RAMAN, V., SIMMEN, D. E., LOHMAN, G. M., AND PIRAHESH, H. 2004. Robust query processing through progressive optimization. In Proceedings of ACM SIGMOD International Conference on Management of Data. 659-670.
30. 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 27th International Conference on Very Large Data Bases. 281-290.
31. NEPAL, S. AND RAMAKRISHNA, M. V. 1999. Query processing issues in image (multimedia) databases. In Proceedings of the 15th International Conference on Data Engineering. 22-29.
32. RAMAN, V., DESHPANDE, A., AND HELLERSTEIN, J. M. 2003. Using state modules for adaptive query processing. In Proceedings of the 19th International Conference on Data Engineering. 353-387.
33. SELINGER, P. G., ASTRAHAN, M. M., CHAMBERLIN, D. D., LORIE, R. A., AND PRICE, T. G. 1979. Access path selection in a relational database management system. In Proceedings of ACM SIGMOD International Conference on Management of Data.
34. STILLGER, M., LOHMAN, G. M., MARKL, V., AND KANDIL, M. 2001. LEO - DB2's learning optimizer. In Proceedings of the 27th International Conference on Very Large Data Bases. 19-28.
35. URHAN, T., FRANKLIN, M. J., AND AMSALEG, L. 1998. Cost-based query scrambling for initial delays. In Proceedings of ACM SIGMOD International Conference on Management of Data. 130-141.
36. WILSCHUT, A. N. AND APERS, P. M. G. 1993. Dataflow query execution in a parallel main-memory environment. Distribut. Parall. Datab. Syst. 1, 1, 68-77.
37. ZHU, Y., RUNDENSTEINER, E. A., AND HEINEMAN, G. T. 2004. Dynamic plan migration for continuous queries over data streams. In Proceedings of ACM SIGMOD International Conference on Management of Data.