Re: [HACKERS] GSOC Student Project Idea

2013-05-11 Thread Michael Schuh
On Wed, May 8, 2013 at 1:48 PM, Jim Nasby wrote: > On 5/8/13 3:54 AM, Heikki Linnakangas wrote: > >> On 24.04.2013 14:31, Florian Pflug wrote: >> >>> On Apr23, 2013, at 23:25 , Alexander Korotkov >>> wrote: >>> I've taken a brief look on the paper and implementation. As I can see iDista

Re: [HACKERS] GSOC Student Project Idea

2013-05-08 Thread Jim Nasby
On 5/8/13 3:54 AM, Heikki Linnakangas wrote: On 24.04.2013 14:31, Florian Pflug wrote: On Apr23, 2013, at 23:25 , Alexander Korotkov wrote: I've taken a brief look on the paper and implementation. As I can see iDistance implements some global building strategy. I mean, for example, it selects s

Re: [HACKERS] GSOC Student Project Idea

2013-05-08 Thread Heikki Linnakangas
On 24.04.2013 22:10, Michael Schuh wrote: Thank you both for the very helpful feedback. Perhaps the scope of this project (application's "completeness criteria") is better as a feasibility prototyping of the global/distance-based index strategy with B+-tree and/or GiST extension possibilities.

Re: [HACKERS] GSOC Student Project Idea

2013-05-08 Thread Heikki Linnakangas
On 24.04.2013 14:31, Florian Pflug wrote: On Apr23, 2013, at 23:25 , Alexander Korotkov wrote: I've taken a brief look on the paper and implementation. As I can see iDistance implements some global building strategy. I mean, for example, it selects some point, calculates distances from selected

Re: [HACKERS] GSOC Student Project Idea

2013-04-24 Thread Michael Schuh
On Wed, Apr 24, 2013 at 5:31 AM, Florian Pflug wrote: > On Apr23, 2013, at 23:25 , Alexander Korotkov > wrote: > > I've taken a brief look on the paper and implementation. As I can see > iDistance implements some global building strategy. I mean, for example, it > selects some point, calculates

Re: [HACKERS] GSOC Student Project Idea

2013-04-24 Thread Florian Pflug
On Apr23, 2013, at 23:25 , Alexander Korotkov wrote: > I've taken a brief look on the paper and implementation. As I can see > iDistance implements some global building strategy. I mean, for example, it > selects some point, calculates distances from selected point to all points in > dataset et

Re: [HACKERS] GSOC Student Project Idea

2013-04-23 Thread Alexander Korotkov
Michael, On Mon, Apr 22, 2013 at 4:28 PM, Michael Schuh wrote: > Although I do not have a lot of experience with PostgreSQL development, I > am eager to learn and commit my summer to enabling another fantastic > feature for the community. Since iDistance is a non-recursive, data-driven, > space-

Re: [HACKERS] GSOC Student Project Idea

2013-04-23 Thread Alvaro Herrera
Michael Schuh escribió: > http://www.cs.montana.edu/~timothy.wylie/files/bncod13.pdf Um. From the paper I get the impression that there's yet much to learn in order for this indexing method to be really effective? -- Álvaro Herrerahttp://www.2ndQuadrant.com/ PostgreSQL Developm

Re: [HACKERS] GSOC Student Project Idea

2013-04-22 Thread Stephen Frost
Michael, * Michael Schuh (schuh.m...@gmail.com) wrote: > In brief, I would like to implement a state-of-the-art indexing algorithm > (named iDistance) directly in PostgreSQL using GiST or SP-GiST trees and > whatever means necessary. For my 2c, this sounds fantastic. Excellent project idea and