From: Igor A. V. L. <ig...@co...> - 2004-08-30 19:41:26
|
Hi folks! How do I work around this? Internal error: The document is too complex/irregularily structured to be mapped into eXist's numbering scheme. Number of children per level of the tree: [ 1, 4, 38, 6, 37, 18, 303, 32, 45, 16, 12, 25, 4, 7, 5, 6, 5, 1 ] I would attach the source document, but it's a bit large - 10MB uncompressed, 800Kb Gzipped. I may send it latter if required. Thanks, Igor |
From: Eric Z. <yue...@ua...> - 2004-08-30 19:47:23
|
As I know, you can't work around this. That is one of the limitations of eXist, to complain some files are too complex On Mon, 2004-08-30 at 13:45, Igor Abade V. Leite wrote: > Hi folks! How do I work around this? > > Internal error: The document is too complex/irregularily structured to be > mapped into eXist's numbering scheme. Number of children per level of the > tree: [ 1, 4, 38, 6, 37, 18, 303, 32, 45, 16, 12, 25, 4, 7, 5, 6, 5, 1 ] > > I would attach the source document, but it's a bit large - 10MB uncompressed, > 800Kb Gzipped. I may send it latter if required. > > Thanks, > Igor > > > > ------------------------------------------------------- > This SF.Net email is sponsored by BEA Weblogic Workshop > FREE Java Enterprise J2EE developer tools! > Get your free copy of BEA WebLogic Workshop 8.1 today. > http://ads.osdn.com/?ad_id=5047&alloc_id=10808&op=click > _______________________________________________ > Exist-open mailing list > Exi...@li... > https://lists.sourceforge.net/lists/listinfo/exist-open -- Yue(Eric) Zhang Database Analyst/DBA, TAPoR Project Arts Department, University of Alberta Edmonton, AB, Canada |
From: Jean-Marc V. <jm...@fr...> - 2004-08-30 20:15:04
|
Igor Abade V. Leite wrote: >Hi folks! How do I work around this? > >Internal error: The document is too complex/irregularily structured to be >mapped into eXist's numbering scheme. Number of children per level of the >tree: [ 1, 4, 38, 6, 37, 18, 303, 32, 45, 16, 12, 25, 4, 7, 5, 6, 5, 1 ] > > Eric is rigth, this is a current limitation of eXist. All you can do is split your data in, say, 10 or 100 parts. Solving this problem is high in the priority. |