SIGN IN
SIGN UP
From datalog rules to efficient programs with time and space guarantees
Full Text:
Pdf
Buy this Article
Authors:
Yanhong A. Liu
State University of New York at Stony Brook, Stony Brook, NY
Scott D. Stoller
State University of New York at Stony Brook, Stony Brook, NY
Published in:
· Proceeding
PPDP '03
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Pages 172 - 183
ACM
New York, NY
, USA
©2003
table of contents
ISBN:1-58113-705-2
doi>
10.1145/888251.888268
2003 Article
Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 12
· Downloads (cumulative): 332
· Citation Count: 14
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
arrays
code generation
complexity analysis
computations on discrete structures
constraint and logic languages
data structure design
datalog
incremental computation
indexed representations
indexing
languages
linked representations
linked representations
lists, stacks, and queues
optimization
optimization
performance
program transformation
program transformation
query languages
query processing
records
recursion
rule-based databases
tabling
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