Skip to main content


eCommons@Cornell

eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1813/7469
Title: An Efficient Algorithm for Testing Losslessness of Joins in Relational Data Bases
Authors: Liu, Lishing
Demers, Alan J.
Keywords: computer science
technical report
Issue Date: Sep-1978
Publisher: Cornell University
Citation: http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR78-351
Abstract: Answering queries in a relational database model often requires the computation of joins of relations. Losslessness of joins is an important property for joins of relations to be semantically meaningful. In this paper we present an $O(n^{3})$ algorithm for testing losslessness of joins in relational databases with functional dependencies, which improves the $O(n^{4})$ result by Aho, Beeri and Ullman.
URI: http://hdl.handle.net/1813/7469
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
78-351.pdf306.6 kBAdobe PDFView/Open
78-351.ps121.55 kBPostscriptView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.

 

© 2014 Cornell University Library Contact Us