Direct transitive closure algorithms: design and performance evaluation

doi:10.1145/88636.88888

Direct transitive closure algorithms: design and performance evaluation

Full Text:

Pdf

Buy this Article

Authors:	Rakesh Agrawal	AT&T Bell Labs, Murray Hill, NJ
	Shaul Dar	AT&T Bell Labs, Murray Hill, NJ
	H. V. Jagadish	AT&T Bell Labs, Murray Hill, NJ

Published in:

· Journal

ACM Transactions on Database Systems (TODS) TODS Homepage archive

Volume 15 Issue 3, Sept. 1990
Pages 427 - 458
ACM New York, NY, USA
table of contents doi>10.1145/88636.88888

	1990 Article
Bibliometrics
· Downloads (6 Weeks): 5 · Downloads (12 Months): 44 · Downloads (cumulative): 901 · Citation Count: 34

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref

Share:

|

Tags: algorithms deductive databases design experimentation general general nonnumerical algorithms and problems performance problem solving, control methods, and search query processing transitive closure

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