Hi Pavel,
Thanks for your quick answer. Can you please elaborate a bit more about the
points bellow.
On Tue, Dec 21, 2010 at 1:31 PM, Pavel Stehule wrote:
> Hello
>
> you can emulate it now.
>
> a) try to do a simple stored procedure, where you can wrap your query
>
Do you mean I should use PRE
Rich wrote:
I am wondering why anyone would do that? Too much overhead and no
reliable enough.
Apparently, NetApp thinks that it is reliable. They're selling that
stuff for years. I know that Oracle works with NetApp, they even have
their own user mode NFS client driver, I am not sure ab
On Tue, Dec 21, 2010 at 10:50 AM, Pavel Stehule wrote:
> 2010/12/21 Michael Ben-Nes :
>> Hi Pavel,
>>
>> Thanks for your quick answer. Can you please elaborate a bit more about the
>> points bellow.
>>
>> On Tue, Dec 21, 2010 at 1:31 PM, Pavel Stehule
>> wrote:
>>>
>>> Hello
>>>
>>> you can emula
I am wondering why anyone would do that? Too much overhead and no reliable
enough.
On Tue, Dec 21, 2010 at 2:28 PM, Mladen Gogala wrote:
> I was asked about performance of PostgreSQL on NetApp, the protocol should
> be NFSv3. Has anybody tried it? The database in question is a DW type, a
> bunc
I was asked about performance of PostgreSQL on NetApp, the protocol
should be NFSv3. Has anybody tried it? The database in question is a DW
type, a bunch of documents indexed by Sphinx. Does anyone have any
information?
--
Mladen Gogala
Sr. Oracle DBA
1500 Broadway
New York, NY 10036
(212)
2010/12/21 Michael Ben-Nes :
> Hi Pavel,
>
> Thanks for your quick answer. Can you please elaborate a bit more about the
> points bellow.
>
> On Tue, Dec 21, 2010 at 1:31 PM, Pavel Stehule
> wrote:
>>
>> Hello
>>
>> you can emulate it now.
>>
>> a) try to do a simple stored procedure, where you ca
pasman pasma*ski wrote:
> -> Index Scan using NTA_5" on "NumeryA" a
> (cost=0.01..10016.75 rows=24175 width=42) (actual
> time=0.132..308.018 rows=33597 loops=1)"
> seq_page_cost = 0.3
> random_page_cost = 0.5
Your data is heavily cached (to be able to read 33597 rows ran
hello.
I ve the table NumeryA with 3 indices. Query below uses incorrect index.
SELECT
A."NKA",
A."NTA",
Min("PołączeniaMin") || ',' || Max("PołączeniaMax") AS "Biling",
Sum("Ile")::text AS "Ilość CDR",
R."LP"::text AS "Sprawa",
R."Osoba weryfikująca" AS "Osoba",
to_char(min("Warto
On 12/20/2010 10:33 AM, James Cloos wrote:
And how exactly, given that the kernel does not know whether the CPU is
active or waiting on ram, could an application do so?
-JimC
That particular aspect will remain hidden, it's a domain of the hardware
architecture. Nevertheless, there are things l
Hello
you can emulate it now.
a) try to do a simple stored procedure, where you can wrap your query
b) use a FAST CALL API to call this procedure
c) use a some pool tool for pooling and persisting sessions
Regards
Pavel Stehule
2010/12/21 Michael Ben-Nes :
> Hi,
>
> Just stumbled on the follow
Hi,
Just stumbled on the following post:
http://yoshinorimatsunobu.blogspot.com/2010/10/using-mysql-as-nosql-story-for.html
The post claim that MySQL can do more qps then MemCahed or any other NoSQL
when doing simple queries like: SELECT * FROM table WHERE id=num;
And I wonder if:
1. Currently,
On Tue, Dec 21, 2010 at 04:35, Scott Marlowe wrote:
> On Mon, Dec 20, 2010 at 8:31 PM, tuanhoanganh wrote:
>> Is there any tool work on windows can open 200 connect to postgresql and
>> application connect to this tool to decrease time connect to PostgreSQL
>> (because PostgreSQL start new proce
12 matches
Mail list logo
