I see, thanks - I wasn't familiar with those options. And I'm assuming the situation is similar for lexicons?
-Mike On 06/02/2011 01:05 PM, Jason Hunter wrote: > On Jun 2, 2011, at 9:26 AM, Mike Sokolov wrote: > > >> On 06/02/2011 12:01 PM, Jason Hunter wrote: >> >>> Yes, if you ask to start at the millionth [1000000] item the server is >>> going to linearly scan the first 999,999 items to figure out which one is >>> the millionth. If you start at a value such as "N" then the server can >>> jump more directly to the right starting point (through binary search or >>> lookup tables, depending on configuration). >>> >>> >>> >> I'm curious what sort of configuration would affect that, Jason? >> > On a database configuration there's a "range index optimize" setting where > you can pick: > > facet-time (i.e. construct a lookup table) > memory-size (i.e. do binary search) > > facet-time is much faster but needs a bit more memory. It's the default now. > > memory-size is how things behaved in 4.1 and previous. No lookup table, use > binary search. > > -jh- > > _______________________________________________ General mailing list [email protected] http://developer.marklogic.com/mailman/listinfo/general
