Re: [GENERAL] list or regular expressions

2006-06-26 Thread Mischa Sandberg
Rhys Stewart wrote: Hi all, can i search in a list or regular expressioneg "select yadi from ya where yadiya in ('old', 'ulk', 'orb')" but instead of in ther'd be another operator or a LIKE IN. so it'd be a shorcut for typing yadiya ~* 'old' or yadiya ~* 'ulk' etc.

Re: [PERFORM] [GENERAL] "Hash index" vs. "b-tree index" (PostgreSQL

2005-05-10 Thread Mischa Sandberg
Quoting Bruce Momjian : > > Is there a TODO anywhere in this discussion? If so, please let me > know. > Umm... I don't think so. I'm not clear on what TODO means yet. 'Up for consideration'? If a "TODO" means committing to do, I would prefer to follow up on a remote-schema (federated server)

Re: [PERFORM] [GENERAL] "Hash index" vs. "b-tree index" (PostgreSQL

2005-05-10 Thread Mischa Sandberg
Quoting Bruce Momjian : > Mischa Sandberg wrote: > > Quoting Bruce Momjian : > > > Is there a TODO anywhere in this discussion? If so, please let > me > > > know. > > > > > > > Umm... I don't think so. I'm not clear on what TOD

Re: [PERFORM] [GENERAL] "Hash index" vs. "b-tree index" (PostgreSQL

2005-05-10 Thread Mischa Sandberg
Quoting Mark Lewis <[EMAIL PROTECTED]>: > If the original paper was published in 1984, then it's been more than > 20 years. Any potential patents would already have expired, no? Don't know, but the idea is pervasive among different vendors ... perhaps that's a clue. And having now read beyond

Re: [PERFORM] [GENERAL] "Hash index" vs. "b-tree index" (PostgreSQL

2005-05-10 Thread Mischa Sandberg
Quoting Tom Lane <[EMAIL PROTECTED]>: > Mischa Sandberg <[EMAIL PROTECTED]> writes: > > The PG hash join is the simplest possible: build a hash table in > memory, and match an input stream against it. > > [ raised eyebrow... ] Apparently you've not read the

Re: [PERFORM] [GENERAL] "Hash index" vs. "b-tree index" (PostgreSQL

2005-05-10 Thread Mischa Sandberg
Quoting "Jim C. Nasby" <[EMAIL PROTECTED]>: > Well, in a hash-join right now you normally end up feeding at least > one > side of the join with a seqscan. Wouldn't it speed things up > considerably if you could look up hashes in the hash index instead? You might want to google on "grace hash" and