Abstract: The present invention extends to methods, systems, and computer program products for partitioning online databases. Online database operations, such as, for example, SPLIT, MERGE, and DROP, are used to alter the arrangement of partitions in a federated database. A SPLIT operation splits rows at one partition across a plurality of other partitions. A MERGE operation merges rows at a plurality of partitions in to one partition. A DROP operation shifts responsibility for rows of data from one partition to another partition and then drops the rows from the one partition.

Abstract: A method is provided in one example and includes receiving network traffic associated with a first user and a second user; evaluating keywords in the network traffic in order to identify a topic of discussion involving the first and the second users; determining a first sentiment associated with a first data segment associated with the first user; determining a second sentiment associated with a second data segment associated with the second user; and generating an argument map based on the first data sentiment and the second data sentiment.

Abstract: A query received from a user is directed to a particular search application (e.g. an Enterprise search portal) that is associated with a result source from which to retrieve results. The received query may be federated to additional result sources when the received query is determined to be a popular query in a result source. Query logs associated with the additional result sources are analyzed to determine when a query is popular as compared to the original result source. The query may be altered before being executed that uses one or more of the additional result sources. When the query (altered/unaltered) is determined to be popular for any of the additional result sources as compared to the original result source, the query is executed using that additional result source.

Abstract: A method for managing a logical statement within a distributed database includes checking, responsive to receipt of a first logical statement for by first database management system node, whether the first logical statement is stored within a segment of the distributed database; and storing, responsive to a determination that the first logical statement is not stored within a segment of the distributed database, storing the first logical statement in at least one of non-unique fact table and unique fact table.

Abstract: A search engine can be configured to improve search times by implementing a parallel computing architecture. The index is split across a plurality of independent search nodes. A query is communicated to each of the parallel nodes and the query is searched in each independent node. The results from each node are routed to a federator that is configured to aggregate the results to a result set. The federator is configured to determine a subset of intermediate results to retrieve and aggregate from each of the independent nodes. The federator determines a number of results to retrieve from each of the nodes based at least in part on the number of nodes and the number of search results desired in the results set.

Abstract: Federating master data management systems may include a network-aware adapter configured with a host master data management node. The network-aware adapter may establish one or more links with other master data management systems to allow the system to work together and leverage each other's data.

Abstract: A method and system for searching data is provided. An index of a search engine is accessed. Distribution data is extracted from the index of the search engine. A value index is generated from the distribution data. A search request is received from a client. A query is generated based on the search request and the value index. The query is forwarded to the search engine for execution.

Abstract: A system has a processing pipeline with a plurality of processing stages, where each of the processing stages has one or plural processors, and where the processing stages are individually and independently scalable. A first of the processing stages of the processing pipeline provides a received date update into an update data structure, where the update data structure is accessible to process a query received by the system. One or more additional of the processing stages transforms the update data structure to allow for merging of the transformed update data structure into a database, where the transformed update data structure is accessible to process the query. Content of the transformed update data structure is stored into the database.

Abstract: Methods and apparatus, including computer program products, implementing and using techniques for automatic workflow processing in a workflow processing computer system.

Abstract: The present invention addresses the problem of partitioning database relations across a plurality of hosts in a shared-nothing cluster while minimizing communication costs. A new partitioning approach for database relations—join-partitioning—is introduced that focuses on relations and their dependencies to a priori partition the plurality of relations to the plurality of hosts such that each host can locally compute a large class of queries over its partitioned data in isolation at query time, independent of other hosts in the cluster. Such an approach thus overcomes the primary bottleneck, i.e., the network, in deploying database systems over shared-nothing clusters by allowing them to seamlessly scale linearly to tens of thousands of hosts and manage tens or hundreds of terabytes of data.

Abstract: Various systems and techniques are disclosed relating to dynamic storage of documents. According to one or more exemplary systems and techniques, a location may be dynamically determined from a group of locations to store a state associated with a document based on one or more criteria.

Abstract: The present invention provides a federation of clusters for uniform and consistent enterprise-wide data management. The federation is an affiliation of clusters, dispersed over different locations that provide a comprehensive solution to the management of all types of data stored in different devices. Each cluster owns data sources connected to the same network it is attached to. Devices connected to the network, and the cluster for managing data accessible through the network constitute an autonomous area. Results from different locations are consolidated to produce unified results and reports. The enterprise-wide data management allows enterprises to validate compliance with federal regulations and insures that data management objectives are being met in all departments within an organization. In addition to enterprise-wide data management, a member cluster of a federation can perform data management local to its autonomous area and execute policies formulated for that area.

Abstract: A method of processing a plurality of instances in a federated deployment of SOA applications can include the steps of receiving a transaction request to retrieve data, the request specifying retrieving the data stored according to range of indices of the federated deployment, processing each of the instances in a predetermined order to retrieve the data; and calculating a total number of records in the federated deployment.

Abstract: A search engine can be configured to improve search times by implementing a parallel computing architecture. The index is split across a plurality of independent search nodes. A query is communicated to each of the parallel nodes and the query is searched in each independent node. The results from each node are routed to a federator that is configured to aggregate the results to a result set. The federator is configured to determine a subset of intermediate results to retrieve and aggregate from each of the independent nodes. The federator determines a number of results to retrieve from each of the nodes based at least in part on the number of nodes and the number of search results desired in the results set.

Abstract: The systems and methods partition digital data units in a content aware fashion without relying on any ancestry information, which enables one to find duplicate chunks in unrelated units of digital data even across millions of documents spread across thousands of computer systems.

Abstract: The present invention allows highly efficient high-speed data processing based on dynamic data federation among a plurality of data display means, without increasing the data volume in the individual data display means. A user data display section has a classification and component specific information table, which is extracted from a three-dimensional component database and a two-dimensional component database, and a component attribute data table associated thereto. A federation control section controls data federation among a three-dimensional component data display section, two-dimensional component data display section and user data display section.

Abstract: Data integration and data analysis using computing equipment, software as well as hardware, includes a system and method for integrating data from various data sources, structured and unstructured, without physically creating a data warehouse and automatically generating queries for analysis of the integrated data from a multitude of different views.