双通道网络磁盘阵列存储系统的扩展性

从扩展性的角度出发,论述了网络磁盘阵列存储系统的硬件扩展性与软件扩展性。介绍了网络磁盘阵列存储系统在硬件结构上的三种扩展方式－组内扩展、组间扩展和串内级联,并对系统扩展后的数据分块方式展开了讨论。根据数据有无分块、有无校验冗余,得出系统内部数据分块方式的划分类型,指出不同数据分块方式的优点及其应用类型。最后,讨论了相关的数据管理问题。     

基于二叉树的族谱生成系统的设计与实现

针对历史较长的家族数据量大,普通书籍方法查阅起来困难的问题,设计一款基于二叉树的族谱自动生成管理系统,系统主要利用计算机数据结构中的二叉树,对家族的族谱进行生成及实现管理功能。实验证明,系统能有效实现族谱的自动生成,具有一定的应用性。     

Nearest neighbor search algorithm for GBD tree spatial data structure

This paper describes the nearest neighbor (NN) search algorithm on the GBD(generalized BD) tree. The GBD tree is a spatial data structure suitable for two-or three-dimensional data and has good performance characteristics with respect to the dynamic data environment. On GIS and CAD systems, the R-tree and its successors have been used. In addition, the NN search algorithm is also proposed in an attempt to obtain good performance from the R-tree. On the other hand, the GBD tree is superior to the R-tree with respect to exact match retrieval, because the GBD tree has auxiliary data that uniquely determines the position of the object in the structure. The proposed NN search algorithm depends on the property of the GBD tree described above. The NN search algorithm on the GBD tree was studied and the performance thereof was evaluated through experiments.     

Design and implementation of binary tree data structure based on DNA computing

The designing,encodings and an instance of simulation of a binary tree for DNA computer were proposed,which utilizes the method of biology to complete inserting and deleting of the binary tree. Firstly,DNA encodings for storage and all elements of the binary tree were completely given out. Then, the implementations of all bio-operations in DNA computer were described. Finally, to prove the feasibility of this method, an actual binary tree with detailed nucleotide encodings was introduced. The process of an ...     

产品数据管理中的产品结构树的设计方法

产品数据管理 (PDM)技术由于具有帮助企业管理与控制企业数据并缩短产品上市时间的强大功能而受到国外大中型制造企业的广泛重视和应用。针对传统的线形模式组织数据 ,提出以产品结构为核心的产品结构树方法组织数据以及实现的方法。     

面向媒体处理可重构系统中数据缓存结构和缓存管理策略优化

研究并提出了一种基于二维访问机制的数据缓存结构(2D Cache)及其更新管理策略.该缓存结构可以在控制硬件存储开销的同时,有效提升可重构系统的数据访存效率.实验结果表明,仅需4 KB的数据缓存开销,可重构系统的访存性能提升了29.16%~35.65%,并且对于不同标准的媒体处理算法都能获得较好的优化效果,具有很好的适应性.芯片实测结果表明,采用所述数据缓存设计方案的可重构系统可以在200 MHz下满足1080p@30fps的实时解码需求,与国际同类架构相比,性能提高了1.8倍以上.     

树形结构在关系数据库中的存储与运算

通过对树形结构在关系数据库中常见存储模式的研究,提出了在管理信息系统开发中适用的树形结构的关系数据库存储模式一一先根遍历层次兄弟树表。该存储模式吸收了层次编号、先根遍历树表等存储形式的特点,能有效实现管理信息系统中树形结构的求根到某结点路径、某结点全部孩子、结点维护等常用运算。具有构建方便,查询灵活高效的特点。     

砼强度准则在井壁结构中的应用研究

本文根据井壁结构模型试验结果,对目前具有代表性的复杂应力状态下的砼强度准则进行了分析和对比,找到了一种比较适合于井壁结构的砼强度准则,从而为井壁结构承载能力的合理计算提供了理论基础.     

Specification and verification for semi-structured data

Tree logic, inherited from ambient logic, is introduced as the formal foundation of related programming language and type systems, In this paper, we introduce recursion into such logic system, which can describe the tree data more dearly and concisely. By making a distinction between proposition and predicate, a concise semantics interpretation for our modal logic is given. We also develop a model checking algorithm for the logic without △ operator. The correctness of the algorithm is shown. Such work can be seen as the basis of the semi-structured data processing language and more flexible type system.     

事务模式树分层挖掘算法及其应用

从事务数据、时间序列数据等数据库中挖掘频繁模式已在数据挖掘领域中得到了广泛地研究．针对目前已有的Apriori算法和频繁模式增长算法在时间和空间等方面的复杂性和低效性,提出了一种新的数据结构——事务模式树,用来存放待挖掘的事务信息,同时给出一种基于该数据结构的挖掘算法——事务模式树分层挖掘算法．最后,把该算法应用于保险业务．结果表明,该算法简单高效,值得推广.