kaz29Вестник Казахстанско-Британского технического университетаHerald of the Kazakh-British Technical University1998-66882959-8109Казахстанско-Британский Технический Университет10.55452/1998-6688-2021-18-2-73-78kaz29-87Research ArticleФИЗИКО-МАТЕМАТИЧЕСКИЕ И ТЕХНИЧЕСКИЕ НАУКИPHYSICAL, MATHEMATICAL AND TECHNICAL SCIENCESО ЗАПРОСАХ БАЗ ДАННЫХ НАД ПОЧТИ ОМЕГА-КАТЕГОРИЧНОЙ УПОРЯДОЧЕННОЙ ОБЛАСТЬЮON DATABASE QUERIES OVER ALMOST OMEGA-CATEGORICAL ORDERED DOMAINhttps://orcid.org/0000-0002-4242-0463КулпешовБ. Ш.KulpeshovB. Sh.

050000, Алматы

Kulpeshov Beibut Shayikovich - Doctor of Physical and Mathematical Sciences, Professor

050000, Almaty

b.kulpeshov@kbtu.kzhttps://orcid.org/0000-0001-9916-4168MустафинТ. С.MustafinT. S.

050000, Алматы

Mustafin Timur Salymovich – Lecturer, Kazakh-British Technical University

050000, Almaty

t.mustafin@kbtu.kzКазахстанско-Британский технический университетКазахстанKazakh-British technical universityKazakhstan2021041120211827378Copyright © Кулпешов Б.Ш., Mустафин Т.С., 20212021Кулпешов Б.Ш., Mустафин Т.С.Kulpeshov B.S., Mustafin T.S.Данная работа распространяется под лицензией Creative Commons Attribution 4.0.This work is licensed under a Creative Commons Attribution 4.0 License.https://vestnik.kbtu.edu.kz/jour/article/view/87

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

We consider relational databases organized over an ordered domain with some additional relations – a typical example is the ordered domain of rational numbers together with the operation of addition. In the focus of our study are the first-order (FO) queries that are invariant under order-preserving permutations – such queries are called order-generic. It was discovered that for some domains order-generic FO queries fail to express more than pure order queries. Here we prove the collapse result theorem over an almost omegacategorical weakly o-minimal domain having convexity rank 1.

