Re: WIP: index support for regexp search
Alexander Korotkov <aekorotkov@gmail.com>
From: Alexander Korotkov <aekorotkov@gmail.com>
To: Heikki Linnakangas <hlinnakangas@vmware.com>
Cc: Tom Lane <tgl@sss.pgh.pa.us>, Tomas Vondra <tv@fuzzy.cz>, Erik Rijkers <er@xs4all.nl>, pgsql-hackers@postgresql.org, pavel.stehule@gmail.com
Date: 2012-12-13T21:34:01Z
Lists: pgsql-hackers
Commits
Same data as JSON:
GET /api/v1/messages/:b64id/commits
the thread's linked commits as JSON, with link sources.
API reference →
-
Fix filling of postmaster.pid in bootstrap/standalone mode.
- c29947722955 9.3.0 cited
-
Add explicit casts in ilist.h's inline functions.
- e78d288c895b 9.3.0 cited
On Mon, Dec 3, 2012 at 4:31 PM, Alexander Korotkov <aekorotkov@gmail.com>wrote: > Actually, I generally dislike path matrix for same reasons. But: > 1) Output graphs could contain trigrams which are completely useless for > search. For example, for regex /(abcdefgh)*ijk/ we need only "ijk" trigram > while graph would contain much more.Path matrix is a method to get rid of > all of them. > 2) If we use color trigrams then we need some criteria for which color > trigrams to expand into trigrams. Simultaneously, we shouldn't allow path > from initial state to the final by unexpanded trigrams. It seems much > harder to do with graph than with matrix. > Now, I have an idea about doing some not comprehensive but simple and fast simplification of graph. I'm doing experiments now. In case of success we could get rid of path matrix. ------ With best regards, Alexander Korotkov.