Tibco Software Patent Applications

Policy-based Storage Structure Distribution

Granted: March 17, 2016
Application Number: 20160078065
Policy-based storage and retrieval combined with a distribution algorithm results in automatic and even distribution of policy-based storage structures across a set of nodes and dynamic, automated homing or ownership of policy-based storage structures. Large numbers of policy-based storage structures may be distributed without manual administration, allowing for rapid creation and destruction of storage structures. The overall load may be distributed and balanced across the server pool.…

Policy-based Storage Structure Distribution

Granted: March 17, 2016
Application Number: 20160078117
Policy-based storage and retrieval combined with a distribution algorithm results in automatic and even distribution of policy-based storage structures across a set of nodes and dynamic, automated homing or ownership of policy-based storage structures. Large numbers of policy-based storage structures may be distributed without manual administration, allowing for rapid creation and destruction of storage structures. The overall load may be distributed and balanced across the server pool.…

MESSAGE MATCHING

Granted: March 5, 2015
Application Number: 20150067094
Processing a message is disclosed. For each field group applicable to a message from one or more unique field groups of one or more fields identified using one or more content matchers, a compiled message corresponding to the field group applicable to the message is generated. It is determined whether one or more of the compiled messages matches one or more of the one or more content matchers.

Predictive System for Designing Enterprise Applications

Granted: September 18, 2014
Application Number: 20140279788
Predictive systems for designing enterprise applications include memory structures that output predictions to a user. The predictive system may include an HTM structure that comprises a tree-shaped hierarchy of memory nodes, wherein each memory node has a learning and memory function, and is hierarchical in space and time that allows them to efficiently model the structure of the world. The memory nodes learn causes, predicts with probability values, and form beliefs based on the input…

Predictive System for Deploying Enterprise Applications

Granted: September 18, 2014
Application Number: 20140282489
Predictive systems for deploying enterprise applications include memory structures that output predictions to a user. The predictive system may include an HTM structure that comprises a tree-shaped hierarchy of memory nodes, wherein each memory node has a learning and memory function, and is hierarchical in space and time that allows them to efficiently model the structure of the world. The memory nodes learn causes, predicts with probability values, and form beliefs based on the input…

APPLICATION CONGESTION CONTROL

Granted: September 11, 2014
Application Number: 20140258382
Controlling client side application congestion at least in part by using one or more heuristics to predict at a data producer node, such as a server, how much time an application at a data consumer node, such as a client, will require to process a unit of data is disclosed. In various embodiments, a predicted client side processing time associated with a unit of data to be sent to a client is determined. The predicted client side processing time associated with the unit of data is used…

Enhanced augmented reality display for use by sales personnel

Granted: June 12, 2014
Application Number: 20140164282
Employees of the sales and service industry have to deal with a lot of information regarding their customers and clients. Keeping all the information available and accessible is difficult, especially when only certain information is relevant to the sales and service employees while trying to assist customers and clients. The augmented reality system disclosed herein allows employees in the sales and service industry to have contextually relevant information about their customers and…

Data replication protocol with efficient update of replica machines

Granted: May 22, 2014
Application Number: 20140143205
Steady state data distribution is provided between a client application, a leader machine, and a plurality of replica machines. The distribution comprises the leader machine receiving an operation request from the client application, the leader machine sending the prepare message to each of the plurality of replica machines, the replica machines recording in their logs information on the operation, the replica machines sending acknowledgement messages to the leader machine, and the…

Data replication protocol with steady state data distribution and quorum formation

Granted: May 8, 2014
Application Number: 20140129519
Steady state data distribution is provided between a client application, a leader machine, and a plurality of replica machines. The distribution comprises the leader machine receiving an operation request from the client application, the leader machine sending the prepare message to each of the plurality of replica machines, the replica machines recording in their logs information on the operation, the replica machines sending acknowledgement messages to the leader machine, and the…

System and method for loading objects for object-relational mapping

Granted: October 24, 2013
Application Number: 20130282751
Disclosed are systems and methods for creating data objects, which includes querying a database to locate a first table associated with a first data type to be created, loading a plurality of rows from the first table during the query associated with the first table, creating a first set of data objects associated with the first data type, wherein each data object of the first set is created from data stored in each of the rows loaded from the first table. The systems and methods also…

System and method for Intelligently distributing a plurality of transactions for parallel processing

