Fast algorithms for universal quantification in large databases

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: Goetz Graefe Microsoft Corp., One Microsoft Way, Redmond, WA
Richard L. Cole Redbrick Systems
Published in:
· Journal
ACM Transactions on Database Systems (TODS) TODS Homepage archive
Volume 20 Issue 2, June 1995
Pages 187 - 236
ACM New York, NY, USA
table of contents doi>10.1145/210197.210202
Fast algorithms for universal quantification in large databases Published by ACM 1995 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 23
· Downloads (cumulative): 648
· Citation Count: 9


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder