Mikhail, that's an interesting idea. If a terms list could stand in for a cache that may be helpful. What I don't fully see is how the search would work. Building an explicit negative terms query with returned IDs doesn't seem possible as that list would be in the millions. To drastically speed my process up I need to stop updating the data docs and only update the marker (linked) docs.
Starting with 0 terms indexed for field "doclist" the very first search is easy: - put all result IDs in the doclist Second search must exclude results that are already represented in the doclist field. How is that possible? I should mention I do an explicit hard commit after running each saved search, to prevent consecutive searches from overlapping. That is probably costing me. I didn't know it was possible to do an explicit soft commit. How do you do that with SolrJ (not by setting maxDocs=1 in the config I hope)? -- View this message in context: http://lucene.472066.n3.nabble.com/Simulate-doc-linking-via-post-filter-cache-check-tp4275842p4275929.html Sent from the Solr - User mailing list archive at Nabble.com.
