Abstract: A technique includes obtaining a plurality of n-grams from a plurality of messages, determining a temporal histogram for each n-gram, and determining synonyms among the n-grams based on a combination of a correlation of the histograms and a distance measure between n-grams.

Abstract: Processing batch database workload while avoiding overload. A method for efficiently processing a database workload in a computer system comprises receiving the workload, which comprises a batch of queries directed toward the database. Each query within the batch of queries is assigned a priority. Resources of the computer system are assigned in accordance with the priority. The batch of queries is executed in unison within the computer system in accordance with the priority of each query thereby resolving a conflict within the batch of queries for the resources of the computer system, hence efficiently processing the database workload and avoiding overload of the computer system.

Abstract: A system is disclosed comprising a non-transitory, computer-readable storage device storing software. The software, when executed by a processor, causes the processor to perform the following operations for each of a plurality of non-functional electronic devices: count a number of other non-functional electronic devices within a defined distance from the non-functional electronic device; and define the non-functional electronic device to be a core electronic device if the counted number is at least a threshold value, wherein threshold value is based on a total number of electronic devices within the defined distance around the non-functional electronic device. For each core electronic device, the software, when executed by a processor, further causes the processor to form a neighborhood group comprising the core electronic device and other non-functional electronic devices within the defined distance around the core electronic device.

Abstract: A system may include an analysis engine to generate a set of candidate phrases from a content stream based on the temporal resolution, the interestingness, and/or the correlation of the candidate phrases.

Abstract: A lowest common ancestor of a first data sequence and a second data sequence is determined. Based on the lowest common ancestor, symbols that differ between the first data sequence and the second data sequence are identified. A distance between the first data sequence and the second data sequence is determined based on the symbols.

Abstract: In a method for estimating a loaded execution runtime of database query, a database query for a database is received for a loaded database. Load information for the database is received. A prediction of query runtime tree is accessed. The prediction of query runtime tree is built from historical query information regarding historical database queries previously executed on the database. The prediction of query runtime tree includes a classifier function adjusted for an historical impact of loading of the database. The database query is processed through the prediction of query runtime tree, such that a loaded execution runtime of the database query is estimated based upon information pertaining to historical database queries similar to the database query.

Abstract: Processing batch database workload while avoiding overload. A method for efficiently processing a database workload in a computer system comprises receiving the workload, which comprises a batch of queries directed toward the database. Each query within the batch of queries is assigned a priority. Resources of the computer system are assigned in accordance with the priority. The batch of queries is executed in unison within the computer system in accordance with the priority of each query thereby resolving a conflict within the batch of queries for the resources of the computer system, hence efficiently processing the database workload and avoiding overload of the computer system.

Abstract: In a method for estimating a loaded execution runtime of database query, a database query for a database is received for a loaded database. Load information for the database is received. A prediction of query runtime tree is accessed. The prediction of query runtime tree is built from historical query information regarding historical database queries previously executed on the database. The prediction of query runtime tree includes a classifier function adjusted for an historical impact of loading of the database. The database query is processed through the prediction of query runtime tree, such that a loaded execution runtime of the database query is estimated based upon information pertaining to historical database queries similar to the database query.