On the rewriting and efficient computation of bound disjunctive datalog queries

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: Sergio Greco University of Calabria, Rende - Italy
Ester Zumpano University of Calabria, Rende - Italy
Published in:
Cover Image
 
· Proceeding
PPDP '03 Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Pages 136 - 147
ACM New York, NY, USA ©2003
table of contents ISBN:1-58113-705-2 doi>10.1145/888251.888265
On the rewriting and efficient computation of bound disjunctive datalog queries Published by ACM 2003 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 5
· Downloads (cumulative): 141
· Citation Count: 0


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