Hypertree decompositions and tractable queries

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Georg Gottlob Inst. für Informationssysteme, Technische Universität Wien, A-1040 Vienna, Austria
Nicola Leone Inst. für Informationssysteme, Technische Universität Wien, A-1040 Vienna, Austria
Francesco Scarcello ISI-CNR, Via P. Bucci 41/C, I-87030 Rende, Italy
Published in:
Cover Image
 
· Proceeding
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Pages 21-32
ACM New York, NY, USA ©1999
table of contents ISBN:1-58113-062-7 doi>10.1145/303976.303979
Hypertree decompositions and tractable queries Published by ACM 1999 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 19
· Downloads (cumulative): 891
· Citation Count: 30


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