Location:
Search - tree access
Search list
Description: 用ASP+ACCESS数据库实现的无限级目录树-ASP ACCESS database unlimited class tree
Platform: |
Size: 32087 |
Author: davis |
Hits:
Description: The R Treean Efficientand Robust Access Method for Point sand Rectangles
Platform: |
Size: 976498 |
Author: lxl99868 |
Hits:
Description: vc中利用ado访问Access文件（包含tree，datagrid控件）-vc use ado visit Access document (containing tree, datagrid control)
Platform: |
Size: 241664 |
Author: 雷伟 |
Hits:
Description: R 树， 存取方式的当中最普遍的的用长方形， 是根据区域的启发式优化围绕的长方形在各个内在结点通过运行在一张规范化的试验平台下高度变化的数据， 询问和操作众多的实验， 我们能设计合并联合的优化的R* 树区域， 各个附寄的长方形边际和交叠在目录使用我们规范化的试验床在详尽表现比较，它结果R* 树清楚地胜过现有的R 树变形Guttman’s线性和二次方R 树和R 树的格林变形，R* 树的这优势举行为不同的型询问和操作， 譬如地图覆盖物。 为两个长方形和多维点在所有实验从一个实用观点R* 树是非常有吸引力的由于以下二个原因1 它高效率地支持点和空间数据同时和2 它实施费用比那少许高级其它R 树。-R tree, which forms of access to the most common use of a rectangular shape, which is based on heuristic optimization rectangular inherent in all nodes running on a standardized test platform height data, inquiries and the operation of many experiments, we can design the optimal merging of the joint R* Tree region, judging from the various and overlapping rectangular marginal in the directory using our standardized test bed in a detailed performance comparisons, and it results R* tree clearly better than the existing R-tree deformation Guttman's linear and quadratic R-tree and R Green Tree deformation, R* Tree of this advantage at different type of inquiry and operation, such as maps cover. For two and multi-dimensional rectangular in all experiments from a practical point of R* tr
Platform: |
Size: 172032 |
Author: 王琪 |
Hits:
Description: Libgist is an implementation of the Generalized Search Tree, a template index structure that makes it easy to implement any type of hierarchical access method (AM).
-Libgist is an implementation of the Generalized Search Tree, a template index structure that makes it easy to implement any type of hierarchical access method (AM).
Platform: |
Size: 2267136 |
Author: hu |
Hits:
Description: 实现标准vc++中的树型控件的动态视图控制和ado对数据库的访问-achieve the standards vc Tree View controls the dynamic control and ado access to the database
Platform: |
Size: 48128 |
Author: |
Hits:
Description: Although there has been a lot of AVL tree libraries available now, nearly all of them are meant to work in the random access memory(RAM). Some of them do provide some mechanism for dumping the whole tree into a file and loading it back to the memory in order to make data in that tree persistent. It serves well when there s just small amount of data. When the tree is somewhat bigger, the dumping/loading process could take a lengthy time and makes your mission-critical program less efficient. How about an AVL tree that can directly use the disk for data storage ? If there s something like that, we won t need to read through the whole tree in order to pick up just a little bit imformation(a node), but read only the sectors that are neccssary for locating a certain node and the sectors in which that node lies. This is my initial motivation for writing a storage-media independent AVL Tree. However, as you step forth, you would find that it not only works fine with disks but also fine with memorys, too.-Although there has been a lot of AVL tree libraries available now, nearly all of them are meant to work in the random access memory(RAM). Some of them do provide some mechanism for dumping the whole tree into a file and loading it back to the memory in order to make data in that tree persistent. It serves well when there s just small amount of data. When the tree is somewhat bigger, the dumping/loading process could take a lengthy time and makes your mission-critical program less efficient. How about an AVL tree that can directly use the disk for data storage If there s something like that, we won t need to read through the whole tree in order to pick up just a little bit imformation(a node), but read only the sectors that are neccssary for locating a certain node and the sectors in whic
Platform: |
Size: 87040 |
Author: 高名 |
Hits:
Description: 用ASP+ACCESS数据库实现的无限级目录树-ASP ACCESS database unlimited class tree
Platform: |
Size: 31744 |
Author: davis |
Hits:
Description: 此程序用到了,ADO连接ACCESS数据库,切分窗口,以及不同视图之间进行通信.List Control和Tree Control,用户UI线程等技术.-use of this procedure, ADO connection ACCESS database segmentation window different Views of communication between. List Control and Tree Control, users UI thread technology.
Platform: |
Size: 556032 |
Author: 马成启 |
Hits:
Description: This project attempts to implement a Database using B+Tree. The project has developed a DATABASE SYSTEM with lesser memory consumption. Its API includes simple SQL Statements and the output is displayed on the screen. Certain applications for which several features of existing databases like concurrency control, transaction management, security features are not enabled. B+Trees can be used as an index for factor access to the data. Help facility is provided to know the syntax of SQL Statements.
-This project attempts to implement a Datab ase using B Tree. The project has developed a DAT ABASE SYSTEM with lesser memory consumption. I ts API includes simple SQL Statements and the ou tput is displayed on the screen. Certain applic ations for which several features of existing d atabases like concurrency control, transaction management. security features are not enabled. B Trees can b e used as an index factor for access to the data. H elp facility is provided to know the syntax of SQ L Statements.
Platform: |
Size: 11264 |
Author: 郭春阳 |
Hits:
Description: 逐迹工作室?.NET(C#)内容管理系统 系统简介
Zj CMS 1.1 不只是一个论坛，它也不只是一个文章系统、下载系统，而是一个由文章模块、下载模块、图片模块、音乐模块、影视模块、链接模块、留言模块、聊天模块、公司库模块、产品模块、商机模块等模块组成的信息管理与会员互动系统。
逐迹工作室?.NET(C#)内容管理系统 V1.1 功能特点
界面采用Div+Css+Xhtml技术,结构更清晰,扩展更加方便
采用多层结构显示与逻辑分离，方便修改页面显示效果
内容采用在线编辑器，可以像使用word一样编辑新闻
类别管理一般都采用无限树形结构分类
支持多数据库，采用工厂模式，升级扩展更加方便
采用全球化编写机制,扩展多种语言更加方便
支持全文索引，方便用户快速搜索
聊天功能采用AJAX技术,无刷新多房间
逐迹工作室?.NET(C#)内容管理系统 运行要求
Window 2000 + IIS或以上
Microsoft.NET平台
Access数据库
Microsoft Internet Explorer 5.5 或以上
逐迹工作室?.NET(C#)内容管理系统 相关下载
Zj CMS 1.1 免费版 -PV trace studios.NET (C#) content management system CMS System Dreamweaver 1.1 is not just a Forum, it is not only an article, download, but an article from the module, download module, pictures module, Music module, video module, link module, voice mail module, Chat module, the module company, product modules, business modules integral module of the information management system with Member interaction. PV trace studios.NET (C#) Content Management System V1.1 interface features used Div Dice Xht ml technology, structure is more clear, more accessible to expand multi-storey structure and logic shows separation, facilitate change pages effects, as used on-line editor, like the word can be used as news editor category management generally unlimited use classification tree structure to su
Platform: |
Size: 811008 |
Author: yimingzhou |
Hits:
Description: 随机访问网的性能仿真，附有详细文档和matlab源码-Random access network performance simulation, with detailed documentation and source code matlab
Platform: |
Size: 109568 |
Author: 余未 |
Hits:
Description: 该软件可以方便的把HTML网页解析成一棵Tree，方便的获得各个节点的名称和属性，一款很好的解析HTML的软件。-The software can easily turn into an HTML page analysis Tree, convenient access to each node name and attributes of a good HTML analytic software.
Platform: |
Size: 123904 |
Author: 李铭岳 |
Hits:
Description: 二叉搜索树的C#实现以及对其的各类操作：插入，删除，查找，打印，计算子节点，获得特定节点等。-Binary search tree C# Realize as well as the types of operation: insert, delete, search, printing, calculation of child nodes, such as access to specific nodes.
Platform: |
Size: 2048 |
Author: freeshine |
Hits:
Description: 树状目录结构，带有源码。分为不同的类，可独自运行，也可插入其它框架中，代码实现了文件路径以string存取-Tree structure, with source code. Divided into different categories, can be run independently, can also be inserted into other frameworks, the code achieved a string file path to access
Platform: |
Size: 5120 |
Author: 叶光廷 |
Hits:
Description: 红黑树是一种自平衡二叉查找树，是在计算机科学中用到的一种数据结构，典型的用途是实现关联数组。-AVL trees are actually easier to implement than RB trees because there are fewer cases. And AVL trees require O(1) rotations on an insertion, whereas red-black trees require O(lg n).
In practice, the speed of AVL trees versus red-black trees will depend on the data that you re inserting. If your data is well distributed, so that an unbalanced binary tree would generally be acceptable (i.e. roughly in random order), but you want to handle bad cases anyway, then red-black trees will be faster because they do less unnecessary rebalancing of already acceptable data.On the other hand, if a pathological insertion order (e.g. increasing order of key) is common, then AVL trees will be faster, because the stricter balancing rule will reduce the tree s height.
Splay trees might be even faster than either RB or AVL trees,depending on your data access distribution. And if you can use a hash instead of a tree, then that ll be fastest of all.
Platform: |
Size: 8192 |
Author: kark |
Hits:
Description: tree控件使用，简介ACCESS数据库，以及树形显示-control the use of tree, About ACCESS database, as well as the tree shows
Platform: |
Size: 1898496 |
Author: jinsong |
Hits:
Description: 用delphi写的用户权限管理
修改了权限树节点状态生成过程，采用循环遍历树结点
修改了主界面菜单和工具条显示过程，采用递规遍历菜单
通过系统管理员进入sys权限设置，在mainfrom创建的时候读取权限。
权限设置模块中可根据需要改为：将树型结构的节点写进数据库，进行动态修改。在程序中动态生成树型结构
过系统管理员:sys
密码:sys
普通用户:001
密码:123
用VB、VS等开发工具可参考设计。-Use delphi write permissions to modify user rights management tree node-state generation process, using loop traversing the tree nodes modify the main interface menu and toolbar shows the process of delivery rules adopted by the system administrator access to traverse the menu sys permissions settings created in the mainfrom when the read permissions. Permission settings module as needed with the following: the tree structure of nodes included in the database, the dynamic changes. Dynamically generated in the program tree structure over the system administrator: sys Password: sys ordinary user: 001 Password: 123 using VB, VS and other development tools available reference design.
Platform: |
Size: 114688 |
Author: |
Hits:
Description: VC folder tree acce-VC folder tree access
Platform: |
Size: 1870848 |
Author: 纪鹏 |
Hits:
Description: 【二叉树遍历的递归算法实现】
操作：根据提示输入相应数据实现各种功能
函数：菜单函数(menu)
前序建立二叉树(Crt_BinTree)
访问结点(Visit)
前序遍历(Pretraverse)
中序遍历(Intraverse)
后序遍历(Suctraverse)
删除树(Destory)
操作函数(perform)Pretraverse
主函数(main)
说明：结点数据初始为char型，但可在前面代码部分修改
成其他类型，输入时@代表子树为空-The binary tree traversal of recursion algorithm 】
Operation: according to the prompt corresponding input data realization of different functions
Function: the menu function (menu)
The preface to establish a binary tree (Crt_BinTree)
Access nodes (Visit)
The preface to traverse (Pretraverse)
In order to traverse (Intraverse)
After traverse sequence (Suctraverse)
Delete tree (Destory)
Operation function (perform) Pretraverse
The main () function (main)
Note: data for type char initial nodes, but can be in front the code changes
Into other types, input on behalf of children for empty @ tree
Platform: |
Size: 2048 |
Author: |
Hits: