Abstract: A method and system for mining trends around trending terms. The method includes determining a plurality of articles, from one or more websites, in relation to a first entity for a time period. The first entity is a trending term. The method also includes generating comment clusters for the plurality of articles. Each comment cluster is generated for associated article and includes plurality of user comments. The method further includes extracting one or more entities from plurality of user comments for each of the comment clusters, the one or more entities related to the first entity. Further, the method includes enabling selection of a second entity, from the one or more entities, by the user. Moreover, the method includes rendering one or more user comments corresponding to the first entity and the second entity for the time period. The system includes an electronic device, communication interface, memory, and processor.

Abstract: In response to receiving a request for visiting a first web task associated with a website, a first task node is generated in a tree structure at a breadcrumb root node in the tree structure. In response to sequentially receiving requests for multiple subtasks of the first web task, multiple subtask nodes of the first task node are sequentially established in the tree structure. The subtask nodes of the multiple subtask nodes of the first task node are sequentially connected to the first task node according to a sequential order of the sequentially received requests for the multiple subtasks of the first web task. The multiple subtask nodes of the first task node are processed based a policy of the first web task.

Abstract: Data are received at a worker system in a distributed computing system that describe a graph representing relationships among a set of items. The graph models a condition having an associated problem. The graph has graph components having associated data fields. The received data are stored in a backup table, and the relationships are analyzed to identify a solution to the problem. As part of the analysis, a new value for the data field associated with a graph component is identified and compared with an existing value of the data field, and the data field is modified. The modified data field is stored in a delta table representing a change to the backup table.

Abstract: A zero downtime upgrade of a source system to a target system is initiated. The source system and the target system operate in a first database layer and a second database layer. Thereafter, differences in structure and/or database type are computed between a source table in the source system and a target table in the target system in each of the two different database layers. The data is then migrated, using the computing differences and in the second database layer, from the source table to the target table. The upgrade procedure is later terminated after completion of the migration of the data. Related apparatus, systems, techniques and articles are also described.

Abstract: Identifying preferred nodes for backing up availability groups is described. A system logs in to a structured query language instance on an active node. The system identifies a primary replica for an availability group identified for backup. The system identifies a backup preference for the availability group based on the primary replica. The system identifies the backup preference as a preferred node for backing up the availability group if the backup preference is on-line.

Abstract: A method for comparing DNA containing test results and stored results is provided, including a) a stored result selection and plurality of stored result database creation stage; b) a test result against stored result comparison stage, including: 1) A test result selection and plurality of test result database creation sub-stage; 2) A single test result database against single stored result database search sub-stage, performed for the various pairs of test result databases and stored result databases, to establish matches; 3) An established match review sub-stage, to filter out established matches which do not feature as matches across the other test result against stored result databases; 4) A process outcome sub-stage which provides details of the matches which extend across all the database pairs.

Abstract: The technique relates to a system and method for selecting process element variants in business processes. The technique involves receiving a process element execution request from at least one user. Then, determining a plurality of enterprise dimensions associated with the process element execution request. Thereafter, searching the process element variant corresponding to the plurality of enterprise dimensions in a declarative way based on a predefined dimensional hierarchy. Finally, selecting the process element variant for execution to accomplish the user request. This technique employs a declarative approach which eliminates the need define the variants for all possible combination of enterprise dimensions namely process, events, locations, organizations and data.

Abstract: In one embodiment, a system includes at least one processor and logic configured to receive a request to process data stored in one or more index records in a keyed index of a database, determine an active key range for the one or more index records, and group the one or more index records into a number of groups for parallel processing thereof. In another embodiment, a method for utilizing a keyed index includes receiving a request to process data stored in index records in a keyed index of a database, determining an active key range for the index records, wherein the active key range is determined based on any of: a type of the index records, a horizontal pointer to a next index record, and a low key value for each index record, and grouping the index records into a number of groups for parallel processing thereof.

Abstract: A computer implemented method, a computerized system and a computer program product for detecting scalable trends in a personalized search context. The computer implemented method comprising obtaining search results matching a search query, wherein the search query is a query defined by a user, wherein the search results comprise occurrences of events, wherein each occurrence is associated with a timestamp. The method further comprises calculating, by a processor, in response to obtaining the search results, trend scores for the events based on the occurrences comprised by the search results. The method further comprises providing an output to the user based on the trend scores.

Abstract: In general, a computer-implemented method is described for receiving one or more requests to generate a medical study, retrieving from one or more data repositories one or more medical study instruments, receiving a selection of a particular medical study instrument to use in the medical study, generating by one or more computers a list of one or more research collaborators invited to review the medical study, and generating by one or more computers a list of one of more participants invited to join the medical study. Additionally, the computer-implemented method generates by one or more computer systems a data filter to format medical data from a first data format to a second data format, wherein the second data format complies with a third data format associated with one or more medical study instruments.

