Memory-efficient groupby-aggregate using compressed buffer trees. Amur, H., Richter, W., Andersen, D. G., Kaminsky, M., Schwan, K., Balachandran, A., & Zawadzki, E. In SoCC, pages 18:1-18:16, 2013. ACM.
Memory-efficient groupby-aggregate using compressed buffer trees. [link]Link  Memory-efficient groupby-aggregate using compressed buffer trees. [link]Paper  bibtex   
@inproceedings{conf/cloud/AmurRAKSBZ13,
  author = {Amur, Hrishikesh and Richter, Wolfgang and Andersen, David G. and Kaminsky, Michael and Schwan, Karsten and Balachandran, Athula and Zawadzki, Erik},
  booktitle = {SoCC},
  crossref = {conf/cloud/2013},
  editor = {Lohman, Guy M.},
  ee = {http://doi.acm.org/10.1145/2523616.2523625},
  interhash = {e165123efaeeaf2d0938b8456d469e82},
  intrahash = {d5e9baf63c2afc1a09134c756682eb21},
  isbn = {978-1-4503-2428-1},
  pages = {18:1-18:16},
  publisher = {ACM},
  title = {Memory-efficient groupby-aggregate using compressed buffer trees.},
  url = {http://dblp.uni-trier.de/db/conf/cloud/socc2013.html#AmurRAKSBZ13},
  year = 2013
}

Downloads: 0