Abstract: Methods and systems in a data-processing system for matching data contained in a hierarchical data tree structure. One or more sets of data contained within a first data tree structure can be associated with one or more sets of data contained within a second data tree structure, such that the data associated with the first data tree structure is generally utilized to process the data associated with the second data tree structure. The first data tree structure can then be compared in parallel to the second data tree structure beginning with a first root thereof to thereby identify data similarities between the first and second data tree structures based on a predefined search criteria. Finally, one or more matching set of data between the first data tree structure and the second data tree structure can be identified, in response to comparing the first data structure to the second data structure.

Abstract: Methods and systems in a data-processing system for matching data contained in a hierarchical data tree structure. One or more sets of data contained within a first data tree structure can be associated with one or more sets of data contained within a second data tree structure, such that the data associated with the first data tree structure is generally utilized to process the data associated with the second data tree structure. The first data tree structure can then be compared in parallel to the second data tree structure beginning with a first root thereof to thereby identify data similarities between the first and second data tree structures based on a predefined search criteria. Finally, one or more matching set of data between the first data tree structure and the second data tree structure can be identified, in response to comparing the first data structure to the second data structure.

Abstract: A method and system for enabling dynamic data-centered programming in a distributed computer network, such as, for example, the Internet or Intranet-based computer networks. A software method can be dynamically associated with an instance of incoming data utilizing at least one processing node within the distributed computer network. The software method can be dynamically located utilizing a discovery mechanism integrated with the distributed computer network. The software method can also be dynamically fetched from any location with the distributed computer network, wherein at least one processing node can dynamically program itself for a current instance of incoming data, such that all future instances of an identical type of incoming data can also be processed utilizing the software method without searching the distributed computer network and downloading the software method.

Abstract: Object-oriented routing specifies a method and system for routing objects over a network. An object, which comprises a self-contained module of data and associated processing information (i.e., software method), can be designated and thereafter routed over the distributed computer network utilizing an object router, which can parse the object and apply the associated processing information contained with the object thereby permitting the object router to be self-programmable for any data format. The object router thus comprises an object-oriented router. The object router is permitted to construct the object by dynamically downloading the associated processing information corresponding to data received from an external data source.