Abstract: Application program interfaces (APIs), schemas and procedures manage multiple sessions within a server system has a create session request call for establishing a session between a client and a server within the server system. Each of plurality of sessions among the servers is persisted within a database operatively coupled to the servers. Each session is associated with a unique session identification which uniquely identifies the session among the plurality of sessions. A management request call for managing one of the sessions is performed according to the unique session identification.

Abstract: Importation of data records organized within tables from a source system to a target system while preserving relationships among data records of the tables when record identification values identifying each data record have been changed during importation includes, using the same database query on an entire table to update each record identification references that refers to a data record in another table.

Abstract: Application program interfaces (APIs), schemas and procedures manage multiple sessions within a server system has a create session request call for establishing a session between a client and a server within the server system. Each of plurality of sessions among the servers is persisted within a database operatively coupled to the servers. Each session is associated with a unique session identification which uniquely identifies the session among the plurality of sessions. A management request call for managing one of the sessions is performed according to the unique session identification.

Abstract: Concurrency control between multiple data transactions involving the same data includes comparing the version identifications which uniquely identify versions of the data during a read request and during a write request of a data transaction. An exception is thrown if the version identifications do not match, and the exception is handled within the data transaction.

Abstract: A compressed trie has nodes including multiple character sub-strings. Such multiple character storage reduces the number of nodes in the trie, thereby reducing the amount of memory required for storing the trie and reducing the amount of time required to perform matching. Furthermore, in such a compressed trie, sub-strings are stored in a single character string. Each node references its corresponding sub-string by the sub-string's starting position and length in the character string. Multiple nodes may reference a single sub-string. Thus, referencing rather than storing sub-strings in corresponding nodes eliminates repetitive sub-string storage, thereby reducing the amount of memory required for storing the trie.

Abstract: A compressed trie has nodes including multiple character sub-strings. Such multiple character storage reduces the number of nodes in the trie, thereby reducing the amount of memory required for storing the trie and reducing the amount of time required to perform matching. Furthermore, in such a compressed trie, sub-strings are stored in a single character string. Each node references its corresponding sub-string by the sub-string's starting position and length in the character string. Multiple nodes may reference a single sub-string. Thus, referencing rather than storing sub-strings in corresponding nodes eliminates repetitive sub-string storage, thereby reducing the amount of memory required for storing the trie.