Efficient evaluation of n-ary conjunctive queries over trees and graphs

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: François Bry University of Munich, Munich, Germany
Tim Furche University of Munich, Munich, Germany
Benedikt Linse University of Munich, Munich, Germany
Andreas Schroeder University of Munich, Munich, Germany
Efficient evaluation of n-ary conjunctive queries over trees and graphs Published by ACM 2006 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 10
· Downloads (cumulative): 227
· Citation Count: 5

Published in:
· Proceeding
WIDM '06 Proceedings of the 8th annual ACM international workshop on Web information and data management
Pages 11 - 18
ACM New York, NY, USA ©2006
table of contents ISBN:1-59593-525-8 doi>10.1145/1183550.1183555

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