Abstract: In an approach to preparing a query execution plan, a host node receives a query implicating one or more data tables. The host node broadcasts one or more implicated data tables to one or more processing nodes. The host node receives a set of node-specific query execution plans and execution cost estimates associated with each of the node-specific query execution plans, which have been prepared in parallel based on global statistics and node-specific low level statistics. The host node selects an optimal query execution plan based on minimized execution cost.

Abstract: Embodiments include pre-processing work items to be processed by computerized processing elements. Aspects include accessing a performance index, which relates to (dynamic) processing performances of work items as processed by the computerized processing elements. Aspects also include determining a time interval (during which the receiver may group queued work items into a block, according to the accessed performance index. Aspects further includes setting a timer to the determined time interval, to allow the receiver to group work items being queued until that time interval has elapsed, according to the timer set. As a result, a block of grouped work items will be obtained, which can then be passed to a scheduler for subsequent processing by computerized processing elements.

Abstract: A first query is detected. The first query is for a storage device, and pulls a result set from the storage device using a set of predicates. The first query satisfies a size criterion. A new set of predicates of the result set is identified. The new set of predicates does not include any predicates of the original set of predicates. A second query which is the same as the first query is detected. The new set of predicates is used to determine the result set.

Abstract: Embodiments effect the combination of data from different tables (e.g., of an underlying database), and the visualization of that combined table data in an incremental manner. Columns from a second table may be selectively combined with those of a first table, manually by user selection and/or automatically by best guess matching. Such matching may be based upon commonalities between table column headers. A menu may allow user selection of specific table(s)/table column(s) to be combined with a first table, as well as a manner of that combination (e.g., particular types of SQL join operations). The table data combination process is visualized step-by-step (e.g., allowing toggling and forward/backward navigation between interface screens), ensuring the user is able to follow data migration in the combined workflow, and appreciate/recognize changing values resulting therefrom.

Abstract: Disclosed herein are system, method, and computer program product embodiments for utilizing join cardinality to improve the performance of query processing. An embodiment operates by a database engine receiving a query including a join operation on a first and a second table using a join predicate, and a tag for the join operation indicating a cardinality relationship between the first and the second table when satisfying the join predicate. Then, the database engine generates a query processing plan for performing the query. For the join operation, the database engine selects one of the first or the second tables to remove from the join operation based on a type of the join operation and the tag. Based on the selecting, the database engine may remove may the join operation and the selected table from the query processing plan.

Abstract: Methods and apparatus, including computer program products, are provided for a case join. In one aspect, there is provided method, which may include receiving a query for a predefined view that is configured to inhibit modification; detecting whether the predefined view includes a database table extended to include an additional column; and generating, in response to the query, a view based on a case join, when the predefined view includes the database table extended to include the additional column. Related apparatus, systems, methods, and articles are also described.

Abstract: Disclosed herein are system, method, and computer tangible medium embodiments for generating a relational database model from a model view that provides an estimate for generating query plan for a query on the model view, according to an embodiment. A join model of a model view set on one or more database tables is received. At least one index conversion of the join model is performed, where the index conversion converts at least one index in the join model into at least one leaf node in a relational model tree. At least one join conversion of the join model is performed where the at least one join conversion generates a node in the relational model tree that joins a first and second leaf nodes in the relational model tree. A requested parameter conversion is perfonned, where the requested parameter conversion includes an attribute or key figure requested by a query.

Abstract: A received query is analyzed to provide a set of potential bushy tree operation plans that include the creation of one or more “sub-joins” that provide intermediate resultant “sub-tables”, and using these sub-tables as operands in the other predicates of the query. The received query is analyzed to identify “satellite” tables and “seed” tables. A satellite table is a table of the database that is filtered by a selective predicate, and is connected to only one other table in the database via at least one linking predicate, and a seed table is a table of the database that is connected to a satellite table and at least one other table. Multiple candidate operation plans are formulated as bushy trees that include a sub-join of each seed table and its connected satellite table. A least cost operation plan is selected for execution from among these candidate operation plans and the conventional least cost linear operation plan based on the costs associated with each operation plan.

Abstract: Embodiments for data deduplication of an initial snapshot of a data set in a storage system by a processor. An intra-snapshot similarity index, inclusive of representations of the data inside the initial snapshot, is built. The intra-snapshot similarity index is used for deduplication of the initial snapshot. The intra-snapshot similarity index is merged with a global similarity index.

Abstract: Embodiments for reducing resource consumption of a similarity index in data deduplication by a processor. Only a latest generation of repository data is represented in the similarity index. Implicit deletion is applied in the similarity index. A subset of bytes of a full representative value is maintained in a similarity index entry.

Abstract: Keeping track of which communications are related, or linked, in a series of communications is an important feature in many electronic document systems. As communication chains grow and branch, however, these systems require meticulous use of unique document identifiers to maintain those links. Systems and methods to create or restore these links in the absence or misuse of unique document identifiers are therefore provided. Responsive communications from parties are linked with the initial communications whose requests are answered by the responsive communications. Additionally, any requests not answered by the responsive communications may be automatically configured into a secondary communication which will be linked with the responsive communication and the initial communication so that its responsive communication may be built into the chain of communication.

Abstract: Embodiments of the present disclosure include a method, a system, and a computer program product for fusing a stream operator into more than one processing element within a streaming application. The method includes receiving an instruction to concurrently fuse, into a second processing element, a stream operator of interest that is fused into a first processing element. The method includes determining whether the stream operator of interest is stateful. The method includes compiling, in response to determining the stream operator of interest is stateful, a clone of the stream operator of interest into the second processing element so that the clone is synchronized with the stream operator of interest.

Abstract: Search servers, end devices, and search methods are provided. A search server includes a global index database and a processing unit. The processing unit executes a message queue service conforming to an asynchronous communication protocol. The message queue service receives a query comprising a keyword, determines that the global index database has no global search result corresponding to the keyword, distributes the keyword to a plurality of end devices in the distributed network, receives a plurality of local search results from at least a portion of the end devices, generates a global search result for the keyword according to the local search results, and stores the global search result in the global index database.

Abstract: A system for enhancing communications based on physical trade documents includes a document intake machine comprising a document scanner and a data extractor. The document intake machine receives a physical trade document from an entity. The document scanner may scan the physical trade document to create an electronic file of the physical trade document. The data extractor determines entity identification information from the electronic file and entity performance information from the electronic file. A trade executing machine receives the entity identification information and entity performance information from the document intake machine and assigns an electronic customer number to the electronic file, wherein the electronic customer number is associated with the entity identification information.

Abstract: Various systems and methods are provided that retrieve raw data from issuers, reorganize the raw data, analyze the reorganized data to determine whether the risky or malicious activity is occurring, and generate alerts to notify users of possible malicious activity. For example, the raw data is included in a plurality of tables. The system joins one or more tables to reorganize the data using several filtering techniques to reduce the processor load required to perform the join operation. Once the data is reorganized, the system executes one or more rules to analyze the reorganized data. Each rule is associated with a malicious activity. If any of the rules indicate that malicious activity is occurring, the system generates an alert for display to a user in an interactive user interface.

Abstract: A method for highlighting an electronic document comprises mining one or more sources to obtain data corresponding to a user, inferring one or more interests of the user based on the data, analyzing the electronic document to determine at least one portion of the electronic document related to the one or more interests, and automatically highlighting the at least one portion of the electronic document related to the one or more interests.

Abstract: The present application is directed towards systems and methods for selecting a database from a plurality of databases to forward a SQL query request based on a property of the SQL request. A device intermediary to a plurality of clients and databases may establish a plurality of connections to the plurality of databases. The device may receive, from a client of the plurality of clients, a request to execute a SQL query. The device may evaluate one or more properties of the request to execute the SQL query responsive to a policy. The device may select a database from the plurality of databases based on a result of evaluation of the one or more properties of the request to execute the SQL query. The device may forward the request to execute the SQL query to the selected database via a connection of the plurality of connections.

Abstract: A system to collect and analyze performance metric data recorded in time-series measurements, converted into unicode, and arrange into a special data structure. The performance metric data is collected by one or more probes running on machines about which data is being collected. The performance metric data is also organized into a special data structure and then compressed prior to transmission to a server over any data path. The data structure at the server where analysis is done has a directory for every day of performance metric data collected with a subdirectory for every resource type. Each subdirectory contain text files of performance metric data values measured for attributes in a group of attributes to which said text file is dedicated. Each attribute has its own section and the performance metric data values are recorded in time series as unicode hex numbers as a comma delimited list. Analysis of the performance metric data is done using regular expressions.

Abstract: Methods, systems, and apparatus, for selecting one or more native application deep links from search results and instantiating, for each native application deep link that is selected, a background instance of the native application to which the native application deep link corresponds; determining, in response to an occurrence of a background unload event, background instances of the native applications instantiated from the native application deep links and that were not brought to the foreground prior to the occurrence of the background unload event; and terminating each of the background instances of the native applications instantiated that were not brought to the foreground prior to the occurrence of the background unload event.

Abstract: A user device includes a computing device. The computing device transmits a search query from the user device and receives a first grouped set of search results based on the search query. The first grouped set corresponds to a first application. The first grouped set includes a header and at least two search results. The header includes a first access mechanism corresponding to a first state of the first application. Each of the search results (i) corresponds to a respective second state of the first application responsive to the search query and (ii) includes a respective second access mechanism corresponding to the respective second state. A display displays (i) the first grouped set of search results and (ii) a header link corresponding to the header. In response to the header link being selected, the computing device accesses the first state of the application using the first access mechanism.

Abstract: In various example embodiments, a system and method for consistent schema-less and scalable database storage are described herein. A data object is generated. The data object corresponds to a column of a table from a database. The data object includes information regarding an order that is placed over a network publication system. The data object is stored in the column of the table in the database. A request to access the data object is received from a device of a first user. The data object is transmitted to the device of the first user. The data is kept coherent during concurrent updates by using optimistic locks. The data is kept backward and forward compatible utilizing intermediate data structures common to both versions of the software. The data is kept searchable by using lookup indexes. The storage system is kept scalable by sharding data across many databases.

Abstract: A source data file can be loaded into a database by extracting data from the source data file at a computing device, validating the data from the source data file at the computing device, transforming the data from the source data file at the computing device, requesting the data to be transferred to a first database at a first message processor module, delivering the data to the first database, and responding that the data has been transferred to the first database at the first message processor module to acknowledge receipt of the data in the database at the computing device. The data may be delivered to one or more databases using, for example, a plurality of distributed data facility (DDF) threads.

Abstract: A system and method for the automated monitoring of inmate telephone calls as well as multi-modal search, retrieval and playback capabilities for said calls. A general term for such capabilities is multi-modal audio mining. The invention is designed to provide an efficient means for organizations such as correctional facilities to identify and monitor the contents of telephone conversations and to provide evidence of possible inappropriate conduct and/or criminal activity of inmates by analyzing monitored telephone conversations for events, including, but not limited to, the addition of third parties, the discussion of particular topics, and the mention of certain entities.

Abstract: A source data file can be loaded into a database by extracting data from the source data file at a computing device, validating the data from the source data file at the computing device, transforming the data from the source data file at the computing device, requesting the data to be transferred to a first database at a first message processor module, delivering the data to the first database, and responding that the data has been transferred to the first database at the first message processor module to acknowledge receipt of the data in the database at the computing device.

Abstract: Techniques related to an in-memory key-value store for a multi-model database are disclosed. In an embodiment, a relational database may be maintained on persistent storage. The relational database may be managed by a database server and may include a database table. The database table may be stored in a persistent format. Key-value records may be generated within volatile memory accessible to the database server by converting data in the database table to a key-value format. The key-value format may be different from and independent of the persistent format. A database statement referencing the database table may be executed based on determining whether to access one or more key-value records in the volatile memory or to access the data in the database table. In response to determining to access the one or more key-value records, the database server may access the one or more key-value records in the volatile memory.

Abstract: According to various embodiments, systems and methods for performing unit conversion operations in a database system are provided. According to embodiments, a database operation will require unit conversion. A number of unit conversions that might be required both before and after performance of the operation can then be estimated. At least some of the data entries implicated by the operation can then be converted from a first unit to a second unit depending on the result of the estimation.

Abstract: Text is extracted from and information resource such as documents, emails, relational database tables and other digitized information sources. The extracted text is processed using a decomposition function to create. Nodes are a particular data structure that stores elemental units of information. The nodes can convey meaning because they relate a subject term or phrase to an attribute term or phrase. Removed from the node data structure, the node contents are or can become a text fragment which conveys meaning, i.e., a note. The notes generated from each digital resource are associated with the digital resource from which they are captured. The notes are then stored, organized and presented in several ways which facilitate knowledge acquisition and utilization by a user.

Abstract: Systems and methods for visualization and control of application interactions are disclosed. An approach includes receiving a selection of a primary application, retrieving information regarding a relationship between the selected primary application and at least one of another application and a computer device resource, and calculating a thickness value for the relationship, wherein the thickness value represents at least one parameter of interest to a user. The approach includes displaying icons representing the selected primary application and the other application(s) and computer device resource(s), and displaying at least one relationship line between the selected primary application and the other application(s)/computer device resource(s), wherein the at least one relationship line has a line weight based on the thickness value.

Abstract: Methods and apparatus, including computer program products, are provided for optimizing information presentation. In one aspect, there is provided method, which may include receiving, by a monitoring engine, one or more messages sent from one or more runtime instances of a system being monitored by the monitoring engine; storing, by the monitoring engine, the received one or more messages; prioritizing, by the monitoring engine, the one or more runtime instances for presentation at a user interface view by determining, based on the received one or more messages, a rating for each of a plurality of categories associated with the one or more runtime instances; selecting, based on the prioritizing, information indicative of the state of the prioritized one or more runtime instances; generating a user interface view including the selected information; and displaying the generated user interface view.

Abstract: In one embodiment, a cursor management process inserts temporal references into a plurality of records written to a table of a shared database, the temporal references indicative of an order in which the records are written. A table write cursor points at a last-written record from among the plurality of records, and read cursors point to a last-read record of a corresponding application. The cursor management process may then provide, table updates to a particular application by determining a chain of one or more updated records of the table from the last-read record of the particular application to the last-written record based on walking a particular read cursor for the particular application through the temporal references of the one or more updated records until the particular read cursor points to the last-written record according to the table write cursor.

Abstract: A computer system for managing replication configurations includes program instructions to receive a replication configuration for replicating data, wherein the replication configuration defines at least a target table in a target database based on a source table in a source database. The program instructions initialize a federated view, wherein the federated view is based on at least the source table in the source database as defined in the replication configuration. The program instructions utilize the federated view to satisfy requesting applications, where requesting applications obtain data from the federated view. The program instructions to, responsive to determining the replication of data is in spec, utilize the target table in the target database to satisfy requesting applications.

Abstract: A method may include receiving a query for data to be provided by a database server, wherein the query includes an indication of a maximum lag. The method may further include determining whether a hint is available to apply to the query, wherein the hint affects an execution of the query. When no hint is available, a baseline database server may be selected to be the database server. When the hint is available, a replication server or a cache server may be selected to be the database server based on the hint and the maximum lag. The query may be processed at the selected database server.

Abstract: Technical solutions are described for determining data replication cost for a data server. In an example, a method for estimating the data replication cost includes receiving an identification of a source table and an identification of a target table for the data replication. The method further includes receiving a selection of a data replication scheme to be used to replicate the data. A costing system that implements the method determines the data replication cost, based on a conversion cost for conversion of the data from the source table to the target table, and a transfer cost for transfer of the data from the source table to the target table. The costing system communicates the data replication cost to an administrator.

Abstract: A computer-implemented method is provided that includes identifying an input dataset formatted as an input matrix, the input matrix including a plurality of rows and a plurality of columns. The computer-implemented method also includes dividing the input matrix into a plurality of input matrix blocks. Further, the computer-implemented method includes distributing the input matrix blocks to a plurality of different machines across a distributed filesystem, and sampling, by at least two of the different machines in parallel, at least two of the input matrix blocks. Finally, the computer-implemented method includes generating at least one sample matrix based on the sampling of the at least two of the input matrix blocks.

Abstract: Among other things, we describe a technique for storing data of a data cube in one or more flat files. We also describe a technique for processing a query to access data of a data cube. These techniques can be implemented in a number of ways, including as a method, system, and/or computer program product stored on a computer readable storage device. One of the techniques includes receiving a set of data records having at least two dimensions, generating a set of grouped data records ordered by cardinality, and generating and storing at least one flat file containing the set of grouped data records, wherein a particular data record of the grouped data records includes a primary key that can be used to identify data of the particular data record in response to a request.

Abstract: Refining cluster definition: (i) receiving data items, each characterized by values respectively corresponding to a set of dimension(s); (ii) receiving initial cluster identification that divides the set of data items into multiple initial clusters; (iii) determining a distribution curve, with respect to a first dimension, of data items of a first initial cluster; (iv) determining a distribution curve, with respect to the first dimension, of data items of a second initial cluster; and (v) determining a first-dimension-first-cluster-second-cluster cut-off value such that the following two proportions are substantially equal: (a) a proportion of the area under the first distribution curve and below the first-dimension-first-cluster-second-cluster cut-off value to the total area under the first distribution curve, and (b) a proportion of the area under the second distribution curve and above the first-dimension-first-cluster-second-cluster cut-off value to the total area under the second distribution curve.

Abstract: Techniques are provided for detecting new topics and themes and assigning new posts to existing topic and/or theme clusters in online community discussions. A post posted to an online community is received and a post feature vector representative of the post is created. The post is compared to a plurality of centroid feature vectors, each centroid feature vector being representative of a respective post cluster and associated with a theme. Upon determining that similarity between the post feature vector and one of a plurality of centroid feature vectors satisfies a minimum similarity threshold, the post is assigned to the post cluster of which the centroid feature vector is representative. Upon determining that similarity between the post feature vector and any of the plurality of centroid feature vectors is below the minimum similarity threshold, a new theme cluster is created and the post is assigned to the new theme cluster.

Abstract: The present invention provides a method and a system for ordering browsing histories, wherein the method for ordering browsing histories includes: receiving a triggering instruction of a user for viewing browsing histories; acquiring the geographical location information of a current location; extracting browsing histories corresponding to the geographical location information; and displaying the browsing histories extracted. The present invention also discloses a system for ordering browsing histories. The method and the system for ordering browsing histories provided by the present invention can order the browsing histories according to the geographical location information of the user, and enable the user to quickly find the history to be browsed, thus improving the user experience.

Abstract: A virtual record manager and a data exchange engine are provided for dynamically defining data records in a database and for dynamically allocating instances of defined data records. These components are capable of mediating between the database and application and client interface layers to facilitate exchange of information over a network. Embodiments are configured to allow complex data records having a plurality of related fields, and to allow management and exchange of information at both the data field level and data record level.

Abstract: A system comprising: a term retrieval module configured to receive a search query including a search term and to output an expanded search query including the search terms and an additional search terms; a search engine sub-system configured to receive the expanded search query and to output one or more search results based on the expanded search query, the one or more search results indicating one or more information resources of relevance to the expanded search query, wherein the system further comprises: a classification module configured to determine a language or language variant of the search term of the search query, identify the additional search term based on the language or language variant of the search term, and output the additional search term to the term retrieval module

Abstract: A user enters a query into an element of a user interface. Query suggestions that are based on the query are displayed around the query in the user interface. Each of the query suggestions is displayed in an element of the user interface that indicates a rank of the query suggestion to the user. When the user holds or hovers over a particular element of the user interface, a pop-up window is displayed with the search results that are responsive to the query or query suggestion that is associated with the element, allowing the user to compare the query and the query suggestions. In addition, the user may rotate the elements associated with the query suggestions displayed around the element associated with the query in the user interface to indicate that they would like to receive additional or different query suggestions.

Abstract: The operation of an automatic service monitoring system (SMS) is directed by stored control information. Methods and mechanisms are provided to create portable control modules based on the control information. The portable modules may be transmitted or otherwise conveyed to a second SMS and imported there to establish the control information that directs and determines operational aspects of the second SMS.

Abstract: A method for an automated text-evaluation service, and more particularly a method and apparatus for automatically evaluating text and returning a score which represents a degree of inappropriate language. The method is implemented in a computer infrastructure having computer executable code tangibly embodied in a computer readable storage medium having programming instructions. The programming instructions are configured to: receive an input text which comprises an unstructured message at a first computing device; process the input text according to a string-structure similarity measure which compares each word of the input text to a predefined dictionary to indicate whether there is similarity in meaning, and generate an evaluation score for each word of the input text and send the evaluation score to another computing device. The evaluation score for each input message is based on the string-structure similarity measure between each word of the input text and the predefined dictionary.

Abstract: An information retrieval system uses phrases to index, retrieve, organize and describe documents. Phrases are identified that predict the presence of other phrases in documents. Documents are the indexed according to their included phrases. Related phrases and phrase extensions are also identified. Phrases in a query are identified and used to retrieve and rank documents. Phrases are also used to cluster documents in the search results, create document descriptions, and eliminate duplicate documents from the search results, and from the index.

Abstract: A system and method for forming a search query. Key-word search terms that include a homonym are received. One icon is selected to represent an intended meaning of the homonym. A first row of unique icons pertaining to an entity associated with a search query is displayed. Notification is received that a single unique object represented by a single icon of the unique icons in the first row is modified by a specific attribute and in response, a second row of the single icon modified by the specific attribute is displayed. Acceptance of the displayed single icon modified by the specific attribute is received for inclusion in the search query. The one icon and the single icon are displayed. in response to a user indicating that the displayed icons correctly represent a key-word search as intended by the user, the search based on meanings of the displayed icons is initiated.

Abstract: A method and system for forming a search query. Key-word search terms that include a homonym are received. One icon is selected to represent an intended meaning of the homonym. A first row of unique icons pertaining to an entity associated with a search query is displayed. Notification is received that a single unique object represented by a single icon of the unique icons in the first row is modified by a specific attribute and in response, a second row of the single icon modified by the specific attribute is displayed. Acceptance of the displayed single icon modified by the specific attribute is received for inclusion in the search query. The one icon and the single icon are displayed. In response to a user indicating that the displayed icons correctly represent a key-word search as intended by the user, the search based on meanings of the displayed icons is initiated.

Abstract: A first query is detected. The first query is for a storage device, and pulls a result set from the storage device using a set of predicates. The first query satisfies a size criterion. A new set of predicates of the result set is identified. The new set of predicates does not include any predicates of the original set of predicates. A second query which is the same as the first query is detected. The new set of predicates is used to determine the result set.

Abstract: A method for dynamically linking information in a network using natural language processing on a computer system, the information being contained in a message of a user in the network, where a user interface of a user is provided being adapted for receiving and playing natural language input. The method including: (i) recording information from a first user in the network in natural language; (ii) translating the recorded information in natural language to a text information; (iii) identifying topics in the text information based on topics stored in a predefined database; (iv) combining the identified topics in the message with the set of weighted topics in the user profile of the first user; (v) updating a weight of each of the identified topics in the user profile of the first user; and (vi) publishing the text information.

Abstract: Computer program products and systems are provided for mining for sub-patterns within a text data set. The embodiments facilitate finding a set of N frequently occurring sub-patterns within the data set, extracting the N sub-patterns from the data set, and clustering the extracted sub-patterns into K groups, where each extracted sub-pattern is placed within the same group with other extracted sub-patterns based upon a distance value D that determines a degree of similarity between the sub-pattern and every other sub-pattern within the same group.

Abstract: Associating a state machine with an asset for impact analysis by creating an asset-and-event topic map meta-model that identifies assets and events in a topic map based index with instance ontology based on a topic map meta model that identifies assets and a topic map meta-model that identifies events; creating a state topic map meta-model representing operating states of at least one asset; and associating an asset of the asset-and-event topic map meta-model with operating states of the asset in the state topic map meta-model.