Github user manishamde commented on the pull request:
https://github.com/apache/spark/pull/2780#issuecomment-59664847
@jkbradley I read the paper by Sanku et al and other papers but they
required a custom implementation. The sort method has worked OK so far but I
was hoping somebody would implement a generic quantile approximation algorithm
for Spark that is O(n) and requires limited memory. I think such methods exist
in other libraries such as
[Algebird](http://twitter.github.io/algebird/com/twitter/algebird/QTree$.html)
and [Tdigest](https://github.com/tdunning/t-digest). We should also look
whether BlinkDB has attempted to tackle this problem.
---
If your project is set up for it, you can reply to this email and have your
reply appear on GitHub as well. If your project does not have this feature
enabled and wishes so, or if the feature is enabled but not working, please
contact infrastructure at [email protected] or file a JIRA ticket
with INFRA.
---
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]
