SIGN IN
SIGN UP
Finding nonrecursive envelopes for Datalog predicate
Full Text:
PDF
Buy this Article
Author:
Surajit Chaudhuri
Published in:
· Proceeding
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Pages 135-146
ACM
New York, NY
, USA
©1993
table of contents
ISBN:0-89791-593-3
doi>
10.1145/153850.153862
1993 Article
Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 11
· Downloads (cumulative): 152
· Citation Count: 8
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
SIGMOD/PODS'13
Share:
|
Tags:
algorithms
computations on discrete structures
datalog
languages
query formulation
theory
verification
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder