Improved recursion handling through integrity constraints

K. Wicovsky, P. F. Thanisch, Howard Williams

Research output: Contribution to journalArticle

Abstract

A new form of database integrity constraint is introduced which describes the structure present in data when that structure takes the form of a graph, tree or list. This type of integrity constraint is of particular benefit in reducing the overhead when detecting termination in the case of recursive queries.

Original languageEnglish
Pages (from-to)282-285
Number of pages4
JournalComputer Journal
Volume34
Issue number3
Publication statusPublished - Jun 1991

Cite this

Wicovsky, K., Thanisch, P. F., & Williams, H. (1991). Improved recursion handling through integrity constraints. Computer Journal, 34(3), 282-285.
Wicovsky, K. ; Thanisch, P. F. ; Williams, Howard. / Improved recursion handling through integrity constraints. In: Computer Journal. 1991 ; Vol. 34, No. 3. pp. 282-285.
@article{64b7e23ab2b8420dbc0caeba999eca92,
title = "Improved recursion handling through integrity constraints",
abstract = "A new form of database integrity constraint is introduced which describes the structure present in data when that structure takes the form of a graph, tree or list. This type of integrity constraint is of particular benefit in reducing the overhead when detecting termination in the case of recursive queries.",
author = "K. Wicovsky and Thanisch, {P. F.} and Howard Williams",
year = "1991",
month = "6",
language = "English",
volume = "34",
pages = "282--285",
journal = "Computer Journal",
issn = "0010-4620",
publisher = "Oxford University Press",
number = "3",

}

Wicovsky, K, Thanisch, PF & Williams, H 1991, 'Improved recursion handling through integrity constraints', Computer Journal, vol. 34, no. 3, pp. 282-285.

Improved recursion handling through integrity constraints. / Wicovsky, K.; Thanisch, P. F.; Williams, Howard.

In: Computer Journal, Vol. 34, No. 3, 06.1991, p. 282-285.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Improved recursion handling through integrity constraints

AU - Wicovsky, K.

AU - Thanisch, P. F.

AU - Williams, Howard

PY - 1991/6

Y1 - 1991/6

N2 - A new form of database integrity constraint is introduced which describes the structure present in data when that structure takes the form of a graph, tree or list. This type of integrity constraint is of particular benefit in reducing the overhead when detecting termination in the case of recursive queries.

AB - A new form of database integrity constraint is introduced which describes the structure present in data when that structure takes the form of a graph, tree or list. This type of integrity constraint is of particular benefit in reducing the overhead when detecting termination in the case of recursive queries.

UR - http://www.scopus.com/inward/record.url?scp=0026170045&partnerID=8YFLogxK

M3 - Article

VL - 34

SP - 282

EP - 285

JO - Computer Journal

JF - Computer Journal

SN - 0010-4620

IS - 3

ER -

Wicovsky K, Thanisch PF, Williams H. Improved recursion handling through integrity constraints. Computer Journal. 1991 Jun;34(3):282-285.