Antoni, I posted the original query in the mail that started this thread. Do you > think it would be more efficient to drop the one great query > > for $x at $pos in /dblp/* > > and instead have a loop and post many smaller queries > > for $x at $pos in > /dblp/*[fn:position() >= offset && fn:position() < offset + limit] > > or > > for $x at $pos in /dblp/*[fn:position = (offset to (limit+offset))] > > until some query returns an empty sequence? Will it be more efficient? > Can sedna deal with the fn:position() functions effectively, or will it > internally iterate over all results and return only the matching ones. >
Concernig disk space it'll be much more efficient. Of course, there'll be some performance overhead for multiple statements (parse, clear state after each statement, etc ...), however, I believe, it should be very small. Ivan Shcheklein, Sedna Team
------------------------------------------------------------------------------ This SF.Net email is sponsored by the Verizon Developer Community Take advantage of Verizon's best-in-class app development support A streamlined, 14 day to market process makes app distribution fast and easy Join now and get one step closer to millions of Verizon customers http://p.sf.net/sfu/verizon-dev2dev
_______________________________________________ Sedna-discussion mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/sedna-discussion
