Expressive power and data complexity of nonrecursive query languages for lists and trees (extended abstract)

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Evgeny Dantsin St.Petersburg Institute of Mathematics and University of Manchester
Andrei Voronkov University of Manchester
Published in:
Cover Image
 
· Proceeding
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Pages 157-165
ACM New York, NY, USA ©2000
table of contents ISBN:1-58113-214-X doi>10.1145/335168.335218
Expressive power and data complexity of nonrecursive query languages for lists and trees (extended abstract) Published by ACM 2000 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 8
· Downloads (cumulative): 259
· 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