助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   约束数据库 的翻译结果: 查询用时:0.036秒
图标索引 在分类学科中查询
所有学科
计算机软件及计算机应用
电信技术
更多类别查询

图标索引 历史查询
 

约束数据库
相关语句
  constraint database
     ISQL:AN INTERVAL CONSTRAINT DATABASE QUERY LANGUAGE
     区间约束数据库查询语言:ISQL
短句来源
     The Introduction to Constraint Database
     约束数据库技术概论
短句来源
     This paper proposes a distributed constraint database system for virtual reality application based on implicit solid modeling theory.
     在传统对象关系数据库中采用扩充基于隐实体建模模式的空间逻辑运算和空间分析运算功能,建立了用于虚拟现实应用的分布式约束数据库系统。
短句来源
     DYNAMIC INTERVAL INDEX IN CONSTRAINT DATABASE
     约束数据库中的动态区间索引结构
短句来源
     A GIS spatiotemporal data model and its query based on linear constraint database in astronautics
     宇航中的一种基于线性约束数据库的GIS空时数据模型及其查询
短句来源
更多       
  constraint databases
     INDEXING FOR CONSTRAINT DATABASES
     约束数据库中的索引
短句来源
     The User-Defined Multi-Functional Join Query Optimization in Constraint Databases
     约束数据库带有多重用户函数连接的查询优化
短句来源
     Constraint databases overcomes shortcomings of the existing database systems and are regarded as a very promising new technologies in a wide variety of applications.
     约束数据库克服了现有数据库技术的不足,在众多的领域有广阔的应用前景。
短句来源
     The paper gives the algorithm for constraint relational schema into 3NF and the algorithm for constraint relational schema into BCNF which are central in the design of constraint databases.
     在此基础上完成了约束数据库设计的核心工作 :把约束关系模式分解为 3NF或BCNF的算法
短句来源
  “约束数据库”译为未确定词的双语例句
     The Generation of Constraints?Database Based on AutoCAD
     基于AutoCAD的约束数据库生成
短句来源
     Axiom System of Functional Dependencies and Design Theory in Contraint Databases
     约束数据库中的函数依赖公理系统与设计理论
短句来源
     We develop a mobility model to represent the moving behaviors of mobile users, investigate query processing and cache management strategies.
     第四,提出了一个基于线性约束数据库的位置相关查询处理模型。
短句来源
     Meta-blocktree is improved and a data structure S tree is presented. It stores the stabbing sets forconstants that appears in the intervals. If the maximurn length of each stabbing set is limited, the space used in S tree is optimal- Compared with M tree, a significant improvement of S is that it can support delete operation.
     本文研究了约束数据库中的索引技术,提出了存储区间常数刺穿集的数据结构S树和S树.在刺穿集的最大长度受到限制的条件下,S树存储效率是最优的.与M树相比,S树和S树有一个明显的改进:可以支持删除操作.
短句来源
     This article is based on work bench of SQL Server 7 0,presents the problem how to distribute jobs between server and client,and emphasizes the problem how to use complete restrain,database flip_flop and storage procedure,and how to finish processing logic in order to reduce data_transmission on net and get more efficiency in client_server application system.
     以SQLServer 7 0服务器为平台提出如何在客户端与服务器合理分布处理逻辑 ,重点阐述了如何在服务器端使用完整性约束 ,数据库触发器和存储过程来完成处理逻辑 ,以减少网络传输 ,使客户机 /服务器应用系统有较高的处理效率。
短句来源
更多       
查询“约束数据库”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  constraint database
Furthermore, BAPA constraints can be used for proving the termination of programs that manipulate data structures, as well as in constraint database query evaluation and loop invariant inference.
      
In the constraint database community FO+poly and FO+linear have been proposed as foundations for spatial database query languages.
      
Finally, we show how a constraint database system can be used to efficiently retrieve shapes, retaining the advantages of the already defined approaches.
      
The CCUBE system is designed to be used for the implementation and optimization of high-level constraint object-oriented query languages as well as for directly building software systems requiring extensible use of constraint database features.
      
In this paper, we propose a language, in the style of constraint database languages, for formal specification of QoS constraints.
      
  constraint databases
Constraint databases use mathematical theories to finitely represent infinite sets of relational tuples.
      
We develop the scheme of indefinite constraint databases using first-order logic as our representation language.
      
To make our claim more persuasive, we survey previous works on querying temporal constraint networks and show that they can be viewed as an instance of the scheme of indefinite constraint databases.
      
Constraint Databases: Promising Technology or Just Intellectual Exercise
      
This paper describes the state of Constraint Databases (CDBs), a young discipline at the intersection of Database Management, Constraint Programming, Computational Geometry and Operations Research.
      
更多          


A molecular modeling scheme using distance-restraint- based database search and contact potential analysis is proposed for modeling loop region of protein.The procedure has been proved reliable through modeling 50 loop regions in globins,serine proteinases,calcium-binding proteins and lysozyme. It is shown that 86%(43 out of 50) of the test cases can be modeled and 14%(7 out of 50) can not be modeled (main-chain Ca-atoms root-mean-square(r.m.s.) deviations greater than 1.0A).It is demonstrated that the scheme...

A molecular modeling scheme using distance-restraint- based database search and contact potential analysis is proposed for modeling loop region of protein.The procedure has been proved reliable through modeling 50 loop regions in globins,serine proteinases,calcium-binding proteins and lysozyme. It is shown that 86%(43 out of 50) of the test cases can be modeled and 14%(7 out of 50) can not be modeled (main-chain Ca-atoms root-mean-square(r.m.s.) deviations greater than 1.0A).It is demonstrated that the scheme can be used to model loops in protein engineering.

利用距离约束的数据库搜索方法和接触势能分析技术,提出了一种用来模建蛋白质结构环区的分子模建方法。通过对珠蛋白、丝氨酸蛋白酶、钙结合蛋白和溶菌酶(6LYZ)中的50个环区的模建,证明上述方法是可行的。对总共50个环区的模建表明,86%的环区(43个)可以模建,只有14%的环区(7个)不能模建(主链构象的α碳原子的均方根差大于1.0A)。研究结果表明这种方法非常适用于蛋白质工程中的环区模建。

In this paper, the indexing in constraint databases is considered. Meta-blocktree is improved and a data structure S tree is presented. It stores the stabbing sets forconstants that appears in the intervals. If the maximurn length of each stabbing set is limited, the space used in S tree is optimal- Compared with M tree, a significant improvement of S is that it can support delete operation.

本文研究了约束数据库中的索引技术,提出了存储区间常数刺穿集的数据结构S树和S树.在刺穿集的最大长度受到限制的条件下,S树存储效率是最优的.与M树相比,S树和S树有一个明显的改进:可以支持删除操作.

Data integrity constraints are important issues in design of database and its application systems。In this paper,we explain first the concepts and types of data intigrity and the functions Visual FoxPro can provided and then discuss the principles of integrity.

数据完整性约束是数据库及应用系统设计中的一个重要问题。本文首先说明了数据完整性的概念、类型以及VisaulFoxPro所提供的相应功能,然后讨论了它们的实现原理,最后介绍了具体的实现方法。

 
<< 更多相关文摘    
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关约束数据库的内容
在知识搜索中查有关约束数据库的内容
在数字搜索中查有关约束数据库的内容
在概念知识元中查有关约束数据库的内容
在学术趋势中查有关约束数据库的内容
 
 

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社