Bug #193
closed
evaluate recursive search performance
Added by Matt Jones over 23 years ago.
Updated about 22 years ago.
Description
Need to evaluate performance of recursive searches more thoroughly and, if they
turn out to be as fast as searches using the XML_INDEX table, then we need to
diable the use of the xml_index table.
Uniform xml documents were applied to test the query performance in both Oracle and Postgresql.To Oracle, path query has same performance as nested query.But in Postgresql, the performance is very different. As depth of doucment increasing, the time difference increases too. For example, when depth=8, nested query need about 198 seconds, but paht query (using xml_index table) only need 105 seconds.So, probably it is good to keep xml_index table. Metacat isnot designed only for Oracle.
Original Bugzilla ID was 193
Also available in: Atom
PDF