Tractable database design through bounded treewidth

doi:10.1145/1142351.1142370

Tractable database design through bounded treewidth

Full Text:

Pdf

Buy this Article

Authors:	Georg Gottlob	Technische Universität Wien, Vienna, Austria
	Reinhard Pichler	Technische Universität Wien, Vienna, Austria
	Fang Wei	Technische Universität Wien, Vienna, Austria

Published in:

	· Proceeding
	PODS '06 Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
	ACM New York, NY, USA ©2006 table of contents ISBN:1-59593-318-2 doi>10.1145/1142351.1142370

	2006 Article
Bibliometrics
· Downloads (6 Weeks): 15 · Downloads (12 Months): 40 · Citation Count: 7

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 '12

Tags: algorithms alternation and nondeterminism bounded treewidth complexity of proof procedures computations on discrete structures data models database design design fixed-parameter tractability normal forms normal forms parallelism and concurrency schema and subschema theory tree decomposition

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2012 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player