Granted: October 24, 2013
Application Number: 20130283293
Disclosed are systems and methods for distributing a plurality of transactions for parallel processing, which includes receiving a message, such that each transaction comprises information associated with a target object, wherein the target object is stored in a memory. The systems and methods further include parsing the messages into the plurality of transactions, transmitting the parsed transactions to a transaction queue, receiving a transaction from the transaction queue, determining…

Collaborative, contextual enterprise networking systems and methods

Granted: July 11, 2013
Application Number: 20130179494
Described is an enterprise-based, contextual network system and method to keep employees connected with one another, as well as to external resources. Current media offers a great way to stay in touch with others but is not cohesive and contextual for businesses or generally productive for businesses. The enterprise media disclosed in this application presents a way for businesses to keep all of their employees and outside resources connected, but in a professional and efficient manner…

Database query optimization and cost estimation

Granted: May 30, 2013
Application Number: 20130138679
Described are systems and methods relating to database query optimization and query cost estimation. The approach is described in the context of searching balanced and semi-balanced tree indexes such as B-trees, B+ trees, and R-B trees. The described approach may be used for both simple and composite queries, and the described approach may be used for relational queries, i.e., where a variable is less than or greater than a certain value and the database is being used to find the set of…

Integrated phonetic matching methods and systems

Granted: November 1, 2012
Application Number: 20120278315
Methods and systems for searching a database for a query using an integrated approach of associating transduced query string comparisons with literal query string comparisons reduces computation time and results in more relevant and accurate results. The methods and systems include a processor receiving a query, searching a database for the query, and providing results of the search. The query may be compared to data entries from the database, and a transduced version of the query may be…

FAST CONTENT-BASED ROUTING

Granted: October 18, 2012
Application Number: 20120265899
Systems and methods for fast, efficient content-based routing that allow a router to perform true content-based routing without having to de-serialize the data and apply a full content-based filter by determining the exact set of consumers to forward the data onto based on packet headers. A system for fast content-based routing may receive a subscription from a receiver machine and may assign a unique ID associated with the subscription in a router table. The system may then place a ID…

Relational database joins for inexact matching

Granted: October 4, 2012
Application Number: 20120254245
Methods and systems for performing a query over joined tables in the context of inexact matching provide efficient search engine functionality. The systems and methods are used to perform an efficient query on a parent table and joined child tables. Search grams are determined based on the query and parent records and child records are scanned for the search grams. Gram scores are computed based on a degree of matching between the parent and child records and the search grams.

COMPRESSION OF MESSAGE INFORMATION TRANSMITTED OVER A NETWORK

Granted: May 31, 2012
Application Number: 20120136950
Disclosed are systems and methods for providing message compression instructions by communicating with a plurality of sender machines and a plurality of receiver machines and monitoring one or more messages from the plurality of sender machines. The disclosed systems and methods may also identify a part of the one or more messages that is frequently included in a plurality of the messages sent by the plurality of sender machines, dynamically determine compression instructions to compress…

FAST MATCHING FOR CONTENT-BASED ADDRESSING

Granted: May 24, 2012
Application Number: 20120131046
Disclosed are systems and methods for efficient matching for content-based addressing wherein the systems and methods may: accept, at a receiver machine, a query; generate, at the receiver machine, a tree structure ordered by one or more fields of the query; analyze, at the receiver machine, a message from the sender machine; search, by the receiver machine, the tree structure using content from one or more fields of the message; determine, by the receiver machine, if the content values…

HIERARCHICAL BITMASKS FOR INDICATING THE PRESENCE OR ABSENCE OF SERIALIZED DATA FIELDS

Granted: May 24, 2012
Application Number: 20120131117
Disclosed are systems and methods for communicating with a sender machine and a receiver machine, and analyzing a bitmask associated with a message to be sent from the sender machine to the receiver machine, such that the bitmask comprises one or more presence bits and one or more absence bits, such that the presence bits indicate that an associated field of the message are included in the message and the absence bits indicate that an associated field of the message are omitted in the…

LOCKING AND SIGNALING FOR IMPLEMENTING MESSAGING TRANSPORTS WITH SHARED MEMORY

Granted: May 24, 2012
Application Number: 20120131285
Disclosed are systems and methods for transporting data using shared memory comprising allocating, by one of a plurality of sender application, one or more pages, wherein the one or more pages are stored in a shared memory, wherein the shared memory is partitioned into one or more pages, and writing data, by the sender application, to the allocated one or more pages, wherein a page is either available for use or allocated to the sender applications, wherein the one or more pages become…