Chain-split evaluation in deductive databases

Research output: Chapter in Book/Report/Conference proceedingConference contribution


A chain-split evaluation technique for the efficient evaluation of recursions in deductive databases is described. Three chain-split evaluation techniques: magic sets, buffered evaluation, and partial evaluation, are developed. The first one is applicable to the evaluation of function-free recursions. The latter two are applicable to both function-free and functional recursions. Partial evaluation is a further refinement of the buffered evaluation by evaluating the buffered functional predicates as much as possible to reduce the cost of maintaining the sequences of buffered values and facilitates termination judgment and constraint pushing. Chain-split evaluation is an important recursive query processing technique which can be implemented efficiently in deductive databases by extension to the available recursive query evaluation techniques.

Original languageEnglish (US)
Title of host publicationProceedings - International Conference on Data Engineering
PublisherPubl by IEEE
Number of pages9
ISBN (Print)0818625457
StatePublished - Jan 1992
Externally publishedYes
Event8th International Conference on Data Engineering - Tempe, AZ, USA
Duration: Feb 3 1992Feb 7 1992

Publication series

NameProceedings - International Conference on Data Engineering


Other8th International Conference on Data Engineering
CityTempe, AZ, USA

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Information Systems


Dive into the research topics of 'Chain-split evaluation in deductive databases'. Together they form a unique fingerprint.

Cite this