LESS COSTLY CONSTRAINTS CHECKING FOR JOIN DEPENDENCY.

Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/99549

DC Field	Value
dc.title	LESS COSTLY CONSTRAINTS CHECKING FOR JOIN DEPENDENCY.
dc.contributor.author	Tan, K.P.
dc.date.accessioned	2014-10-27T06:05:13Z
dc.date.available	2014-10-27T06:05:13Z
dc.date.issued	1984
dc.identifier.citation	Tan, K.P. (1984). LESS COSTLY CONSTRAINTS CHECKING FOR JOIN DEPENDENCY. : 63-68. ScholarBank@NUS Repository.
dc.identifier.uri	http://scholarbank.nus.edu.sg/handle/10635/99549
dc.description.abstract	A set of n tuples in a relation of a relational database design is tested upon the constraints of the join dependency. Some constraint equalities are found to be redundant. To remove this superfluity, the universe of attibutes is partitioned into n disjoint sets and a new notation of join dependency is introduced. The checking time in each run of n tuples is significantly reduced by a factor of (n minus 1)/2 when n greater than 3. The result of less costly constraints checking is of great importance for a large number of tuples in a relation.
dc.source	Scopus
dc.type	Conference Paper
dc.contributor.department	INFORMATION SYSTEMS & COMPUTER SCIENCE
dc.description.page	63-68
dc.identifier.isiut	NOT_IN_WOS
Appears in Collections:	Staff Publications

There are no files associated with this item.

Check