数据库开发，实现多数据库交互，复杂查询语句

栈的基本操作，有初始化，清空，添加，删除，判空等!-stack the basic operation, initialization, emptied, add, delete, subcontracting air!

smark.data是基于C#开发的轻量级数据访问组件。 提供以下功能封： 1）提供了跨数据库类型操作能力 2）基于程线存储的数据访问上下文对象，轻易提供跨方法域的数据事务处理机制。 3）对象查询表达式 4）实体操作基础封装等快速开发功能 开发人员可以在以上基于功能扩展出更灵活高效的数据操作。 组件还提供一个基于VS2008的Generator，可以让开发人员在VS。NET里描述XML的同时同步生成实体操作代码进一步简化操作（开发人员也可以根据自己的需求编写适合自己的Generator）。 -failed to translate

About: hamsterdb is a database engine written in ANSI C. It supports a B+Tree index structure, uses memory mapped I/O (if available), supports cursors, and can create in-memory databases. Release focus: Major feature enhancements Changes: This release comes with many changes and new features. It can manage multiple databases in one file. A new flag (HAM_LOCK_EXCLUSIVE) places an exclusive lock on the file. hamsterdb was ported to Windows CE, and the Solution file for Visual Studio 2005 now supports builds for x64. Several minor bugs were fixed, performance was improved, and small API changes occurred. Pre-built libraries for Windows (32-bit and 64-bit) are available for download. Author: cruppstahl

北京邮电大学软件工程研究生的课程---数据库设计开发-0-1.1.ppt ... 北京邮电大学软件工程研究生的课程---数据库设计开发-5.2.ppt-Beijing University of Posts and Telecommunications Software Engineering postgraduate courses- Database design and development-0-1.1.ppt ... Beijing University of Posts and Telecommunications Software Engineering postgraduate courses- Database design and development-5.2.ppt

程序C++双链表算法代码-procedures List C-code Algorithm

该程序能实现的功能，若活动图有回路则无法计算出关键路径，即解决了判断工程的可行性问题。通过对工程活动的输入，可以建立任意的AOE网进行判断。对于输入的网，可以计算出每个活动的最早开始时间，最迟开始时间和全工程可以完成的最早时间，并找出关键路径和关键活动。-the program can achieve the functional, if a circuit map activities can not be calculated critical path, that is a judgment to resolve the feasibility of the project. Right through the importation of construction activities, we can establish arbitrary judgment AOE network. The network for the importation can be calculated for each of the earliest start time, the latest starting time and the entire project will be completed in the first time, and identify key and critical path activities.

图论中最小生成树Kruskal算法 及画图程序 M-函数-Graph theory Kruskal minimum spanning tree algorithm and Paint program M-function

VFP 6.0 开发的一个程序-development of a procedure

有需要的同仁载回去慢慢研究-need colleagues set back slowly study

代码注重B树插入、删除的算法逻辑，适用于 学习者研究B树实现的核心思想。代码中无庞杂的无关操作-focus on B-tree code insertion, deletion algorithm logic applies to B-tree research learners to achieve the core idea. The code has nothing to do with the complex operation