Hello devs,
I'm trying to understand how sorting exactly works in Postgres, I've understood
that there are two sorting mechanisms depending on the size of the data, one
being qsort which is initiated if workmem is < 1024 kb and the other being
external sort which is initiated in the other case.
ferred to GPU devices.>Any pointer on host address space is
>not valid on GPU calculation.>Amount of device memory is usually smaller than
>host memory, so your code>needs a capability to combined multiple chunks that
>is partially sorted...>Probably, it is not all here.
Aren't there algorithms which help you if the device memory is limited and the
data is massive? I have a rough memory because I did a course online, where I
saw algorithms to deal with such problems I suppose.
Thanks and Regards,Hitesh Ramani
s I saw, Postgres uses external sort for that.
If you feel this isn't feasible in such a time span, I would love to hear any
suggestion for any small function which can leverage off by parallelism.
Thanks and Regards,Hitesh Ramani
integrated CUDA execution and the code needs to be optimized as per CUDA.
Please give in your valuable suggestions and views on this.
Thanks and Regards,Hitesh Ramani
Hello Peter,
> > 1. As I did some research on this project, I found *date_trunc()
> > supporting intervals‏ *was suggested last year but not selected as a
> > GSoC project. Is it being floated this year too(as mentioned on the GSoC
> > 2015 wiki page of Postgres)? If yes, what are the exact expect
Hello,
I introduced myself on the pgsql-students list but just to introduce here too,
my name is Hitesh Ramani, I'm a student of Hyderabad Central University,
Hyderabad, India. Currently I'm pursuing a project in PostgreSQL as my Post
Graduation project hence I've hacked into th
