jackrabbit-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Marcel Reutegger (JIRA)" <j...@apache.org>
Subject [jira] Resolved: (JCR-1872) Improve performance of simple path queries
Date Fri, 21 Nov 2008 14:48:44 GMT

     [ https://issues.apache.org/jira/browse/JCR-1872?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]

Marcel Reutegger resolved JCR-1872.
-----------------------------------

       Resolution: Fixed
    Fix Version/s: 1.6.0

There are now two strategies how child nodes are calculated. The first one uses the item state
manager, up to a certain number of context nodes, the second strategy uses the hierarchy resolver.

Path constraints with frequently used node names are now much faster.

svn revision: 719592

> Improve performance of simple path queries
> ------------------------------------------
>
>                 Key: JCR-1872
>                 URL: https://issues.apache.org/jira/browse/JCR-1872
>             Project: Jackrabbit
>          Issue Type: Improvement
>          Components: jackrabbit-core
>            Reporter: Marcel Reutegger
>            Priority: Minor
>             Fix For: 1.6.0
>
>
> Queries with simple path constraints can be quite slow because of the way they are implemented.
The current implementation basically does a hierarchical join with the context nodes and the
set of nodes with the name of the next location step. When the specified path is quite selective
the implementation should   rather resolve the path expression using the item state manager
(similar to how regular paths are resolved in the JCR API).

-- 
This message is automatically generated by JIRA.
-
You can reply to this email to add a comment to the issue online.


Mime
View raw message