On searching compressed string collections cache-obliviously

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Paolo Ferragina Università di Pisa, Pisa, Italy
Roberto Grossi Università di Pisa, Pisa, Italy
Ankur Gupta Butler University, Indianapolis, IN, USA
Rahul Shah Louisiana State University, Baton Rouge, LA, USA
Jeffrey Scott Vitter Purdue University, West Lafayette, IN, USA
On searching compressed string collections cache-obliviously Published by ACM 2008 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 48
· Downloads (cumulative): 400
· Citation Count: 9

Published in:
Cover Image
 
· Proceeding
PODS '08 Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Pages 181-190
ACM New York, NY, USA ©2008
table of contents ISBN: 978-1-60558-152-1 doi>10.1145/1376916.1376943

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