упорядоченная структураслабая о-минимальностьсостояние базы данныхзапрос баз данныхпочти омега-категоричностьранг выпуклостиordered structureweak o-minimalitydatabase statedatabase queryalmost omega-categoricityconvexity rankДанные исследования поддержаны Комитетом науки Министерства образования и науки Республики Казахстан (Грант AP08855544).ReferencesE.F. Codd. A relational model for large shared data banks // Communications ACM. – 1970. Vol. 13. – No. 6. - P. 377-387.E.F. Codd. A relational model for large shared data banks // Communications ACM. – 1970. Vol. 13. – No. 6. - P. 377-387.E.F. Codd. Relational completeness of database sublanguages // Database systems. – PrenticeHall. – 1972. – P. 33-64.E.F. Codd. Relational completeness of database sublanguages // Database systems. – PrenticeHall. – 1972. – P. 33-64.M. Benedikt, G. Dong, L. Libkin, L. Wong. Relational expressive power of constraint query languages // Journal of ACM. – 1998. – Vol. 45. – No. 1. – P. 1-34.M. Benedikt, G. Dong, L. Libkin, L. Wong. Relational expressive power of constraint query languages // Journal of ACM. – 1998. – Vol. 45. – No. 1. – P. 1-34.O.V. Belegradek, A.P. Stolboushkin, and M.A. Taitslin. Extended order-generic queries // Annals of Pure and Applied Logic. – 1999. – Vol. 97. – P. 85-125.O.V. Belegradek, A.P. Stolboushkin, and M.A. Taitslin. Extended order-generic queries // Annals of Pure and Applied Logic. – 1999. – Vol. 97. – P. 85-125.M.A. Taitslin. A general condition for collapse results // Annals of Pure and Applied Logic. 2002. – Vol. 113. – No. 1-3. – P. 323-330.M.A. Taitslin. A general condition for collapse results // Annals of Pure and Applied Logic. 2002. – Vol. 113. – No. 1-3. – P. 323-330.С.М. Дудаков, М.А. Тайцлин. Трансляционные результаты для языков запросов в теории баз данных // Успехи математических наук. – 2006. – Т. 61. – № 2. – С. 3-66.С.М. Дудаков, М.А. Тайцлин. Трансляционные результаты для языков запросов в теории баз данных // Успехи математических наук. – 2006. – Т. 61. – № 2. – С. 3-66.B.Sh. Kulpeshov. On Problem of Expressiveness of Database Queries // International Journal of Mathematics, Computer Sciences and Information Technology. – 2010. – Vol. 3. – No. 2. – P. 123-128.B.Sh. Kulpeshov. On Problem of Expressiveness of Database Queries // International Journal of Mathematics, Computer Sciences and Information Technology. – 2010. – Vol. 3. – No. 2. – P. 123-128.B.Sh. Kulpeshov. To Reducibility of Database Queries over an Ordered Domain // Computer Modelling and New Technologies. – 2012. – Vol. 16. – No. 2. – P. 34-39.B.Sh. Kulpeshov. To Reducibility of Database Queries over an Ordered Domain // Computer Modelling and New Technologies. – 2012. – Vol. 16. – No. 2. – P. 34-39.B.Sh. Kulpeshov. On Reducibility of database queries over a circularly minimal domain // Advances in Computational Sciences and Technology. – 2013. – Vol. 6. – No. 1. – P. 25-33.B.Sh. Kulpeshov. On Reducibility of database queries over a circularly minimal domain // Advances in Computational Sciences and Technology. – 2013. – Vol. 6. – No. 1. – P. 25-33.B.S. Baizhanov, B.Sh. Kulpeshov. On the Isolation Property over a Database Domain // Journal of Mathematics and System Science. – 2013. – Vol. 3. – No. 2. – P. 96-100.B.S. Baizhanov, B.Sh. Kulpeshov. On the Isolation Property over a Database Domain // Journal of Mathematics and System Science. – 2013. – Vol. 3. – No. 2. – P. 96-100.H.D. Macpherson, D. Marker, Ch. Steinhorn. Weakly o-minimal structures and real closed fields // Transactions of the American Mathematical Society. – 2000. – Vol. 352. – P. 5435–5483.H.D. Macpherson, D. Marker, Ch. Steinhorn. Weakly o-minimal structures and real closed fields // Transactions of the American Mathematical Society. – 2000. – Vol. 352. – P. 5435–5483.B.Sh. Kulpeshov. Weakly o-minimal structures and some of their properties // The Journal of Symbolic Logic. – 1998. – Vol. 63. – P. 1511–1528.B.Sh. Kulpeshov. Weakly o-minimal structures and some of their properties // The Journal of Symbolic Logic. – 1998. – Vol. 63. – P. 1511–1528.B.S. Baizhanov. Expansion of a model of a weakly o-minimal theory by a family of unary predicates // The Journal of Symbolic Logic. – 2001. – Vol. 66. – P. 1382–1414.B.S. Baizhanov. Expansion of a model of a weakly o-minimal theory by a family of unary predicates // The Journal of Symbolic Logic. – 2001. – Vol. 66. – P. 1382–1414.K. Ikeda, A. Pillay, A. Tsuboi. On theories having three countable models // Mathematical Logic Quarterly. – 1998. – Vol. 44. – No. 2. – P. 161–166.K. Ikeda, A. Pillay, A. Tsuboi. On theories having three countable models // Mathematical Logic Quarterly. – 1998. – Vol. 44. – No. 2. – P. 161–166.S.V. Sudoplatov. Classification of countable models of complete theories. — Part 1. — Novosibirsk: Novosibirsk State Technical University Publishing House. — 2018. — ISBN 978-5-7782-3527-4. — 326 p.S.V. Sudoplatov. Classification of countable models of complete theories. — Part 1. — Novosibirsk: Novosibirsk State Technical University Publishing House. — 2018. — ISBN 978-5-7782-3527-4. — 326 p.M.G. Peretyat’kin. A theory with three countable models // Algebra and Logic. – 1980. – Vol. 19. – No. 2. – P. 139-147.M.G. Peretyat’kin. A theory with three countable models // Algebra and Logic. – 1980. – Vol. 19. – No. 2. – P. 139-147.B.Sh. Kulpeshov, S.V. Sudoplatov. Linearly ordered theories which are nearly countably categorical // Mathematical Notes. – 2017. – Vol. 101. – No. 3. – P. 475–483.B.Sh. Kulpeshov, S.V. Sudoplatov. Linearly ordered theories which are nearly countably categorical // Mathematical Notes. – 2017. – Vol. 101. – No. 3. – P. 475–483.A.B. Altayeva, B.Sh. Kulpeshov. Binarity of almost -categorical quite o-minimal theories // Siberian Mathematical Journal. 2020. – Vol. 61. – No. 3. – P. 379-390.A.B. Altayeva, B.Sh. Kulpeshov. Binarity of almost -categorical quite o-minimal theories // Siberian Mathematical Journal. 2020. – Vol. 61. – No. 3. – P. 379-390.B.Sh. Kulpeshov, T.S. Mustafin. Almost w -categorical weakly o-minimal theories of convexity rank 1 // Siberian Mathematical Journal. – 2021. – Vol. 62. – No. 1. – P. 52-65.B.Sh. Kulpeshov, T.S. Mustafin. Almost w -categorical weakly o-minimal theories of convexity rank 1 // Siberian Mathematical Journal. – 2021. – Vol. 62. – No. 1. – P. 52-65.

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