Geodesic
Truth space comparison of relational database queries
Vestnik Ûžno-Uralʹskogo gosudarstvennogo universiteta. Seriâ Vyčislitelʹnaâ matematika i informatika, Tome 5 (2016) no. 1, pp. 85-99 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

We propose new methods and algorithms of analytical truth space comparison for Relational Database queries. Such a comparison aims to define the possibility of partial or full cache usage. The cache is stored on user's computer and Database server is supposed to be remote. In case user query's result is contained in cache we can simply take the data from there avoiding any server requests. The suggested method may also be used for defining data missing in cache and performing query to only receive that data. Analytical computations are also used to achieve this and it differs our approach from existing ones. Query comparison algorithms are based on the Predicate Logic theory. Formulas are presented by logical constraints in SQL and predicates correspond to SQL operations.
Keywords: relational database, truth space.
Mots-clés : cache 
@article{VYURV_2016_5_1_a7,
     author = {S. V. Mosin},
     title = {Truth space comparison of relational database queries},
     journal = {Vestnik \^U\v{z}no-Uralʹskogo gosudarstvennogo universiteta. Seri\^a Vy\v{c}islitelʹna\^a matematika i informatika},
     pages = {85--99},
     year = {2016},
     volume = {5},
     number = {1},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VYURV_2016_5_1_a7/}
}
TY  - JOUR
AU  - S. V. Mosin
TI  - Truth space comparison of relational database queries
JO  - Vestnik Ûžno-Uralʹskogo gosudarstvennogo universiteta. Seriâ Vyčislitelʹnaâ matematika i informatika
PY  - 2016
SP  - 85
EP  - 99
VL  - 5
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/VYURV_2016_5_1_a7/
LA  - ru
ID  - VYURV_2016_5_1_a7
ER  - 
%0 Journal Article
%A S. V. Mosin
%T Truth space comparison of relational database queries
%J Vestnik Ûžno-Uralʹskogo gosudarstvennogo universiteta. Seriâ Vyčislitelʹnaâ matematika i informatika
%D 2016
%P 85-99
%V 5
%N 1
%U http://geodesic.mathdoc.fr/item/VYURV_2016_5_1_a7/
%G ru
%F VYURV_2016_5_1_a7
S. V. Mosin. Truth space comparison of relational database queries. Vestnik Ûžno-Uralʹskogo gosudarstvennogo universiteta. Seriâ Vyčislitelʹnaâ matematika i informatika, Tome 5 (2016) no. 1, pp. 85-99. http://geodesic.mathdoc.fr/item/VYURV_2016_5_1_a7/

[1] Afrati F.N., Li C., Mitra P., “Rewriting Queries Using Views in the Presence of Arithmetic Comparisons”, Theor. Comput. Sci., 368:1-2 (2006), 88–123 | DOI

[2] E. Baralis, S. Paraboschi, E. Teniente, “Materialized Views Selection in a Multidimensional Database”, Proceedings of the 23rd International Conference on Very Large Data Bases. VLDB '97., Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 1997, 156–165

[3] A. Church, Introduction to Mathematical Logic, Princeton University Press, 1996, 378 pp.

[4] C.J. Date, SQL and Relational Theory, O'Reilly, 2009, 448 pp.

[5] M. Denny, M.J. Franklin, “Predicate Result Range Caching for Continuous Queries”, Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data. SIGMOD'05, ACM, New York, NY, USA, 2005, 646–657 | DOI

[6] H. Gupta, “Selection of Views to Materialize in a Data Warehouse”, Proceedings of the 6th International Conference on Database Theory. ICDT '97, Springer-Verlag, London, UK, UK, 1997, 98–112

[7] H. Gupta, I.S. Mumick, “Selection of Views to Materialize Under a Maintenance Cost Constraint”, Proceedings of the 7th International Conference on Database Theory. ICDT '99, Springer-Verlag, London, UK, UK, 1999, 453–470

[8] D. Hilbert, W. Ackermann, Principles of Mathematical Logic, AMS Chelsea Publishing, 1950, 172 pp.

[9] P. Kalnis, D. Papadias, “Proxy-Server Architectures for OLAP”, SIGMOD Conference, eds. Sharad Mehrotra, Timos K. Sellis, ACM, 2001, 367–378 | DOI

[10] A.M. Keller, J. Basu, “A Predicate-based Caching Scheme for Client-Server Database Architectures”, VLDB J, 5:1 (1996), 35–47

[11] E. Mendelson, Introduction to Mathematical Logic, 5 edition, CRC Press, 2009, 469 pp.

[12] S. Mosin, S. Zykin, “Truth Space Method for Caching Database Queries”, Modeling and Analysis of Information Systems, 22:2 (2015), 248–258

[13] C. Olston, J. Jiang, J. Widom, “Adaptive Filters for Continuous Queries Over Distributed Data Streams”, Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data. SIGMOD '03, ACM, New York, NY, USA, 2015, 563–574 | DOI

[14] C. Park, M. Kim, Y. Lee, “Usability-Based Caching of Query Results in OLAP Systems”, Journal of Systems and Software, 68:2 (2015), 103–119 | DOI

[15] P. Scheuermann, J. Shim, R. Vingralek, “WATCHMAN: A Data Warehouse Intelligent Cache Manager”, Proceedings of the 22th International Conference on Very Large Data Bases. VLDB '96, Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 1996, 51–62

[16] J. Shim, P. Scheuermann, R. Vingralek, “Dynamic Caching of Query Results for Decision Support Systems”, Proceedings of 11th International Conference on Scientific and Statistical Database Management (SSDBM), 1999, 254–263