| | Berkeley DB adds XML smarts | InfoWorld | Review | 2004-04-09 | By Rick Grehan (Site not responding. Last check: 2007-10-20) |
 | | Luckily, the Berkeley DB XML documentation suggests an iterative query tactic to avoid this: Program the first query to return a set of matching documents, then iterate through that set, re-issuing the query on individual documents, and examine the returned elements. |
 | | You can accelerate queries by defining indexes, and Berkeley DB XML has a flexible indexing scheme that lets you create indexes for elements (or “edges”, which are paths to elements, rather than the elements themselves) and define the index structure so that it’s optimal for the expected queries. |
 | | Berkeley DB XML’s processing of a whole XML document as a single unit does create some side effects in the way documents are accessed. |
| www.infoworld.com /article/04/04/09/15TCsleepycat_1.html (1836 words) |