sibsutisВестник СибГУТИThe Herald of the Siberian State University of Telecommunications and Information Science1998-6920СибГУТИsibsutis-245Research ArticleСтатьиАлгоритм использования кэша запросов к реляционной базе данныхCache usage algorithm for RDB queriesМосинС. В.MosinS. ..svmosin@gmail.ruИМ СО РАНRussian Federation201724102022014757Copyright © Мосин С.В., 20222022Мосин С.В.Mosin S...Данная работа распространяется под лицензией Creative Commons Attribution 4.0.This work is licensed under a Creative Commons Attribution 4.0 License.https://vestnik.sibsutis.ru/jour/article/view/245

В данной статье предлагается подход для кэширования запросов к реляционной базе данных, основанный на анализе логических формул запросов, и представлен алгоритм, определяющий для заданного запроса, может ли он быть выполнен с использованием кэша. В случае если данных не хватает, они могут быть получены с сервера. При этом реализована проверка того, не превосходит ли объем недостающих данных объема запроса, так как в таком случае использовать кэш нецелесообразно. Упомянутая проверка основывается на использовании результатов по оценке мощности операции естественного соединения. В данной работе получена улучшенная оценка для естественных соединений с логическими ограничениями.

This paper considers the approach for caching RDB queries based on the query logical conditions. An algorithm defining whether or not this query can be performed using cache is also presented. If any data is missed it can be retrieved from the server. The data size to be requested is estimated and compared with the one required for straight query execution because if the first is greater than the latter cache usage is not worthwhile. Improved estimation for joint operations with logical constraints is also proposed in this paper and is used for checking mentioned before.

реляционная база данныхкэшобласть истинностиdatabasecachequeryReferencesP. Griffiths Selinger, M. M. Astrahan, D. D. Chamberlin et al. Access Path Selection in a Relational Database Management System // Proceedings of the 1979 ACM SIGMOD International Conference on Management of Data. SIGMOD '79. New York, NY, USA : ACM, 1979. P. 23-34.P. Griffiths Selinger, M. M. Astrahan, D. D. Chamberlin et al. Access Path Selection in a Relational Database Management System // Proceedings of the 1979 ACM SIGMOD International Conference on Management of Data. SIGMOD '79. New York, NY, USA : ACM, 1979. P. 23-34.Afrati Foto N., Li Chen, Mitra Prasenjit. Rewriting queries using views in the presence of arithmetic comparisons // Theor. Comput. Sci. 2006. Vol. 368, № 1-2. P. 88-123.Afrati Foto N., Li Chen, Mitra Prasenjit. Rewriting queries using views in the presence of arithmetic comparisons // Theor. Comput. Sci. 2006. Vol. 368, № 1-2. P. 88-123.Baralis Elena, Paraboschi Stefano, Teniente Ernest. Materialized Views Selection in a Multidimensional Database // Proceedings of the 23rd International Conference on Very Large Data Bases. VLDB '97. San Francisco, CA, USA : Morgan Kaufmann Publishers Inc., 1997. P. 156-165.Baralis Elena, Paraboschi Stefano, Teniente Ernest. Materialized Views Selection in a Multidimensional Database // Proceedings of the 23rd International Conference on Very Large Data Bases. VLDB '97. San Francisco, CA, USA : Morgan Kaufmann Publishers Inc., 1997. P. 156-165.Bell David A, McClean Sally. Pragmatic estimation of join sizes and attribute correlations // Data Engineering, 1989. Proceedings. Fifth International Conference on / IEEE. 1989. P. 76-84.Bell David A, McClean Sally. Pragmatic estimation of join sizes and attribute correlations // Data Engineering, 1989. Proceedings. Fifth International Conference on / IEEE. 1989. P. 76-84.Chao Tian-Jy, Egyhazy Csaba /.Estimating Temporary Files Sizes in Distributed Relational Database Systems // Proceedings of the Second International Conference on Data Engineering. Washington, DC, USA : IEEE Computer Society, 1986. P. 4-12.Chao Tian-Jy, Egyhazy Csaba /.Estimating Temporary Files Sizes in Distributed Relational Database Systems // Proceedings of the Second International Conference on Data Engineering. Washington, DC, USA : IEEE Computer Society, 1986. P. 4-12.Christodoulakis Stavros Estimating Block Transfers and Join Sizes // Proceedings of the 1983 ACM SIGMOD International Conference on Management of Data. SIGMOD '83. New York, NY, USA : ACM, 1983. P. 40-54.Christodoulakis Stavros Estimating Block Transfers and Join Sizes // Proceedings of the 1983 ACM SIGMOD International Conference on Management of Data. SIGMOD '83. New York, NY, USA : ACM, 1983. P. 40-54.Denny Matthew, Franklin Michael /.Predicate Result Range Caching for Continuous Queries // Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data. SIGMOD '05. New York, NY, USA : ACM, 2005. P. 646-657.Denny Matthew, Franklin Michael /.Predicate Result Range Caching for Continuous Queries // Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data. SIGMOD '05. New York, NY, USA : ACM, 2005. P. 646-657.Epstein Robert S., Stonebraker Michael. Analysis of Distributed Data Base Processing Strategies // Proceedings of the Sixth International Conference on Very Large Data Bases. VLDB '80. VLDB Endowment, 1980. Vol. 6. P. 92-101.Epstein Robert S., Stonebraker Michael. Analysis of Distributed Data Base Processing Strategies // Proceedings of the Sixth International Conference on Very Large Data Bases. VLDB '80. VLDB Endowment, 1980. Vol. 6. P. 92-101.Gupta Himanshu. Selection of Views to Materialize in a Data Warehouse // Proceedings of the 6th International Conference on Database Theory. ICDT '97. London, UK, UK : SpringerVerlag, 1997. P. 98-112.Gupta Himanshu. Selection of Views to Materialize in a Data Warehouse // Proceedings of the 6th International Conference on Database Theory. ICDT '97. London, UK, UK : SpringerVerlag, 1997. P. 98-112.Gupta Himanshu, Mumick Inderpal Singh. Selection of Views to Materialize Under a Maintenance Cost Constraint // Proceedings of the 7th International Conference on Database Theory. ICDT '99. London, UK, UK : Springer-Verlag, 1999. P. 453-470.Gupta Himanshu, Mumick Inderpal Singh. Selection of Views to Materialize Under a Maintenance Cost Constraint // Proceedings of the 7th International Conference on Database Theory. ICDT '99. London, UK, UK : Springer-Verlag, 1999. P. 453-470.David Vengerov, Andre Cavalheiro Menck, Mohamed Zait, Sunil P. Chakkappen. Join Size Estimation Subject to Filter Conditions // Proc. VLDB Endow. 2015. Vol. 8, № 12. P. 15301541.David Vengerov, Andre Cavalheiro Menck, Mohamed Zait, Sunil P. Chakkappen. Join Size Estimation Subject to Filter Conditions // Proc. VLDB Endow. 2015. Vol. 8, № 12. P. 15301541.Kalnis Panos, Papadias Dimitris. Proxy-Server Architectures for OLAP // SIGMOD Conference / Ed. by Sharad Mehrotra, Timos K. Sellis. ACM, 2001. P. 367-378.Kalnis Panos, Papadias Dimitris. Proxy-Server Architectures for OLAP // SIGMOD Conference / Ed. by Sharad Mehrotra, Timos K. Sellis. ACM, 2001. P. 367-378.Keller Arthur M., Basu Julie. A Predicate-based Caching Scheme for Client-Server Database Architectures // VLDB J. 1996. Vol. 5, № 1. P. 35-47.Keller Arthur M., Basu Julie. A Predicate-based Caching Scheme for Client-Server Database Architectures // VLDB J. 1996. Vol. 5, № 1. P. 35-47.Mosin Sergey, Zykin Sergey. Truth space method for caching database queries // Modeling and Analysis of Information Systems. 2015. Vol. 22, № 2. P. 248-258.Mosin Sergey, Zykin Sergey. Truth space method for caching database queries // Modeling and Analysis of Information Systems. 2015. Vol. 22, № 2. P. 248-258.Olston Chris, Jiang Jing, Widom Jennifer. Adaptive Filters for Continuous Queries over Distributed Data Streams // Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data. SIGMOD ’03. New York, NY, USA : ACM, 2003. P. 563-574.Olston Chris, Jiang Jing, Widom Jennifer. Adaptive Filters for Continuous Queries over Distributed Data Streams // Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data. SIGMOD ’03. New York, NY, USA : ACM, 2003. P. 563-574.Park Chang-Sup, Kim Myoung-Ho, Lee Yoon-Joon. Usability-based caching of query results in OLAP systems. // Journal of Systems and Software. 2003. Vol. 68, № 2. P. 103-119.Park Chang-Sup, Kim Myoung-Ho, Lee Yoon-Joon. Usability-based caching of query results in OLAP systems. // Journal of Systems and Software. 2003. Vol. 68, № 2. P. 103-119.Scheuermann Peter, Shim Junho, Vingralek Radek. WATCHMAN: A Data Warehouse Intelligent Cache Manager // Proceedings of the 22th International Conference on Very Large Data Bases. VLDB ’96. San Francisco, CA, USA : Morgan Kaufmann Publishers Inc., 1996. P. 51-62.Scheuermann Peter, Shim Junho, Vingralek Radek. WATCHMAN: A Data Warehouse Intelligent Cache Manager // Proceedings of the 22th International Conference on Very Large Data Bases. VLDB ’96. San Francisco, CA, USA : Morgan Kaufmann Publishers Inc., 1996. P. 51-62.Shim Junho, Scheuermann Peter, Vingralek Radek. Dynamic Caching of Query Results for Decision Support Systems // SSDBM. 1999. P. 254-263.Shim Junho, Scheuermann Peter, Vingralek Radek. Dynamic Caching of Query Results for Decision Support Systems // SSDBM. 1999. P. 254-263.Зыкин Сергеи Владимирович. Разработка и исследование моделей даннык и средств организации взаимодействия пользователей с информационными ресурсами : Дисс.. доктора наук : 06.12.05. ИМ СО РАН им. С. Л. Соболева. Новосибирск, 2005. 245 с.Зыкин Сергеи Владимирович. Разработка и исследование моделей даннык и средств организации взаимодействия пользователей с информационными ресурсами : Дисс.. доктора наук : 06.12.05. ИМ СО РАН им. С. Л. Соболева. Новосибирск, 2005. 245 с.

The authors declare that there are no conflicts of interest present.