摘要
分析了任意树在关系数据库中实现技术,提出通过编号、双亲结点编号、顺序号、层次、加入时间等字段来存储任意树,不仅能保留树的原状,还可以高效的进行数据操作,且操作简单、方便。
An analysis of any tree in the relational database technology, the adopted code, parent node ID, sequence number, level, adding the time field to store arbitrary trees, not only to retain the original tree can also be efficient for data operation simple and convenient.
出处
《电脑知识与技术》
2009年第7X期5607-5609,共3页
Computer Knowledge and Technology
