The search:* functions are built using the cts:* functions so they couldn't technically be any faster.
That said, the search:* functions use advanced techniques to facilitate things like parallel execution, which someone new to cts:* wouldn't know, so it's easier for new programmers to get good performance out of the search:* functions. It's also harder to ask for slow things using search:* because it's focused on doing things that are reliably fast. But don't pick because of performance. Pick what's the right abstraction for you. Do you need what search:* provides or do you need the full control that cts:* provides. -jh- On Jul 29, 2015, at 6:04 PM, Chunyu Cong <[email protected]> wrote: > Hello, > > I would like to know which one has a better performance between search:* and > cts:*? > Please see the attached screenshot from Marklogic search documentation. > > Thanks, > Chunyu > > <2015-07-29_1101.png>_______________________________________________ > General mailing list > [email protected] > Manage your subscription at: > http://developer.marklogic.com/mailman/listinfo/general _______________________________________________ General mailing list [email protected] Manage your subscription at: http://developer.marklogic.com/mailman/listinfo/general
