I/O cost minimization: reachability queries processing over massive graphs

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Zhiwei Zhang Chinese Univ. of Hong Kong, Hong Kong, China
Jeffrey Xu Yu Chinese Univ. of Hong Kong, Hong Kong, China
Lu Qin Chinese Univ. of Hong Kong, Hong Kong, China
Qing Zhu Renmin University of China, Beijing, China
Xiaofang Zhou University of Queensland, Queensland, Australia
I/O cost minimization: reachability queries processing over massive graphs Published by ACM 2012 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 14
· Downloads (12 Months): 65
· Downloads (cumulative): 65
· Citation Count: 0

Published in:
· Proceeding
EDBT '12 Proceedings of the 15th International Conference on Extending Database Technology
Pages 468-479
ACM New York, NY, USA ©2012
table of contents ISBN: 978-1-4503-0790-1 doi>10.1145/2247596.2247651

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