Abstract: A computer system and associated method are provided for formulating a search inquiry. A user interface (UI) accepts commands for selecting a first data object, and a display presents the first data object with a top plane as located within a geometric boundary representation of a virtual object-bearing front surface. The UI then accepts commands for selecting a first feature associated with the first data object. The UI next accepts either a flip object command or a flip surface command. In response to the flip command, the display presents a first data object bottom plane, opposite of the first data object top plane. The UI is then able to accept commands for selecting a second feature associated with the first data object, and construct a search inquiry in response to the first data object, the first feature, and the second feature, which is sent to a search engine.

Abstract: Techniques are described for modeling data query execution time based on a cost of data queries, where the cost provides a measure of the processing resources used by the data query while executing. Using regression analysis or other statistical methods, a model may be generated that enables the prediction of the query execution time based on the query cost. In some cases, the model may be generated based on a linear regression analysis of previously measured execution times and previously determined data query costs. The model may be stored and employed prior to, or during, the subsequent execution of a data query, to predict the execution time of the data query. Data queries that execute substantially longer than the predicted execution time may be terminated.

Abstract: Embodiments relate to an eigenvalue-based data query. An aspect includes receiving a query request that includes a query statement. Another aspect includes calculating eigenvalues of key component elements in the query statement. Another aspect includes matching eigenvalues of nodes in an execution plan of a historical query statement to the eigenvalues of the key component elements. Yet another aspect includes based on determining success of matching the eigenvalues of the key component elements to the eigenvalues of the nodes in an execution plan of the historical query statement, generating an execution plan of the query statement.

Abstract: A method for joining records from database tables is proposed. Join attributes are ordered into a sequence S0, and a scope C is initialized to empty. Tables including a join attribute A that is first in S0 are identified. A new sequence S? omits A from S0. Iteration through each identified table proceeds in join attribute A order. The iteration utilizes a tree index structure for each identified table where the index key includes all join attributes in the identified table in S0 order. For each matched value v of the join attribute located during the iterating, a new scope Cv is created by appending “A=v” to the scope C. If S? is empty, a tuple corresponding to the scope Cv is output. Otherwise, S0 is set to S? and for each scope Cv, C is set to Cv and the steps beginning with the identifying step are recursively invoked.

Abstract: Disclosed is a method and system for navigating, by a browser executing on the computing device, to a web page; transmitting by a client-side module executing on the computing device to a server computer over a network a request to the server computer for topics associated with the web page; receiving, by the computing device, a set of (one or more) topics associated with the web page from the server computer; displaying by the browser in a first content area the web page; and displaying by the browser in a second content area the received set of topics associated with the web page.

Abstract: Systems and methods for processing a query are provided. A method for processing a query of a tree-based dataset, comprises receiving the query, and analyzing the query and the dataset to create an execution plan for the query, wherein creating the execution plan comprises partitioning traversals over the dataset into sequential and parallel components, and distributing the components across a plurality of processing threads that independently traverse their portion of the dataset and compute local results. The method further comprises merging the local results to compute a final result.

Abstract: Digital content, such as video, audio, multimedia, and similar files may be segmented at a determined frame resolution rate and analyzed to determine a fingerprint for each content segment. An identifier that uniquely identifies each content segment may be determined based on the fingerprint of the respective content segment. The identifier may be associated with data relating to the content segment and with one or more identifiers that uniquely identify other content segments of the content. The content segment identifiers may be used to construct a content segment sequencing representation that represents the playback of the content segments in playback order.

Abstract: A method of securely deleting data from a data storage device is described. The method includes the steps of receiving a secure delete command to securely delete a file. A data block of the file to securely delete is identified. A pointer to the data block is stored in a deletion buffer. It is then determined whether the secure delete command has a highest priority over other data storage device commands. In response to the secure delete command having the highest priority, the secure delete command to the data block is performed.

Abstract: The method for managing one or more standard configurations includes calculating a plurality of configuration fingerprints for a plurality of storage systems. The configuration fingerprint is a numerical value that represents information about a configuration for one or more components of a storage system. The method also includes building a result set that includes the plurality of configuration fingerprints for the plurality of storage systems. The method also includes identifying a plurality of standard configurations for the plurality of storage systems from the result set based on the plurality of configuration fingerprints. The method also includes determining that a first storage system from the plurality of storage systems meets a standard configuration from the plurality of standard configurations. The method also includes creating metadata within the first storage system that describes the standard configuration.

Abstract: A method for performing distributed data replication from a source cluster of nodes to a destination cluster of nodes includes electing a master file management instance and slave file management instances for the source cluster of nodes, identifying a set of files to be replicated, assigning the identified set of files to the master file management instance and the slave file management instances, processing the identified set of files by the master file management instance and the slave file management instances and performing replication on the processed set of files by file replication instances corresponding to the master and slave file management instances at the source cluster of nodes.