Re: [HACKERS] Cube Index Size

2011-06-04 Thread Nick Raj
2011/6/2 Teodor Sigaev > Can we figure out some information about index i.e. whet is the height >> of index tree, how many values are placed in one leaf node and one non >> leaf level node? >> > > http://www.sigaev.ru/cvsweb/cvsweb.cgi/gevel/ For improving space utilization, When node is split

Re: [HACKERS] Cube Index Size

2011-06-02 Thread Teodor Sigaev
Can we figure out some information about index i.e. whet is the height of index tree, how many values are placed in one leaf node and one non leaf level node? http://www.sigaev.ru/cvsweb/cvsweb.cgi/gevel/ -- Teodor Sigaev E-mail: teo...@sigaev.ru

Re: [HACKERS] Cube Index Size

2011-06-01 Thread Nick Raj
2011/6/1 Alexander Korotkov > 2011/6/1 Teodor Sigaev >> >> One of idea is add sorting of Datums to be splitted by cost of insertion. >> It's implemented in intarray/tsearch GiST indexes. >> > > Yes, it's a good compromise between linear and quadratic entries > distribution algorithms. In quadrat

Re: [HACKERS] Cube Index Size

2011-06-01 Thread Alexander Korotkov
2011/6/1 Teodor Sigaev > > One of idea is add sorting of Datums to be splitted by cost of insertion. > It's implemented in intarray/tsearch GiST indexes. > Yes, it's a good compromise between linear and quadratic entries distribution algorithms. In quadratic algorithm each time entry with maximal

Re: [HACKERS] Cube Index Size

2011-06-01 Thread Teodor Sigaev
Ok, I can reproduce the issue with that. The index is only 4MB in size when I populate it with random data (vs. 15 MB with your data). The command I used is: INSERT INTO cubtest SELECT cube(random(), random()) FROM generate_series(1,2); My guess is that the picksplit algorithm performs poorl

Re: [HACKERS] Cube Index Size

2011-06-01 Thread Alexander Korotkov
On Wed, Jun 1, 2011 at 3:37 PM, Heikki Linnakangas < heikki.linnakan...@enterprisedb.com> wrote: > My guess is that the picksplit algorithm performs poorly with that data. > Unfortunately, I have no idea how to improve that. Current cube picksplit function have no storage utilization guarantees,

Re: [HACKERS] Cube Index Size

2011-06-01 Thread Heikki Linnakangas
On 01.06.2011 10:48, Nick Raj wrote: On Tue, May 31, 2011 at 12:46 PM, Heikki Linnakangas< heikki.linnakan...@enterprisedb.com> wrote: If not, please post a self-contained test case to create and populate the table, so that others can easily try to reproduce it. I have attached .sql file

Re: [HACKERS] Cube Index Size

2011-05-31 Thread Nicolas Barbier
2011/5/30, Nick Raj : > 3. When tuples are 5 lakh For the benefit of the others: "5 lakh" seems to mean 500,000. http://en.wikipedia.org/wiki/Lakh> Nicolas -- A. Because it breaks the logical sequence of discussion. Q. Why is top posting bad? -- Sent via pgsql-hackers mailing list (pgsql-ha

Re: [HACKERS] Cube Index Size

2011-05-31 Thread Heikki Linnakangas
On 30.05.2011 21:51, Nick Raj wrote: Hi, Cube code provided by postgres contrib folder. It uses the NDBOX structure. On creating index, it's size increase at a high rate. On inserting some tuple and creating indexes its behaviour is shown below. 1. When there is only one tuple select pg_s

[HACKERS] Cube Index Size

2011-05-30 Thread Nick Raj
Hi, Cube code provided by postgres contrib folder. It uses the NDBOX structure. On creating index, it's size increase at a high rate. On inserting some tuple and creating indexes its behaviour is shown below. 1. When there is only one tuple select pg_size_pretty(pg_relation_size('cubtest'));

[HACKERS] Cube Index Size

2011-05-30 Thread Nick Raj
Hi, Cube code provided by postgres contrib folder. It uses the NDBOX structure. On creating index, it's size increase at a high rate. On inserting some tuple and creating indexes its behaviour is shown below. 1. When there is only one tuple select pg_size_pretty(pg_relation_ size('cubtest'))