Object query computing optimization in the dynamic information model DIM
Modelirovanie i analiz informacionnyh sistem, Tome 18 (2011) no. 2, pp. 39-51
Cet article a éte moissonné depuis la source Math-Net.Ru
The problem of algorithm for organization of the object queries execution [1] for a new object DBMS technology DIM [2] is considered such that the computational complexity of the queries execution is as little as possible. Solutions of this problem may be taken as a basis for the development of a query compiler.
Keywords:
object DBMS, query language, query computational complexity, optimization of computational complexity.
@article{MAIS_2011_18_2_a2,
author = {V. S. Rublev},
title = {Object query computing optimization in the dynamic information model {DIM}},
journal = {Modelirovanie i analiz informacionnyh sistem},
pages = {39--51},
year = {2011},
volume = {18},
number = {2},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/MAIS_2011_18_2_a2/}
}
V. S. Rublev. Object query computing optimization in the dynamic information model DIM. Modelirovanie i analiz informacionnyh sistem, Tome 18 (2011) no. 2, pp. 39-51. http://geodesic.mathdoc.fr/item/MAIS_2011_18_2_a2/
[1] V. S. Rublev, “Yazyk ob'ektnykh zaprosov dinamicheskoi informatsionnoi modeli DIM”, Modelirovanie i analiz informatsionnykh sistem, 17:3 (2010), 144–161
[2] D. S. Pisarenko, V. S. Rublev, “Ob'ektnaya SUBD Dinamicheskaya informatsionnaya model DIM i ee osnovnye kontseptsii”, Modelirovanie i analiz informatsionnykh sistem, 16:1 (2009), 62–91
[3] V. S. Rublev, “Zaprosnaya polnota yazyka ODQL dinamicheskoi informatsionnoi modeli DIM”, Yaroslavskii pedagogicheskii vestnik. Seriya «Fiziko-matematicheskie i estestvennye nauki», Tom III (Estestvennye nauki), no. 1, Yaroslavl, 2011, 68–75
[4] M. Jarke, J. Koch, “Query Optimization in Database Systems”, Computing Surveys, 16:2, June (1984) | DOI | MR | Zbl