2000 ms sql database backup and recovery (routines download)

通过 IDataSourceLocatorPtr 组件调用[建立ADO连接字符串对话框]-through IDataSourceLocatorPtr components called [ADO connection string establish dialog]

用ODBC写的动态获取数据的一个类 -An class for accessing data by ODBC

SQL SERVER2000数据库备份和恢复存储过程-SQL Server2000 database storage backup and recovery process

MonetDB是从主存储器观点开发而来的数据管理系统，使用一个完全分解的存储模块，自动的标题管理，数据类型和搜索加速器的可延伸性，以及SQL-和XML-前台-MonetDB from main memory from the perspective development of data management systems, the use of a fully composted memory modules, automatic management of the title, and search data types can extend the accelerator, and SQL-and XML-prospects

VB实例源码,如有不妥之处请修改后通知再讨论一起来完善源码的上传.-Example VB source code, if the inadequacies of the revised notice, please discuss with one sound source upload.

使用DAO访问数据库的例子-DAO access to the database using the example

db数据库支撑模块，数据库的开发以及ADO.NET的数据封装，虽然不是很完美但是对一般开发已近满足大部分需求-db database support module, database development, and ADO.NET data package, although not perfect but most of the general development to meet the needs of nearly

资产管理系统是功能齐全的管理系统，可以作为商业代码直接使用-Asset management system is a full-featured management system that can be used directly as a commercial code

一个完整的代理服务器源代码-A complete proxy server source code

时考虑到在哈夫曼中要每次挑选两个频率最小（即出现次数最小，我那个hNode里的value 是出现的次数），很自然的就想到了std::priority_queue容器，优先队列每次都会弹出队列 中权值最高的元素，这个特性无疑是实现哈夫曼算法的最佳选择。 ... -to consider the Huffman each selected to be the smallest two frequencies (that is, the minimum number, which I hNode"s value is the number of occurrences), it is natural to think of the std : : priority_queue containers, each priority queue queue will pop the top right elements, the Characteristics undoubtedly Huffman algorithm is the best choice. ...