Efficient bulk insertion into a distributed ordered table

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Adam Silberstein Yahoo! Research, Santa Clara, CA, USA
Brian F. Cooper Yahoo! Research, Santa Clara, CA, USA
Utkarsh Srivastava Yahoo! Research, Santa Clara, CA, USA
Erik Vee Yahoo! Research, Santa Clara, CA, USA
Ramana Yerneni Yahoo! Research, Santa Clara, CA, USA
Raghu Ramakrishnan Yahoo! Research, Santa Clara, CA, USA
Efficient bulk insertion into a distributed ordered table Published by ACM 2008 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 5
· Downloads (12 Months): 56
· Downloads (cumulative): 714
· Citation Count: 8

Published in:
Cover Image
 
· Proceeding
SIGMOD '08 Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Pages 765-778
ACM New York, NY, USA ©2008
table of contents ISBN: 978-1-60558-102-6 doi>10.1145/1376616.1376693

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