lanning of their systems with that in
mind.
-Michael Peterson
On Sun, Jan 8, 2017 at 8:16 PM, Denis Bazhenov wrote:
> One should really put things in context. If those searches are some kind
> of background workload (no users are waiting for search results), I’ll
> agree 100% CPU uti
t;, analyzer);
Query query = parser.parse("host:host_1 AND NOT location:location_5");
int limit = 1000;
TopDocs hits = searcher.search(query, limit);
System.out.println("hits.totalHits = " + hits.totalHits);
Thanks very much for your insights here.
-Michael Peterson
exactly the interpretation we want.
-Michael Peterson
https://www.rocana.com/
On Thu, Feb 16, 2017 at 8:27 PM, Trejkaz wrote:
> On Fri, Feb 17, 2017 at 11:14 AM, Erick Erickson
> wrote:
> > Lucene query logic is not strict Boolean logic, the article above
> explains why.
&g
0] AND text:foo
Orig query parsed : +ts:[1000 TO 2000] +text:foo
From Tree query parsed : +text:[ts:1000 TO ts:2000] +text:foo
What do you recommend to handle this issue?
Thank you,
Michael Peterson
http://www.rocana.com
Everyone - thanks for the feedback.
Trejkaz,
I agree. The [ts:X ts:Y] range syntax seems odd at best and broken at
worst. If the field name for the range has to be the same for both the
lower and upper bound why put it there twice inside the braces? In
addition, a user cannot type that syntax and
