Mark, I don't think there is any (other than just computation resources needed, of course). How complex/deep do your queries need to be?
Otis ---- Sematext :: http://sematext.com/ :: Solr - Lucene - Nutch Lucene ecosystem search :: http://search-lucene.com/ ----- Original Message ----- > From: Mark Schoy <hei...@gmx.de> > To: solr-user@lucene.apache.org > Cc: > Sent: Thursday, October 6, 2011 10:27 AM > Subject: Maximum deep of nested boolean queries > > Is there a maximum deep of nested boolean queries? > > For example: ((+a b -c) or (c -d) not e) and (+f +g) >
