Worst-case complexity analysis of methods for logic query implementation

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: A. Marchetti-Spaccamella Dipartimento di Informatica e Slstemistica, Università di Roma "La Saptenza", Rome, Italy
A. Pelaggi Dipartimento di Informatica e Slstemistica, Università di Roma "La Saptenza", Rome, Italy
D. Sacca Dipartimento di Sistemi, Università della Calabria and CRAI, Rende, Italy
Published in:
· Proceeding
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Pages 294-301
ACM New York, NY, USA ©1987
table of contents ISBN:0-89791-223-3 doi>10.1145/28659.28691
Worst-case complexity analysis of methods for logic query implementation Published by ACM 1987 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 9
· Downloads (cumulative): 143
· Citation Count: 16


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