TIBCO SOFTWARE INC. Patent applications |
Patent application number | Title | Published |
20160078117 | Policy-based Storage Structure Distribution - 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. Multiple entries having the same key value in a database- or table-like structure allow for distribution of policy-based storage and retrieval by key value and for queue semantics to be utilized for microqueues in the large database- or table-like structure. | 03-17-2016 |
20160078065 | Policy-based Storage Structure Distribution - 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. Multiple entries having the same key value in a database- or table-like structure allow for distribution of policy-based storage and retrieval by key value and for queue semantics to be utilized for microqueues in the large database- or table-like structure. | 03-17-2016 |
20150067094 | MESSAGE MATCHING - 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. | 03-05-2015 |
20140282489 | Predictive System for Deploying Enterprise Applications - 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 data, where the learning algorithm stores likely sequence of patterns in the nodes. By combining memory of likely sequences with current input data, the nodes may predict the next event. The predictive system may employ an HHMM structure comprising states, wherein each state is itself an HHMM. The states of the HHMM generate sequences of observation symbols for making predictions. | 09-18-2014 |
20140279788 | Predictive System for Designing Enterprise Applications - 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 data, where the learning algorithm stores likely sequence of patterns in the nodes. By combining memory of likely sequences with current input data, the nodes may predict the next event. The predictive system may employ an HHMM structure comprising states, wherein each state is itself an HHMM. The states of the HHMM generate sequences of observation symbols for making predictions. | 09-18-2014 |
20140258382 | APPLICATION CONGESTION CONTROL - 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 to determine a time to send a data transmission to the client. | 09-11-2014 |
20140164282 | Enhanced augmented reality display for use by sales personnel - 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 clients presented quickly and accurately to them using an augmented reality display device. | 06-12-2014 |
20140143205 | Data replication protocol with efficient update of replica machines - 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 leader machine sending commit command messages to the replica machines. A new quorum of the replica machines is created by using log information. Replica machines that become part of the new quorum are updated in an efficient manner. | 05-22-2014 |
20140129519 | Data replication protocol with steady state data distribution and quorum formation - 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 leader machine sending commit command messages to the replica machines. A new quorum of the replica machines is created by using log information. Replica machines that become part of the new quorum are updated in an efficient manner. | 05-08-2014 |
20130283293 | System and method for Intelligently distributing a plurality of transactions for parallel processing - 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 the target object associated with the transaction, assigning the transaction to a particular processing queue based on the target object, and guaranteeing that subsequent transactions associated with the target object are assigned to the same processing queue and the same processor, which guarantees that the target object will be modified in correct sequence. | 10-24-2013 |
20130282751 | System and method for loading objects for object-relational mapping - 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 include querying the database to locate a second data type to be created, wherein the second data type depends from the first data type, wherein the data objects of the second set depend from the data objects of the first set, and associating each data object of the second set to an associated parent object of the first set. | 10-24-2013 |
20130179494 | Collaborative, contextual enterprise networking systems and methods - 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 for the workplace. This enterprise media adapts to its users to create an interface that will help the user complete work, connect with others, and use various applications all in one place. | 07-11-2013 |
20130138679 | Database query optimization and cost estimation - 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 records that satisfy the relation. Further, the described approach may be used for generalized N-ary tree queries and cost estimations. | 05-30-2013 |
20120278315 | Integrated phonetic matching methods and systems - 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 compared to transduced data entries. Results from the comparisons between the query and the data entries may be used to guide the comparisons between the transduced query and the transduced data entries. Search results are determined based on the guided comparisons. | 11-01-2012 |
20120265899 | FAST CONTENT-BASED ROUTING - 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 associated with a particular subscription in a message header if the message corresponds to the subscription. The system may then analyze the router table to determine one or more receiver machines associated with the ID in the header of the message. The system may then send, from a sender machine to one or more receiver machines, one or more messages containing the ID in the header of the message. | 10-18-2012 |
20120254245 | Relational database joins for inexact matching - 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. | 10-04-2012 |
20120136950 | COMPRESSION OF MESSAGE INFORMATION TRANSMITTED OVER A NETWORK - 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 this part of the message, and provide the compression instructions to at least one of the plurality of sender machines, such that the compression instructions reduce size of the messages having the part of the message associated with the compression instructions. | 05-31-2012 |
20120131285 | LOCKING AND SIGNALING FOR IMPLEMENTING MESSAGING TRANSPORTS WITH SHARED MEMORY - 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 available after the sender application has completed writing the data. The systems and methods further disclose sending a signal, by the sender application, to a receiver application, wherein the signal notifies the receiver application that writing the data to a particular page is complete, reading, by the receiver application, the data from the one or more pages, and de-allocating, by the receiver application, the one or more pages. | 05-24-2012 |
20120131117 | HIERARCHICAL BITMASKS FOR INDICATING THE PRESENCE OR ABSENCE OF SERIALIZED DATA FIELDS - 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 message. The systems and methods also dynamically determine compression instructions to compress the bitmask, and provide the compression instructions to the sender machine, wherein the compression instructions reduce size of the bitmask associated with the message to be sent to the receiver machine. | 05-24-2012 |
20120131046 | FAST MATCHING FOR CONTENT-BASED ADDRESSING - 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 of the message match a content value of the query stored in the tree structure; and accept, by the receiver machine, the message if the content value of the message matches one or more content values of the query. | 05-24-2012 |
20120117560 | Capability model for deploying componentized applications - Disclosed are systems and methods deploying a componentized application using a deployment tool to analyze an application to be deployed, where the application depends on at least two or more deployed capabilities that are interrelated, and the deployed capabilities each provide independent functionality. The deployment tool may automatically identify two or more deployed capability providers that provide the two or more deployed capabilities. | 05-10-2012 |
20120117559 | Capability model for deploying componentized applications - Disclosed are systems and methods for deploying a componentized application in a deployment environment using a deployment tool to receive a description of how to deploy the component onto a logical description of the deployment environment, and map the logical description of the deployment environment to the deployment environment based on the mapping data. The deployment tool may receive a component to be deployed in the deployment environment, and automatically deploy the component to the deployment environment. The deployment tool may also generate mapping data including one or more desired attributes of the deployment model based on the description. | 05-10-2012 |
20120117539 | Capability model for deploying componentized applications - Disclosed are systems and methods for deploying a componentized application using a deployment tool to deploy an application expressing a requirement for a first capability associated with a second capability, and to find a first capability provider providing the first capability, where the second capability is provided by a second capability provider, and the second capability is dynamically associated with the first capability provider. | 05-10-2012 |
20120117076 | Suffix array candidate selection and index data structure - A method and system for identifying a candidate subset of a data set comprises comparing suffixes of query field values to data field values of records in the data set. Sufficiently similar records are included in the candidate subset. Query field value suffixes may range in length from the query field value itself down to a minimum suffix length. The longest suffix may be processed first, and then successively shorter suffixes may be processed until a satisfactory number of candidates are identified. Entries in an index data structure derived from the data set may associate various suffixes found in the data set with individual records. The data structure entries may include record keys identifying records with data field values identical to the suffix and may also include suffix pointers identifying related data structure entries with suffixes similar to the entry's suffix. | 05-10-2012 |
20110307877 | Managing static data structures of legacy software in dynamic class loader environments - A method for managing static data structures of a legacy data modeling software product in a dynamic class loader environment comprises constructing a bundle-specific registry for each software bundle in the dynamic class loader environment and instructing the legacy data modeling software product to use the bundle-specific registry rather than its default registry when creating in-memory representations of data model classes associated with a particular software bundle. Constructing a bundle-specific registry may include using the bundle's configuration metadata to calculate a dependency graph identifying the other bundles on which the software bundle depends. An initializer may construct the initial set of bundle-specific registries, and a listener may construct bundle-specific registries for new software bundles entering the system. | 12-15-2011 |
20110296254 | Distillation and reconstruction of provisioning components - Disclosed is a method for archiving provisioning errors that may occur during provisioning of a computing environment having configurable components. The method may comprise distilling a provisioning request, wherein the distilling the provisioning request includes recording, in a provisioning archive, a provisioning request component, and filtering the provisioning request component. The provisioning request component may comprise a component requested to be added to, removed from, and/or updated in the computing environment. The method may further comprise distilling a provisioning target, wherein the distilling the provisioning target includes recording, in the provisioning archive, a target environment, and filtering an existing component of the target environment. Additionally, the method may comprise applying the provisioning request to the provisioning target, including provisioning the target environment, resulting in an updated provisioning target. Furthermore, the method may comprise determining if a provisioning error occurred, and adding the provisioning error, if any, to the provisioning archive. | 12-01-2011 |
20110276358 | Allocation of work items via queries of organizational structure and dynamic work item allocation - Disclosed are systems and methods for identifying one or more individuals in an organizational model to work on a particular work item where the method includes receiving a query having one or more attributes where the one or more attributes indicate the criteria for one or more individuals to work on a particular work item. The systems and methods further include searching an organizational model for the one or more individuals associated with the attributes defined in the query, and identifying the one or more individuals associated with the attributes defined in the query. The systems and methods also include allocating or offering the particular work item to the one or more of the individuals associated with the one or more attributes defined in the query. | 11-10-2011 |
20110231428 | INTELLIGENT CONSOLE FOR CONTENT-BASED INTERACTIVITY - The intelligent console method and apparatus of the present invention includes a powerful, intuitive, yet highly flexible means for accessing a multi-media system having multiple multi-media data types. The present intelligent console provides an interactive display of linked multi-media events based on a user's personal taste. The intelligent console includes a graph/data display that can provide several graphical representations of the events that satisfy user queries. The user can access an event simply by selecting the time of interest on the timeline of the graph/data display. Because the system links together all of the multi-media data types associated with a selected event, the intelligent console synchronizes and displays the multiple media data when a user selects the event. Complex queries can be made using the present intelligent console. The user is alerted to the events satisfying the complex queries and if the user chooses, the corresponding and associated multi-media data is displayed. | 09-22-2011 |
20110145328 | CONNECTED INSTANCE GROUP OF DYNAMICALLY ADDRESSED HOSTS - A system for building and maintaining a connected instance group of machines includes protocols for instance group creation; master machine creation, operation, and recovery; and peer machine creation, operation, and recovery. These protocols allow each machine to connect with a data source and to build a local hosts file containing the name and IP addresses of the machines in the instance group and, thus, provides network connectivity among the machines in the instance group. | 06-16-2011 |
20110066591 | POLICY-BASED STORAGE STRUCTURE DISTRIBUTION - 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. Multiple entries having the same key value in a database- or table-like structure allow for distribution of policy-based storage and retrieval by key value and for queue semantics to be utilized for microqueues in the large database- or table-like structure. | 03-17-2011 |
20100083145 | Service Performance Manager with Obligation-Bound Service Level Agreements and Patterns for Mitigation and Autoprotection - The disclosed Service Performance Manager is an enterprise software platform that monitors and proactively manages the health and performance of both individual and grouped services based on service level agreements, providing better visibility and control over individual and group services including, but not limited to, IT and business services. The Service Performance Manager predicts and solves potential customer-related issues before customers are aware of them, enabling an organization to meet quality of services objectives. Unlike other software platforms, the disclosed service performance manager automatically optimizes resources, services and service level agreements with finer granularity and precision, while remaining steadfastly vendor neutral, allowing the Service Performance Manager to manage many different applications and Service Oriented Architecture platforms simultaneously. The disclosed Service Performance Manager allows the user to monitor and manage the performance of individual or grouped services, and provides the visibility in service monitoring from both, technical and business perspectives. | 04-01-2010 |
20080201575 | Systems and methods for automating certification authority practices - Systems and methods for efficiently verifying identities and for generating and signing digital certificates associated with those identities are disclosed. Generation of a digital certificate of an entity may begin by receiving a certificate signing request from the entity at a certification authority, the certificate signing request including verification information. The certificate signing request may be transmitted to a registration authority and the information of the certificate signing request may be processed. Whether to approve the certificate signing request may be determined, based on a result of the processing, and an approval may be granted when the certificate signing request is approved. A certificate associated with the entity may be generated when the approval is received, and the certificate may be transmitted to the entity. | 08-21-2008 |