[XSL-LIST Mailing List Archive Home] [By Thread] [By Date] [Recent Entries] [Reply To This Message] Re: Theory question about keys (no code)
I can't tell you how other implementations work. However, key
definitions aren't linked to any particular input document, so the
processor don't know until the key() function is called whether a
particular key will be used to search a particular document. Therefore,
a fairly obvious strategy is to build the index for a key/document pair
(which might be a hash table or a B-tree or any other kind of data
structure) the first time that the key() function is used to search that
document using that key.
I can't quite see how building the key incrementally could be useful, except in conjunction with the XSLT 2.0 feature where the third argument of key() allows you to search part of a document only. When that feature is used I can imagine an implementation only indexing the parts of the document that are searched (though that's not what Saxon actually does.) Michael Kay Saxonica On 06/08/2012 18:16, FAIR, ED wrote: Hi,
|
PURCHASE STYLUS STUDIO ONLINE TODAY!Purchasing Stylus Studio from our online shop is Easy, Secure and Value Priced! Download The World's Best XML IDE!Accelerate XML development with our award-winning XML IDE - Download a free trial today! Subscribe in XML format
|