Abstract: A method and apparatus for enhancing the display of data is provided. User interaction data describing the interactions of a plurality of users with a user interface component is stored. The user interaction data is analyzed to identify patterns of prior use of the user interface component. The operation of a three-tier architecture may be configured to enhance performance based on the patterns of prior use. For example, upon determining a certain percentage of users interact with the user interface component in a manner requiring the visual appearance of the user interface component to be updated to depict additional data not previously depicted, the additional data may be cached at an application tier or provided to a client before a user requests the additional data to minimize the delay in retrieving the additional data. The patterns of prior use may also be used to selectively initialize resources at the middle-tier.

Abstract: A method and apparatus for performing a paging operation on a tree having a plurality of nodes is provided. A preorder number and a subtree size are maintained in a machine-readable medium for each of the plurality of nodes of the tree. The preorder number associated with a particular node of the tree identifies a position for the particular node in a depth-first search ordering of the plurality of nodes of the tree. The subtree size associated with a particular node of the tree identifies a count of all the nodes in a subtree rooted at the particular node. In response to receiving a request to perform a paging operation on the plurality of nodes of the tree, a set of nodes that satisfy the paging operation may be determined using the preorder number and the subtree size associated with each node of the tree.

Abstract: A method and apparatus for enhancing the display of data is provided. User interaction data describing the interactions of a plurality of users with a user interface component is stored. The user interaction data is analyzed to identify patterns of prior use of the user interface component. The operation of a three-tier architecture may be configured to enhance performance based on the patterns of prior use. For example, upon determining a certain percentage of users interact with the user interface component in a manner requiring the visual appearance of the user interface component to be updated to depict additional data not previously depicted, the additional data may be cached at an application tier or provided to a client before a user requests the additional data to minimize the delay in retrieving the additional data. The patterns of prior use may also be used to selectively initialize resources at the middle-tier.

Abstract: A method and apparatus for performing a paging operation on a tree having a plurality of nodes is provided. A preorder number and a subtree size are maintained in a machine-readable medium for each of the plurality of nodes of the tree. The preorder number associated with a particular node of the tree identifies a position for the particular node in a depth-first search ordering of the plurality of nodes of the tree. The subtree size associated with a particular node of the tree identifies a count of all the nodes in a subtree rooted at the particular node. In response to receiving a request to perform a paging operation on the plurality of nodes of the tree, a set of nodes that satisfy the paging operation may be determined using the preorder number and the subtree size associated with each node of the tree.

Abstract: Information hierarchies are efficiently stored and accessed in a relational or object-relational database system. A path signature, similar to a pathname, is stored in a database system in association with data for the node identified by the pathname. For example, a path signature identifying an element is stored in a row that holds data for the element. To retrieve data for a hierarchical query that identifies the data requested using, for example, an XPATH string, a string pattern is generated that is matched by path signatures identified by the XPATH string. Pattern matching is then used to select rows associated with matching path signatures, and data from the selected rows is used to compute the XPATH query. Furthermore, hash values representing path signatures are generated in a way that preserves the ordering of data in an information hierarchy. The hash values can be indexed to provide quick access.

Abstract: Information hierarchies are efficiently stored and accessed in a relational or object-relational database system. A path signature, similar to a pathname, is stored in a database system in association with data for the node identified by the pathname. For example, a path signature identifying an element is stored in a row that holds data for the element. To retrieve data for a hierarchical query that identifies the data requested using, for example, an XPATH string, a string pattern is generated that is matched by path signatures identified by the XPATH string. Pattern matching is then used to select rows associated with matching path signatures, and data from the selected rows is used to compute the XPATH query. Furthermore, hash values representing path signatures are generated in a way that preserves the ordering of data in an information hierarchy. The hash values can be indexed to provide quick access.