Re: Fwd: [bdbxml] Space Time Complexity - Performance issues
John Snelson <[email protected]> Tue, 13 Sep 2005 10:43:16 +0100
| Newsgroups | gmane.comp.db.dbxml.general |
|---|---|
| Message-ID | <[email protected]> |
John Snelson wrote: > Query complexity should be linear with regard to query size and document > size. I should have specified for a simple query - containing path expresions, predicates, a single for-loop and "some" expressions. Obviously you can write a query with multiple for loops that has a complexity greater than linear. John -- John Snelson, Berkeley DB XML Engineer Sleepycat Software, Inc http://www.sleepycat.com Contracted to Sleepycat through Parthenon Computing Ltd http://blog.parthcomp.com/dbxml ------------------------------------------ To remove yourself from this list, send an email to [email protected]