Query Optimization for Deductive Databases

在线阅读 下载PDF 导出详情
摘要 Asystematic,efficientcompilationmethodforqueryevaluationofDeductiveDatabases(DeDB)isproposedinthispaper.Inordertoeliminateredundancyandtominimizethepotentiallyrelevantfacts,whicharetwokeyissuestotheefficiencyofaDeDB,thecompilationprocessisdecomposedintotwophases.Thefirstisthepre-compilationphase,whichisresponsiblefortheminimizationofthepotentiallyrelevantfacts.Thesecond,whichwerefertoasthegeneralcompilationphase,isresponsiblefortheeliminationofredundancy.Therule/goalgraphdevisedbyJ.D.Ullmanisappropriatelyextendedandusedasauniformformalism.Twogeneralalgorithmscorrespondingtothetwophasesrespectivelyaredescribedintuitivelyandformally.
机构地区 不详
出版日期 1995年02月12日(中国期刊网平台首次上网日期,不代表论文的发表时间)
  • 相关文献