Abstract
Based on the assumption that selections are zero-expense operations, “selection pushdown” rules, which apply selections in random order before as many joins as possible in order to reduce subsequent join costs, have been widely applied in traditional query optimization methods. However, in multimedia information systems, selections generally contain expensive multimedia operations, making “pushdown” rules no longer able to produce optimal query execution plan. Therefore, we in this paper develop a theory for optimizing queries with expensive multimedia operations, which can establish the optimal placement of each multimedia operation in a query plan by the comprehensive consideration of selectivity and unit execution cost of each operation. Then we present an algorithm for the theory and implement it in a prototype system. Experimental results show that, compared with traditional optimization algorithms, our algorithm not only has the modest time complexity that is polynomial in the number of multimedia operations in a query plan, but also can reduce the execution cost of a query plan by orders of magnitude.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Cao ZS, Wu ZD, Wang YZ (2007). UMQL: A Unified Multimedia Query Language. In Proc. of the 3rd IEEE International Conf. on Signal Image Technology and Internet Based Systems, Shanghai, China, pp 101–107
Cao ZS, Wu ZD, Wang YZ (2008) A grammar analysis model for the unified multimedia query language. J Electron Sci Technol China 6(3):87–93
Cao ZS, Wu ZD, Wang YZ (2009) UMQA: an internal algebra for querying multimedia contents. IT J 8(4):411–426
Chaudhuri S, Shim K (1999) Optimization of queries with user-defined predicates. ACM Trans Database Syst 24(2):177–228
Chimenti D, Gamboa R, Krishnamrthy R (1989) Towards an open architecture for LDL. In Proc. of the 5th International Conf. on Very Large Data Bases, Amsterdam, pp 195–203
Haas PJ, Naughton JF, Seshadri S, Stokes L (1995) Sampling-based estimation of the number of distinct values of an attribute. In Proc. of the 21st International Conference on Very Large Data Bases, Zurich
Hellerstein JM (1994) Practical predicate placement. In Proc. of ACM SIGMOD International Conf. on Management of Data, Minneapolis, USA, pp 325–335
Hellerstein JM (1998) Optimization techniques for queries with expensive methods. ACM Trans Database Syst 23(2):113–157
Hellerstein JM, Stonebraker M (1993) Predicate migration: optimizing queries with expensive predicates. In Proc. of ACM SIGMOD International Conf. on Management of Data, Washington, USA, 1993, pp 267–276
Hou W-C, Ozsoyoglu G, Taneja BK (1988) Statistical estimators for relational algebra expressions. In Proc. of 7th ACIU SIGACT-SIGIUOD-SIGART Symposium on Principles of Database Systems, Austin, pp 276–287
Huang DW (2008). Study on query analysis for a multimedia query language UMQL. M. S. thesis, College of Computer Science and Technology, Huazhong University of Science and Technology
Kemper A, Moerkotte G, Peithner K, Steinbrunn M (1994) Optimizing disjunctive queries with expensive predicates. In Proc. of ACM SIGMOD International Conf. on Management of Data, Minneapolis, USA, pp 336–348
Lazaridis L, Mehrotra S (2007) Optimization of multi version expensive predicates. In Proc. of ACM SIGMOD International Conf. on Management of Data, Beijing, China, pp 797–809
Monma CL, Sidney J (1979) Sequencing with series-parallel precedence constraints. Math Oper Res, ch. 4, pp 215–224
Ravi K, Haran B, Carlo Z (1986) Optimization of non-recursive queries. In Proc. of the 12th International Conf. on Very Large Data Base, Kyoto, August, pp 128–137
Selinger PG, Astrahan MM, Chamberlin DD, Lorie RA, Price TG (1979) Access path selection in a relational database management system. In Proc. of ACM SIGMOD International Conf. on Management of Data, Boston, USA, pp 23–34
Smith WE (1956) Various optimizers for single stage production. In: Naval Res Logist Quart, ch. 3, pp 59–66
Stonebraker M (1991) Managing persistent objects in a multi-level store. In Proc. of ACM SIGMOD International Conf. on Management of Data, Denver, USA, pp 2–11
Swami AN, Iyer BR (1993) A polynomial time algorithm for optimizing join queries. In Proc. of the Ninth International Conf. on Data Engineering, 1993. Vienna, Australia, pp 345–354
Wu ZD, Cao ZS, Wang YZ (2008) Design and Implementation of a visual multimedia query language. J Huazhong Univ Sci Technol 36(7):45–56
Yajima K, Kitagawa H, Yamaguchi K, Ohbo N, Fujiwara Y (1991) Optimization of queries including ADT functions. In Proc. of the second International Symposium on Database Systems for Advanced Applications, Tokyo, pp 366–373
Yang GG, Wu QY (2001) A new optimization algorithm for queries with expensive selections. Acta Electron Sinica 29(2):181–186
Acknowledgement
This research is supported in part by the National High-Tech Research and Development Plan of China under Grant Nos. 2006AA01Z430. We thank Wu-Jie Su for his careful revision of this paper, and also thank anonymous reviewers for their useful suggestions.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Wu, Z., Cao, Z. & Wang, Y. Multimedia selection operation placement. Multimed Tools Appl 54, 69–96 (2011). https://doi.org/10.1007/s11042-010-0528-9
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11042-010-0528-9