On the Isolation Property over a Database Domain  

作　　者：Bektur S. Baizhanov Beibut Sh. Kulpesho 

机构地区：[1]Institute of Mathematics and Mathematical Modeling, Almaty 050000, Kazakhstan [2]Department if Information Systems and Mathematical Modeling, International Information Technology University, Almaty 050000,Kazakhstan

出　　处：《Journal of Mathematics and System Science》2013年第2期96-100,共5页数学和系统科学（英文版）

摘　　要：The authors 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 FO （first-order） 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. The collapse result theorem was proved for locally genetic queries over a linearly ordered domain with the Pseudo finite Homogeneity Property （or / and the Isolation Property） by Belegradek et al.. Here the authors consider a circularly ordered domain and prove the collapse result theorem over a quasi circularly minimal domain.

关 键 词：O-MINIMALITY database query circularly ordered domain. 

分 类 号：TP311.13[自动化与计算机技术—计算机软件与理论] F293.3[自动化与计算机技术—计算机科学与技术]