Show simple item record

dc.contributor.authorLiu, Lishingen_US
dc.contributor.authorDemers, Alan J.en_US
dc.date.accessioned2007-04-23T18:22:08Z
dc.date.available2007-04-23T18:22:08Z
dc.date.issued1978-09en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR78-351en_US
dc.identifier.urihttps://hdl.handle.net/1813/7469
dc.description.abstractAnswering 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.en_US
dc.format.extent313960 bytes
dc.format.extent124469 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleAn Efficient Algorithm for Testing Losslessness of Joins in Relational Data Basesen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics