Hi Karl,
> Okay, thanks again. The solution I'm leaning towards
> (assuming I will use this document modeling approach)
> involves a couple of the things we've discussed. I'll get a
> query like "physician-lastname:williams chief-complaint:aches
> test-name:rdw test-value 14.6". I'll know that the
> constraint groups are as follows: A = {physician-lastname,
> chief-complaint}; B = {test-name, test-value}. I'll run a
> search on group A using a <searchable-expression> that
> constrains to section A.
> Then I'll run a search on group B using a different
> <searchable-expression> and an <additional-query> with a
> cts:document-query containing all the results from the search on A.
> That's two searches, but there would be N searches for N
> sections (I expect N <= ~7).
This sounds as the right way to do it.
It might be obvious, but if there is reason to believe a certain section is
likely to be usually most restrictive, or there is a way to guess which section
will be most restrictive given the entered criteria: do the most restrictive
searches first..
> As for highlighting, I guess the above strategy would lose
> highlighting except for the last search performed. Maybe I
> can save the search:highlight nodes from each search and do
> some recombining at the end. It's not a painless strategy,
> but I think it will work for small numbers of sections and
> documents of "reasonable" size.
Sounds cumbersome, but it could work..
Kind regards,
Geert
drs. G.P.H. (Geert) Josten
Consultant
Daidalos BV
Hoekeindsehof 1-4
2665 JZ Bleiswijk
T +31 (0)10 850 1200
F +31 (0)10 850 1199
mailto:[email protected]
http://www.daidalos.nl/
KvK 27164984
P Please consider the environment before printing this mail.
De informatie - verzonden in of met dit e-mailbericht - is afkomstig van
Daidalos BV en is uitsluitend bestemd voor de geadresseerde. Indien u dit
bericht onbedoeld hebt ontvangen, verzoeken wij u het te verwijderen. Aan dit
bericht kunnen geen rechten worden ontleend.
_______________________________________________
General mailing list
[email protected]
http://xqzone.com/mailman/listinfo/general
