Counting and Topological Order
陈阳军
【期刊名称】《计算机科学技术学报：英文版》 【年(卷),期】1997(012)006
【摘要】The counting method is a simple and efficient method for processing linear recursive datalog queries.Its time complexity is bounded by O(n,e)where n and e denote the numbers the numbers of nodes
and
edges,respectively,in
the
graph
representing
the
input.relations.In this paper,the concepts of heritage appearance function and heritage selection function are introduced,and an evaluation algorithm based on the computation of such functions in topological order is developed .This new algorithm requires only linear time in the case of non-cyclic data. 【总页数】13页(497-509)
【关键词】数据库;递归询问;数据查询 【作者】陈阳军
【作者单位】TechnicalInstituteofChangsha,Changsha410073 【正文语种】英文 【中图分类】TP311.13 【相关文献】
1.基于串行通讯的资源管理数据库系统 [J], 郭颂伟; 苗万群
2.数字神经解剖学数据库的构建和资源共享 [J], 王迎春; 杨桂姣; 宋岳涛
Counting and Topological Order
