Abstract: A mechanism is provided in a data processing system for matching data to a dynamic set of signatures. The mechanism creates a state transition, result, and mask (STR&M) table based on a set of signatures. The mechanism executes scanner code in each of a plurality of hardware devices in parallel to form a plurality of matching engines. The mechanism loads the STR&M table into each of the plurality of matching engines. Responsive to receiving a plurality of input records, the mechanism distributes input strings from the plurality of input records among the plurality of matching engines and receiving signature set match results from the plurality of matching engines.

Abstract: A mechanism is provided in a data processing system for matching data to a dynamic set of signatures. The mechanism creates a state transition, result, and mask (STR&M) table based on a set of signatures. The mechanism executes scanner code in each of a plurality of hardware devices in parallel to form a plurality of matching engines. The mechanism loads the STR&M table into each of the plurality of matching engines. Responsive to receiving a plurality of input records, the mechanism distributes input strings from the plurality of input records among the plurality of matching engines and receiving signature set match results from the plurality of matching engines.

Abstract: A method, computer program product, and computer system for receiving, by a computing device, a selection of a set of records to edit in a multi-record update operation. A selection is received of at least one record of the set of records on which to capture one or more changes. At least one aspect of the at least one record of the set of records is captured. The at least one aspect is played back on one or more remaining records of the set of records.

Abstract: A computer-implemented method is disclosed which detects a change in a set of data sources of a DSS, such as addition of a new data source, removal of an existing data source, or a schema change of an existing data source in the set. A first set of DSS updates for pending ETL jobs of an ETL engine of the DSS are automatically determined based on the change in the set of data sources. The method automatically updates, without canceling, the pending ETL jobs of the ETL engine based on the first set of DSS updates. A second set of DSS updates for a semantic layer of a BI engine of the DSS are automatically determined based on the change in the set of data sources and based on the first set of DSS updates. The semantic layer is automatically updated based on the second set of DSS updates.

Abstract: The technology disclosed relates to incorporating social data in CRM systems by a single social syn action. In particular, it relates to appending social data to prospect or contact objects of CRM systems by finding multiple social handles for the prospect or contact objects. The multiple social handles identify social profiles of the corresponding prospects or contacts on various social network platforms. The technology disclosed also relates to personalizing customer service experience of customers. In particular, it relates to identifying conversation preferences and interests of the customers based on information specified in their social profiles on different social network platforms. The conversation preferences and interests are used to customize interactions with the customer during the course of the customer service.

Abstract: A database is identified, wherein the database has two or more tablespaces. A local partition and a global partition for each tablespace of the two or more tablespaces is created, wherein the created two or more global partitions are included in a global storage pool. A request to move an object to a first local partition of a first tablespace of the two or more tablespaces is received. That an amount of used space of the first local partition is above a first threshold is determined. Responsive to determining that the amount of used space of the first local partition is above the first threshold, at least a portion of the object is stored in the global storage pool.

Abstract: Exemplary systems and methods for server management are provided. An exemplary system comprises a plurality of servers, with each server having the ability to access a database or, in some embodiments, be configured to perform a calculation, computation or make a determination of a particular value, values or other information. A communications network delivers queries to each server whereby a look-up table directs query processing by the servers. Further embodiments of the system feature a program logic controller for rebalancing the workload of the network servers. Exemplary methods of processing queries on the system comprise submitting a query to the network, communicating the query to each server in the network and each server looking-up on a look-up table the processing responsibilities of the servers in the network. The query is processed by the server having primary responsibility for processing the query while other the servers monitor query processing.

Abstract: A report creating system includes a storage part storing machine type information correlating the machine type codes of apparatuses with corresponding types of the apparatuses, pattern information showing usage patterns based on the presence or absence of usage of the types of the apparatuses, and type information correlating the usage patterns with corresponding report types; an identification part obtaining the machine type code of one or more of the apparatuses remotely managed by a remote management system and identifying the type of the one or more of the apparatuses based on the machine type code and the machine type information; a first determination part determining the usage pattern based on the identified type and the pattern information; a second determination part determining the report type based on the determined usage pattern and the type information; and a creation part creating a report based on the determined report type.

Abstract: A method includes performing a first activity with content associated with a first content type selected from the group consisting of television programming, online content, on-device application, search queries, information views, and other content types described using a predefined format, wherein the predefined format includes an action specification and a content specification; logging the first activity in accordance with the predefined format; performing a second activity with content associated with a second content type selected from the group consisting of television programming, online content, on-device applications, search queries, information view's, and other content types described using the predefined format, the second content type being distinct from the first content type; and logging the second activity in accordance with the predefined format.

Abstract: The data storage system according to certain aspects can implement table level database restore. Table level database restore may refer to restoring a database table and its related data without restoring the entire database. The data storage system may use table metadata index to implement table level restore. A table metadata index may be created for each table, e.g., during a backup of the database. The table metadata index for a table can include any type of information for restoring the table and its related data. Some examples of the type of information included in the table metadata index include the following: container for the table, table backup location, system data, table index, table relationships, etc. Table metadata index can make the restoring of tables fast and efficient by packaging information that can be used to restore a table and its related data in an easily accessible manner.

