On Feb 20, 2008, at 9:31 AM, Doug Steigerwald wrote:
A few months back I wrote a YAML update request handler to see if we
could post documents faster than with XMl. We did see some small
speed improvements (didn't write down the numbers), but the hacked
together code was probably making it
gracefully. And the Solr index is then
updated from the db periodically (we're optimized for faster search
results, over up-to-date-ness).
R
On 2/13/08, alexander lind <[EMAIL PROTECTED]> wrote:
Have you done any stress tests on this setup? Is it working well for
you?
It sounds like
that user to enteredUsers
3. the negation can now be done by excluding the user's unique id from
the enteredUsers field, instead of excluding all the user's campaigns
The downside is it will increase the number of your commits, which may
or may not be OK.
Rachel
On 2/13/08, alexand
Hi all
Say that I have a solr index with 5000 documents, each representing a
campaign that users of my site can join. The user can search and find
these campaigns in various ways, which is not a problem, but once a
user has found a campaign and joined it, I don't want that campaign to
eve
On Dec 21, 2007, at 9:56 AM, Ryan McKinley wrote:
solr does not do approximations. Faceting with large indexes (500K
is not particularly large) just requires RAM for reasonable
performance.
Give it a try, and see what you think.
Excellent, happy to hear that. Give it a try I will, pretty
On Dec 21, 2007, at 8:16 AM, Erik Hatcher wrote:
On Dec 21, 2007, at 1:33 AM, alexander lind wrote:
I have a pretty big app in the works, and in short it will need to
index a lot of items, with with some core attributes, and hundreds
of optional attributes for each item.
The app then
Hi List
I have a pretty big app in the works, and in short it will need to
index a lot of items, with with some core attributes, and hundreds of
optional attributes for each item.
The app then needs to be able to make queries like
'find all items with attributes attribute_1=yes, attribute_