Re: [HACKERS] R-Tree implementation using GiST

2001-01-23 Thread Bruce Momjian

I have added the URL to the GIST SGML docs.

 Hi,
 
 I've put R-Tree realization using GiST (yet another test of our changes in

 gist code )on my gist page http://www.sai.msu.su/~megera/postgres/gist/
 

 Also, I've put some GiST related papers for interested readers.
 The package( contrib-rtree_box_gist.tar.gz ) is built for 7.1.
 If you find it's interesting you may include it into contrib area for 7.1
 
 from README.rtree_box_gist:
 
 
 1. One interesting thing is that insertion time for built-in R-Tree is
about 8 times more than ones for GiST implementation of R-Tree !!!
 2. Postmaster requires much more memory for built-in R-Tree
 3. Search time depends on dataset. In our case we got:
 ++---+--+
 |Number boxes|R-tree, sec|R-tree using  |
 ||   |   GiST, sec  |
 ++---+--+
 |  10|  0.002| 0.002|
 ++---+--+
 | 100|  0.002| 0.002|
 ++---+--+
 |1000|  0.002| 0.002|
 ++---+--+
 |   1|  0.015| 0.025|
 ++---+--+
 |   2|  0.029| 0.048|
 ++---+--+
 |   4|  0.055| 0.092|
 ++---+--+
 |   8|  0.113| 0.178|
 ++---+--+
 |  16|  0.338| 0.337|
 ++---+--+
 |  32|  0.674| 0.673|
 ++---+--+
 
 
   Regards,
   Oleg
 _
 Oleg Bartunov, sci.researcher, hostmaster of AstroNet,
 Sternberg Astronomical Institute, Moscow University (Russia)
 Internet: [EMAIL PROTECTED], http://www.sai.msu.su/~megera/
 phone: +007(095)939-16-83, +007(095)939-23-83
 
 


-- 
  Bruce Momjian|  http://candle.pha.pa.us
  [EMAIL PROTECTED]   |  (610) 853-3000
  +  If your life is a hard drive, |  830 Blythe Avenue
  +  Christ can be your backup.|  Drexel Hill, Pennsylvania 19026



[HACKERS] R-Tree implementation using GiST

2001-01-14 Thread Oleg Bartunov

Hi,

I've put R-Tree realization using GiST (yet another test of our changes in
gist code )on my gist page http://www.sai.msu.su/~megera/postgres/gist/
Also, I've put some GiST related papers for interested readers.
The package( contrib-rtree_box_gist.tar.gz ) is built for 7.1.
If you find it's interesting you may include it into contrib area for 7.1

from README.rtree_box_gist:


1. One interesting thing is that insertion time for built-in R-Tree is
   about 8 times more than ones for GiST implementation of R-Tree !!!
2. Postmaster requires much more memory for built-in R-Tree
3. Search time depends on dataset. In our case we got:
++---+--+
|Number boxes|R-tree, sec|R-tree using  |
||   |   GiST, sec  |
++---+--+
|  10|  0.002| 0.002|
++---+--+
| 100|  0.002| 0.002|
++---+--+
|1000|  0.002| 0.002|
++---+--+
|   1|  0.015| 0.025|
++---+--+
|   2|  0.029| 0.048|
++---+--+
|   4|  0.055| 0.092|
++---+--+
|   8|  0.113| 0.178|
++---+--+
|  16|  0.338| 0.337|
++---+--+
|  32|  0.674| 0.673|
++---+--+


Regards,
Oleg
_
Oleg Bartunov, sci.researcher, hostmaster of AstroNet,
Sternberg Astronomical Institute, Moscow University (Russia)
Internet: [EMAIL PROTECTED], http://www.sai.msu.su/~megera/
phone: +007(095)939-16-83, +007(095)939-23-83