cpp
$./a.out > /tmp/words
--
Best Regards,
Xiao Meng
DKERC, Harbin Institute of Technology, China
Gtalk: [EMAIL PROTECTED]
MSN: [EMAIL PROTECTED]
http://xiaomeng.yo2.cn
//-- //
//
// FILE NAME : X937out.cpp
//
// DESC
sorry, I made some mistake here.
The time of the script on two indexes should be
btree: 1/0.174700=5.724098s
hash-patch: 1/0.199900=5.00250125s
On Wed, Aug 6, 2008 at 9:33 AM, Xiao Meng <[EMAIL PROTECTED]> wrote:
> Hi, hackers. Here is some test I run on a bigger set.
>
> Use
= 0.199900 (excluding connections establishing)
--
Best Regards,
Xiao Meng
DKERC, Harbin Institute of Technology, China
Gtalk: [EMAIL PROTECTED]
MSN: [EMAIL PROTECTED]
http://xiaomeng.yo2.cn
if (isNull)
return false;
if (key->sk_flags & SK_ISNULL)
return false;
test = FunctionCall2(&key->sk_func, datum, key->sk_argument);
if (!DatumGetBool(test))
return false;
key++;
scanKeySize--;
t; 10^6
> 10^7
> 10^8
>
> --
> Simon Riggs www.2ndQuadrant.com
> PostgreSQL Training, Services and Support
>
>
--
Best Regards,
Xiao Meng
DKERC, Harbin Institute of Technology, China
Gtalk: [EMAIL PROTECTED]
MSN: [EMAIL PROTECTED]
http://xiaomeng.yo2.cn
--
Currently, I've made some optimization Tom advised and removed the
macro HASHVALUE_ONLY. And I'm working on fixing the problem that it
crashed in large data set.
I'll post a new patch later.
Thank you for all your advice and test.
--
Best Regards,
Xiao Meng
DKERC, Harbin Institute
h.h to get the
original implementation.
It's a preliminary implementation and I'm looking for input here.
Hope to hear from you.
--
Best Regards,
Xiao Meng
DKERC, Harbin Institute of Technology, China
Gtalk: [EMAIL PROTECTED]
MSN: [EMAIL PROTECTED]
http://xiaomeng.yo2.cn
diff --git a/src
pdesc = CreateTemplateTupleDesc(1, false);
TupleDescInitEntry(tupdesc, 1, "hashcode", INT4OID, -1, 0);
}
firstcall = false;
return tupdesc;
}
but it failed because tupdesc is free later, IMHO.
Any advice?
--
Best Regards,
Xiao Meng
DKERC, Harbin Institute of Technology, Chin
maxbucket,
uint32 highmask, uint32 lowmask);
extern uint32 _hash_log2(uint32 num);
extern void _hash_checkpage(Relation rel, Buffer buf, int flags);
+extern TupleDesc _create_hash_desc();
+extern IndexTuple _hash_form_tuple(Relation rel, Datum* values, bool*
SHVALUE_ONLY
/* public routines */
@@ -330,6 +336,8 @@ extern Bucket _hash_hashkey2bucket(uint32 hashkey,
uint32 maxbucket,
uint32 highmask, uint32 lowmask);
extern uint32 _hash_log2(uint32 num);
extern void _hash_checkpage(Relation rel, Buffer buf, int flags);
+extern TupleDesc _create_hash_desc();
+e
structure HashItem to store it again;-)
On Tue, Jul 15, 2008 at 8:04 PM, Heikki Linnakangas
<[EMAIL PROTECTED]> wrote:
> Xiao Meng wrote:
>>
>> Hi, hackers.
>> I'm working on my gsoc project - improving hash index.
>> I need to create a TupldeDesc with uint32 attri
to create a tuple and
needn't write a function for hash specially.
I've tried lookup_rowtype_tupdesc() with INT4OID, but it dosen't work
since int is not composite type.
Is there any easy way to do it or I should change my design?
Hope to hear from you. Thanks!
--
Best Regards,
seems extremely easy. I'm trying to do it first.
Additionally, I need a benchmark to test the performance. It seems there's
some tools list in http://wiki.postgresql.org/wiki/Performances_QA_testing .
Any advice?
--
Have a good day;-)
Best Regards,
Xiao Meng
━━━
Da
ment or advices? Hope to hear from you,thanks!
And I think I should finish my proposal as soon as possible now, since
the deadline of application is coming.
Have a good day;-)
--
Best Regards,
Xiao Meng
━
Data and Knowledge Engineering Research Center,CS&T
Harbin Inst
14 matches
Mail list logo
