Algebraic versus probabilstic independence in data bases

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Algebraic versus probabilstic independence in data bases

Full text

Pdf (402 KB)

Source

Symposium on Principles of Database Systems archive
Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems table of contents

Portland, Oregon, United States

Pages: 149 - 153

Year of Publication: 1985

ISBN:0-89791-153-9

Authors

François Bancilhon
Nicolas Spyratos

Sponsors

SIGMOD: ACM Special Interest Group on Management of Data
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 0, Downloads (12 Months): 0, Citation Count: 3

Additional Information:

cited by collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTex EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/325405.325424 What is a DOI?

CITED BY 3

	Francesco M. Malvestuto, Statistical versus relational join dependencies, Proceedings of the 7th international conference on Scientific and Statistical Database Management, p.64-73, September 28-30, 1994, Charlottesville, Virginia
	Gerome Miklau , Dan Suciu, A formal analysis of information disclosure in data exchange, Proceedings of the 2004 ACM SIGMOD international conference on Management of data, June 13-18, 2004, Paris, France
	Gerome Miklau , Dan Suciu, A formal analysis of information disclosure in data exchange, Journal of Computer and System Sciences, v.73 n.3, p.507-534, May, 2007

Collaborative Colleagues:

François Bancilhon: colleagues

Nicolas Spyratos: colleagues

Adobe Acrobat

QuickTime

Windows Media Player

Real Player