On Tue, Jul 2, 2013 at 12:36 PM, Peter Geoghegan wrote:
> On Tue, Jul 2, 2013 at 5:04 AM, Atri Sharma wrote:
>>> I think if you'll try it you'll find that we perform quite well on
>>> data sets of this kind - and if you read the code you'll see why.
>>
>> Right, let me read the code again from th
On Tue, Jul 2, 2013 at 5:04 AM, Atri Sharma wrote:
>> I think if you'll try it you'll find that we perform quite well on
>> data sets of this kind - and if you read the code you'll see why.
>
> Right, let me read the code again from that viewpoint.
In my opinion, it would be worthwhile reading th
On Tue, Jul 2, 2013 at 5:20 PM, Robert Haas wrote:
> On Tue, Jul 2, 2013 at 12:33 AM, Atri Sharma wrote:
>>> If you want to get a useful response to your emails, consider
>>> including a statement of what you think the problem is and why you
>>> think your proposed changes will help. Consider of
On Tue, Jul 2, 2013 at 12:33 AM, Atri Sharma wrote:
>> If you want to get a useful response to your emails, consider
>> including a statement of what you think the problem is and why you
>> think your proposed changes will help. Consider offering a test case
>> that performs badly and an analysis
On Tue, Jul 2, 2013 at 1:02 AM, Robert Haas wrote:
> On Sun, Jun 30, 2013 at 8:30 AM, Atri Sharma wrote:
>> I have been reading the recent discussion and was researching a bit, and I
>> think that we should really go with the idea of randomising the input
>> data(if it is not completely presort
On Mon, Jul 1, 2013 at 4:31 PM, Claudio Freire wrote:
> What?
>
> A median of medians algorithm will guarantee floor(N/2) elements on
> the smaller. That's the definition of median.
>
> Note that I'm referring to picking the actual median of all tuples,
> not just a sample. That's slow, but it gua
On Mon, Jul 1, 2013 at 12:32 PM, Robert Haas wrote:
>> I have been reading the recent discussion and was researching a bit, and I
>> think that we should really go with the idea of randomising the input
>> data(if it is not completely presorted), to ensure that we do not get
>> quadratic comple
On Mon, Jul 1, 2013 at 5:12 PM, Robert Haas wrote:
> On Mon, Jul 1, 2013 at 3:54 PM, Claudio Freire wrote:
>> On Mon, Jul 1, 2013 at 4:32 PM, Robert Haas wrote:
This shouldn't be too complex, and should give us a fixed nlogn complexity
even for wild data sets, without affecting existi
On Mon, Jul 1, 2013 at 3:54 PM, Claudio Freire wrote:
> On Mon, Jul 1, 2013 at 4:32 PM, Robert Haas wrote:
>>> This shouldn't be too complex, and should give us a fixed nlogn complexity
>>> even for wild data sets, without affecting existing normal data sets that
>>> are present in every day tr
On Mon, Jul 1, 2013 at 4:32 PM, Robert Haas wrote:
>> This shouldn't be too complex, and should give us a fixed nlogn complexity
>> even for wild data sets, without affecting existing normal data sets that
>> are present in every day transactions. I even believe that those data sets
>> will als
On Sun, Jun 30, 2013 at 8:30 AM, Atri Sharma wrote:
> I have been reading the recent discussion and was researching a bit, and I
> think that we should really go with the idea of randomising the input data(if
> it is not completely presorted), to ensure that we do not get quadratic
> complexity
On Mon, Jul 1, 2013 at 10:02 PM, David Fetter wrote:
> On Mon, Jul 01, 2013 at 04:42:04AM -0700, jasmine wrote:
>> My PostgresSQL (9.2) is crashing after certain load tests. Currently,
>> postgressql is crashing when simulatenously 800 to 1000 threads are run on a
>> 10 million records schema. Not
On Mon, Jul 01, 2013 at 04:42:04AM -0700, jasmine wrote:
> My PostgresSQL (9.2) is crashing after certain load tests. Currently,
> postgressql is crashing when simulatenously 800 to 1000 threads are run on a
> 10 million records schema. Not sure, if we have to tweak some more
> parameters of postgr
My PostgresSQL (9.2) is crashing after certain load tests. Currently,
postgressql is crashing when simulatenously 800 to 1000 threads are run on a
10 million records schema. Not sure, if we have to tweak some more
parameters of postgres.
-
jasmine
--
View this message in context:
http://po
14 matches
Mail list logo
