摘要
研究了时态数据库中的无α环问题,由于无α环数据库模式具有一系列优异的特性,如良好的联接环境,较高的运行效率,以及可以通过算法判定查询中的二义性问题等等。因此,以关系数据库中的超图及其相关知识为理论依据,提出了无α环时态超图以及TGraham算法和一些重要特性。
This paper studies on the α-acycle problem in the temporal database. As the α-acycle database module has a set of excellent property. E. g., good conjection environment, better work efficiency, the deciding algorithm about semantic ambiguity in the query etc. Therefore, It studies on the theory of the hypergraph and other relational knowledge, then presents the definition of α-acycle temporal hypergraph, TGraham algorithm and some important characteristics.
出处
《信息技术》
2008年第1期142-144,共3页
Information Technology
