Patent application number | Description | Published |
20090248631 | System and Method for Balancing Workload of a Database Based Application by Partitioning Database Queries - A method and system for processing complex long running queries with respect to a database in which the database workload is determined in terms of quality of service (QoS) requirements of with respect to short running queries, which can be of a transactional type, in which long running queries are partitioned into a plurality of sub-queries that satisfy the database QoS requirements, are then processed and the results of processing the plurality of sub-queries are aggregated so as to correspond to the processing of the long running query. | 10-01-2009 |
20100223226 | SYSTEM FOR MONITORING GLOBAL ONLINE OPINIONS VIA SEMANTIC EXTRACTION - A system for transforming domain specific unstructured data into structured data including an intake platform controlled by feed back from a control platform. The intake platform includes an intake acquisition module for acquiring data building baseline data related to a domain and problem of interest, an intake pre-processing module, an intake language module, an intake application descriptors module, and an intake adjudication module. The control platform includes a control data acquisition module, a control data consistency collator, a control auditor, a control event definition and policy repository, an error resolver, and an output that outputs results of the workflow into structured data enabled to be used in data analytics. | 09-02-2010 |
20120179684 | SEMANTICALLY AGGREGATED INDEX IN AN INDEXER-AGNOSTIC INDEX BUILDING SYSTEM - A computer program product for an indexer-agnostic index building system includes a computer readable storage medium to store a computer readable program, wherein the computer readable program, when executed on a computer, causes the computer to perform operations for creating a semantically aggregated index. The operations include: extracting documents from a data source, wherein each document includes a data object; distributing the documents to a plurality of processing nodes within the system; for each node: indexing the data objects for each document into fields using semantic rules; and grouping indexed data objects for related fields by: classifying the documents into logical groups based on the semantic rules; and creating a searchable index shard for related logical groups. | 07-12-2012 |
20120254089 | Vector throttling to control resource use in computer systems - Embodiments of the invention relate to building a distributed reverse semantic index. In one general embodiment a plurality of documents are received with each document having at least one defined rule and or semantic. The documents are distributed among a plurality of nodes of a system. The documents are processed in a generally parallel fashion. Processing the documents includes processing text data of each of the document and breaking each document into fields to index the text data to create index data by deferring how to categorize the text data based upon the defined rule and or semantics. The indexed data is combined back together to create an indexer-agnostic semantic index including a plurality of the semantic index shards and to semantically classify the documents based on the index shards into groups based on document type to create the distributed reverse semantic index. | 10-04-2012 |
20120323919 | DISTRIBUTED REVERSE SEMANTIC INDEX - Embodiments of the invention relate to building a distributed reverse semantic index. In one general embodiment a plurality of documents are received with each document having at least one defined rule and or semantic. The documents are distributed among a plurality of nodes of a system. The documents are processed in a generally parallel fashion. Processing the documents includes processing text data of each of the document and breaking each document into fields to index the text data to create index data by deferring how to categorize the text data based upon the defined rule and or semantics. The indexed data is combined back together to create an indexer-agnostic semantic index including a plurality of the semantic index shards and to semantically classify the documents based on the index shards into groups based on document type to create the distributed reverse semantic index. | 12-20-2012 |
20120323920 | CREATING A SEMANTICALLY AGGREGATED INDEX IN AN INDEXER-AGNOSTIC INDEX BUILDING SYSTEM - A method for creating a semantically aggregated index in an indexer-agnostic index building system includes: extracting documents from a data source, each document including a data object; distributing the documents to a plurality of processing nodes within the system; for each node: indexing the data objects for each document into fields using semantic rules; and grouping indexed data objects for related fields by: classifying the documents into logical groups based on the semantic rules; and creating a searchable index shard for related logical groups. | 12-20-2012 |
20150220510 | INTERACTIVE DATA-DRIVEN OPTIMIZATION OF EFFECTIVE LINGUISTIC CHOICES IN COMMUNICATION - Embodiments of the present invention relate to interactive optimization of messages published to digital media based on past performance of similar messages. In one embodiment, an input token is received. At least one candidate substitute token is retrieved from a dictionary. The dictionary comprises a mapping from the input token to the at least one candidate substitute token. A score associated with the at least one candidate substitute token is determined. A score associated with the input token is determined. The score associated with the input token, the at least one candidate substitute token, and the score associated with the at least one candidate substitute token are outputted. | 08-06-2015 |
20150220643 | SCORING PROPERTIES OF SOCIAL MEDIA POSTINGS - Embodiments of the present invention relate to scoring of messages published to digital media based on past performance of similar messages. In one embodiment, an input token is received. A plurality of messages is selected from a corpus of messages. Each of the plurality of messages has a publication time and contents. The contents of each of the plurality of messages include the input token. A plurality of root messages is determined from the plurality of messages. Each of the plurality of root messages relates to at least one related message. The at least one related message is one of the plurality of messages. Each of the plurality of root messages is the earliest message of the corpus of messages related to its at least one related message. A score is determined for the input token based on the plurality of root messages. | 08-06-2015 |