Abstract: A scalable distributed server system and method to maintain the system, wherein the system comprises a top virtual layer that includes a fixed or variable number of virtual buckets, wherein a virtual bucket maps an input to a routing bucket in one or more middle routing layers; and a bottom server layer that includes a variable number of servers that each include a database that stores data and an application that recalls data from and stores data into the database, wherein the one or more middle routing layers comprise a variable number of routing buckets that route input received from a virtual bucket in the top virtual layer to a server contained within the bottom server layer.

Abstract: A scalable distributed server system and method to maintain the system, wherein the system comprises a top virtual layer that includes a fixed or variable number of virtual buckets, wherein a virtual bucket maps an input to a routing bucket in one or more middle routing layers; and a bottom server layer that includes a variable number of servers that each include a database that stores data and an application that recalls data from and stores data into the database, wherein the one or more middle routing layers comprise a variable number of routing buckets that route input received from a virtual bucket in the top virtual layer to a server contained within the bottom server layer.

Abstract: An index data structure (“MTree”) useful in creating indices for structured data is provided. The MTree index data structure is designed to meet the needs of the hierarchical XPath query language. The primary feature of MTree is the next subtree root node in document order for all axes are available to each context node in O(1). The MTree index data structure supports modification operations such as insert and delete. The MTree index structure is implemented in memory or in a digital storage medium. Improved performance in the MTree index structure utilizing a threading scheme is also provided.

Abstract: A method for processing an inputted XPath query against an inputted XML document is provided. The method generates a summary index, an ancestor-descendant path index, and a value index from one or more inputted XML documents. The summary index and the ancestor-descendant path index and the value index have at least one path defined. XPath queries at articulation points are parsed into multiple partial queries. The cursor type index access methods are determined. Partial queries are executed against the SUM-Index to generate a list of path identifiers (PID) satisfies the partial query segments. A set of ancestor-descendant PID identifiers list is generated to provide a result sequence. The result sequence of nodes is filtered producing one or more outputted XML documents from the final result sequence of nodes. A related system and computer medium is also provided.

Abstract: An index data structure comprises a plurality of index keys for uniquely identifying potential data object context nodes. Each index key is, in turn, associated with one or more potential context nodes. Moreover, the index key has a label that provides semantic content to a user. The index data structure further comprises one or more routing tables associated with each index key that generally include a plurality of path references.

Abstract: A system, method and program product for processing an inputted XPath query against an XML document. A method is disclose that includes: generating a path index and an MTree structure index from the XML document using a computing device, wherein the MTree structure index has at least one qpath; executing a query against the path index to generate an initial sequence containing a node for each qpath in the XML document that satisfies the query; generating a hash map from the initial sequence from an MTree structure index containing path ids that are located along qpaths in a second MTree structure index; and testing the path id of each node located along a qpath of the Mtree structure index against the path id in the hash map to generate a result sequence.

Abstract: An index data structure comprises a plurality of index keys for uniquely identifying potential data object context nodes. Each index key is, in turn, associated with one or more potential context nodes. Moreover, the index key has a label that provides semantic content to a user. The index data structure further comprises one or more routing tables associated with each index key that generally include a plurality of path references.

Abstract: An index data structure has a plurality of index keys for uniquely identifying potential data object context nodes. Each index key is, in turn, associated with one or more potential context nodes. Moreover, the index key has a label that provides semantic content to a user. The index data structure further includes one or more routing tables associated with each index key that generally include a plurality of path references.

Abstract: An index stored on a digital storage medium is a data structure for indexing one or more data objects. The index data structure includes a plurality of index keys for uniquely identifying potential context items in a data object. Each index key is associated with a potential context item. The index data structure of this embodiment also includes a plurality of intermediate nodes. Each intermediate node is associated with an intermediate node, a root node or subtree root node. Finally, the index structure also includes a set of index attributes associated with each index key.