Abstract: The present disclosure describes techniques and apparatuses for hardware-implemented AVL tree updates. In some aspects, records are accessed as part of a search performed to update an AVL tree. The update may involve inserting a new node into, or removing a node from, the AVL tree. The AVL tree is represented by records stored in memory, each of which represents a node of the AVL tree. During the search, each of the records accessed is read from memory. The records read from memory are then written to an AVL tree rebalancing component implemented in hardware. Once the records are written to the hardware-implemented AVL tree rebalancer, it can modify, without subsequently accessing the memory, those records corresponding to the nodes affected by the update. After those records are modified by the hardware-implemented AVL tree rebalancer, the modified records are written back to the memory effective to update the AVL tree.

Abstract: A system and method operable to identify and analyze persistent state information among a plurality of software-related events, and present persistent state information in a unified fashion.

Abstract: Controlling garbage collection operations. The method includes setting up garbage collection to collect objects that are no longer in use in a managed code environment. The method further includes receiving managed code input specifying a desired quantum within which it is desired that garbage collection not be performed. The method further includes performing a computing operation to determine the desired quantum can likely be met. The method further includes running memory operations within the quantum without running the initialized garbage collection.

Abstract: A search query is received from a first user through one or more input devices. A set of results is determined from content stored on a computer system based on the search query. The set of results includes a first subset of results not accessible to the first user due to access control. A list of results is provided to the first user. The list excludes the first subset of results. A target result is identified from the first subset of results. An owner is identified with control over access to the target result. The owner is notified that the target result is not accessible to at least one user.

Abstract: A computer-implemented process for identifying equivalent links on a page responsive to a determination that the crawler has not visited all required universal resource locators, locates a next URL to be crawled to form a current URL and processes the current URL to identify equivalent URLs. Responsive to a determination that the crawler has not visited the current URL, determine whether necessary to crawl all identified equivalent URLs and responsive to a determination that it is necessary to crawl all identified equivalent URLs, adding all equivalent URLs to a list of URLs to be crawled.

Abstract: The subject disclosure is directed towards a data deduplication technology in which a hash index service's index is partitioned into subspace indexes, with less than the entire hash index service's index cached to save memory. The subspace index is accessed to determine whether a data chunk already exists or needs to be indexed and stored. The index may be divided into subspaces based on criteria associated with the data to index, such as file type, data type, time of last usage, and so on. Also described is subspace reconciliation, in which duplicate entries in subspaces are detected so as to remove entries and chunks from the deduplication system. Subspace reconciliation may be performed at off-peak time, when more system resources are available, and may be interrupted if resources are needed. Subspaces to reconcile may be based on similarity, including via similarity of signatures that each compactly represents the subspace's hashes.

Abstract: A method of mapping a collection of images, or other higher dimensional items including text documents, and three-and-higher dimensional objects, onto a navigable grid for browsing via a user interface comprises obtaining for each of the images a list of nearest neighbor images and similarity scores for each nearest neighbor; placing a first image on a cell within a grid; from a respective list of nearest neighbors of said first image, finding images that maximize a compatibility score with images already placed on the grid and placing resulting images on neighboring cells; and continuing to place further images on the grid until all cells visible to a user are filled with images. As the user pans or zooms the grid, more cells move into the visible area of the screen and are filled with images in the same way.

Abstract: For a search query submitted by a user, a result set including a plurality of pages is obtained. A first and a second personality score of a first and a second page, respectively, is determined using a value of a personality trait of the user and a weight associated with the value, and at least one of (i) a personality score of a site from which a first page is obtained based on a personality analysis of another content on the site, and (ii) a personality score of an author of the first page based on a personality analysis of another content published by the author. The first page is ordered ahead of the second page when the first personality score exceeding the second personality score, even when the first page and the second page are equally relevant to the search query.

Abstract: In the metadata organization system a metadata classification module dynamically reads metadata organization information, such as, for example, metadata field information, metadata display set information, and metadata category grouping information, from the metadata organization database, reads metadata from a metadata database, and organizes the metadata for display to a user in a graphical user interface. In the graphical user interface, a user may add, delete, and/or modify the metadata in the display. As the user changes the metadata, the metadata database is updated and the user's changes are reflected in the graphical user interface.

Abstract: Technologies are generally described for methods and systems effective to store a source ontology that is effective to represent first explicit data and second explicit data. In an example, a processor may evaluate the source ontology to identify the first explicit data and the second explicit data. The processor may also identify a relationship between the first and second explicit data. The processor may also partition the source ontology into first decomposed data and second decomposed data based on the relationship between the first and second explicit data. The first decomposed data may include the first explicit data, and the second decomposed data may include the second explicit data. The processor may also store the first decomposed data in a first concealment module. The processor may also store the second decomposed data in a second concealment module that may be different from the first concealment module.