A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort.

Zvi Galil, Nimrod Megiddo: A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort. J. ACM 26(1): 58-64(1979)

@article{DBLP:journals/jacm/GalilM79,
  author    = {Zvi Galil and
               Nimrod Megiddo},
  title     = {A Fast Selection Algorithm and the Problem of Optimum Distribution
               of Effort},
  journal   = {J. ACM},
  volume    = {26},
  number    = {1},
  year      = {1979},
  pages     = {58-64},
  ee        = {db/journals/jacm/GalilM79.html, http://doi.acm.org/10.1145/322108.322114},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

BibTeX

Online Edition

Citation Page BibTeX

Referenced by

Joel L. Wolf, Daniel M. Dias, Philip S. Yu, John Turek: New Algorithms for Parallelizing Relational Database Joins in the Presence of Data Skew. IEEE Trans. Knowl. Data Eng. 6(6): 990-997(1994)
Joel L. Wolf, Balakrishna R. Iyer, Krishna R. Pattipati, John Turek: Optimal Buffer Partitioning for the Nested Block Join Algorithm. ICDE 1991: 510-519

BibTeX