Re: Design Problem: Searching large set of protected documents

2007-04-03 Thread Jonathan O'Connor
Erick, thanks for the tips. I guess I'll have to dust off my copy of LIA and get cracking. BTW, in our system a user is just a group with a single fixed member of itself. Ciao, Jonathan O'Connor X

Re: Design Problem: Searching large set of protected documents

2007-04-03 Thread Jonathan O'Connor
and late binding of security information. Early binding is faster, but harder to implement. And of course, I implemented the easier one. I'm going to see what the computational and storage cost will be if I precalculate this info. Ciao, Jonathan O'Connor X

Design Problem: Searching large set of protected documents

2007-04-03 Thread Jonathan O'Connor
before, and if so what approach did you take? I guess I could precalculate the permissions for every user-document pair, but that's alot of storage, and a lot of precalculation! I await the list's accumulated wisdom with eagerness and interest. Thanks, Jonathan O'Connor XCOM Dublin

Re: Analysis/tokenization of compound words

2006-09-19 Thread Jonathan O'Connor
lso. Note if we went for the short words first, then we could split it into: Ballett | taenzer | in. As usual, its an interesting project with no 100% perfect solution. Best of luck Jonathan O'Connor XCOM Dublin Otis Gospodnetic <[EMAIL PROTECTED]> Otis Gospod

Re: Stemming german words

2006-01-31 Thread Jonathan O'Connor
ost users won't have a problem with that. If they want want to search for addiction, then they will probably add "drug" or "alcohol", etc... to the search. Ciao, Jonathan O'Connor XCOM Dublin Markus Fischer <[EMAIL PROTECTED]> Markus Fischer