International Business Machines Corporation

Aravind Srinivasan

Erik John Burckart

Kevin Edward Vaughan

Thomas Charles Burke

Rohit Dilip Kelapure

Madhu K Chetuparambil

Srinivas Hasti

Renganathan Sundararaman

Gabriel Garcia Montero

Zhi Gan

Ying Chun Guo

Annapureddy S Reddy

Rahul Kurane

Jeffrey A Lee

A system and method for searching a bytestream or other string in a case insensitive manner. In a preferred embodiment, the present invention includes an ASCII tree that associated both upper and lower case letters of an incoming header key (or other symbols) with nodes. When enough nodes are gathered, a target word is found.

Search via fast case insensitive ASCII tree

A computer-implementable method, system and computer-usable medium for extending the portability of code to a limited-class environment are disclosed. In a preferred embodiment, the method includes the steps of: identifying any full-version-only objects that are not in a reduced-version of a language, wherein the reduced-version of the language comprises a reduced portion of objects that are in a full-version of the language; associating a full-version-only object with a set of one or more objects in the reduced-version of the language, wherein the full-version-only object is functionally equivalent to the set of one or more objects in the reduced-version of the language; identifying any full-version-only objects in a software program; and creating a reduced-version of the software program by replacing any identified full-version-only objects with a functionally equivalent set of one or more objects from the reduced-version of the language.

Extending portability of java code through the use of AOP

The present invention discloses a data structure which, given an identifier for a Representational State Transfer (REST) resource, can rapidly yield a configured target and simultaneously yield all configured pattern based rules and constraints for the target. The disclosed data structure is a tree structure including nodes for URL portions. Each node is associated with a hash tree specifically grown in a manner that ensures collision occurrences are non-existent. The tree structure is effectively two or more superimposed trees; one for URL pattern matching to determine a target, another for determining constraints. A single tree traversal, which can be based on a progressive hash, can be used to concurrently determine a target and a set of constraints, which represents improved performance over conventional implementations that require multiple, distinct query/response operations to produce equivalent results.

Technique for finding rest resources using an n-ary tree structure navigated using a collision free progressive hash

Session state affinity is maintained in a workload balancing system that includes a hypertext transfer protocol (HTTP) routing server and a plurality of application servers. The application servers maintain backup session state information for a first session to a first server of the plurality of application servers at fewer than all of the plurality of application servers, detect the unavailability of the first application server at an application server of the plurality of application servers other than the first application and determine a second server that continues the first session. An identification of the second server and the first session is sent from an application server of the plurality of application servers to a HTTP routing server responsive to detecting the unavailability of the first server. The identification of the second server and the first session is received at the HTTP routing server and communications associated with the first session are routed from the HTTP routing server to the second server responsive to receiving the identification of the second server so that backup session state information maintained at the second server is used to continue the first session from the first server at the second server.

Dynamically updating session state affinity

A mechanism by which URLs are progressively hashed character by character and clauses of the URL are used to traverse a tree data structure for matching of the URL to resources/rules is provided. The hash code for a single character is appended to a prior hash code for a preceding character in the URL portion. At the time that the entire portion of the URL is hashed, as determined based on the presence of a delimiter character, the particular node in a tree data structure associated with the resulting hash code is identifiable within a hash table of a current node of the tree data structure. Each node in the tree data structure includes a multidimensional hash table for a portion of a URL. The multidimensional hash table is established and grown in a manner that ensures there are no hash collisions. Each portion of the URL is parsed in this manner and the tree data structure is traversed as each portion is processed until the entire URL is parsed at which time the resulting rules/resources may be identified from the leaf nodes of the tree data structure.

Multidimensional hashed tree based URL matching engine using progressive hashing

Growing community of inventors

Raleigh, NC, United States of America

Aravind Srinivasan