Improved recursion handling through integrity constraints

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

Improved recursion handling through integrity constraints

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

Research output: Contribution to journal › Article › peer-review

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 language	English
Pages (from-to)	282-285
Number of pages	4
Journal	Computer Journal
Volume	34
Issue number	3
Publication status	Published - Jun 1991

Cite this

@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 = jun,

language = "English",

volume = "34",

pages = "282--285",

journal = "Computer Journal",

issn = "1460-2067",

publisher = "Oxford University Press",

number = "3",

}

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 - https://www.scopus.com/pages/publications/0026170045

M3 - Article

SN - 1460-2067

VL - 34

SP - 282

EP - 285

JO - Computer Journal

JF - Computer Journal

IS - 3

ER -

Improved recursion handling through integrity constraints

Abstract

Other files and links

Fingerprint

Cite this