- From: Daniel Peintner <daniel.peintner@gmail.com>
- Date: Thu, 2 Apr 2009 10:25:02 +0200
- To: TAMIYA Keisuke <tamiya.keisuke@canon.co.jp>
- Cc: public-exi-comments@w3.org, Efficient XML Interchange WG <member-exi-wg@w3.org>
Hello Keisuke, > I understood that the mechanism to find Self-Contained Data from an EXI > document is out of the specification. > If possible, please show me some mechanism you and WG-members have > discussed. Unfortunately we can't show you one mechanism for efficiently using selfContained elements in your environment. Without any background knowledge one could come up with several solutions to address the problem. The simplest approach I can think of is a list of ID's mapped to the byte-offset of certain selfContained elements. The ID may have a meaning associated with it in your application. We hope that the simple example described above carries an essence that can inspire you to devise mechanisms that best suit the need of your application. Hope this helps, -- Daniel > Regards, > Keisuke Tamiya > > On Thu, 26 Feb 2009 10:43:15 +0100 > Daniel Peintner <daniel.peintner@gmail.com> wrote: >> Hello Tamiya, >> >> thank you for interest in EXI. >> >> > EXI has Self-Contained option (ref. S.5.4). >> > And the EXI parser can parse Self-Contained data without parsing other >> > parts of the EXI document. >> > But how does the EXI Parser find the position (ex. bytes offset) in the >> > EXI data? >> > If the EXI parser wants to parse Self-Contained data first, can it get >> > a start position of Self-Contained data from the EXI documents? >> >> The EXI format itself offers only a hook to support selfContained >> subtrees, meaning that an EXI processor may access such an independent >> fragment without reading what came first. >> >> The working group expects many different use cases for this feature >> and does not restrain its use to a specific mechanism which is likely >> not be suitable for many environments. It is therefore up to an >> application or system to make use of this feature and build an index >> or any other solution on top of it. >> >> Hope this answers your question! >> >> Thanks, >> >> -- Daniel > > >
Received on Thursday, 2 April 2009 08:25:57 UTC