Abstract: A technique performs replication. The technique involves receiving, by processing circuitry, a virtual storage processor (VSP) replication command from a user. The VSP replication command specifies a source VSP and a destination VSP (e.g., configuration data which defines an operating environment). The technique further involves identifying, by the processing circuitry and in response to the VSP replication command, multiple source data objects which are configured to store data from the context of the source VSP. The technique further involves automatically creating, after the multiple source data objects are identified, multiple replication sessions to replicate the multiple source data objects as multiple destination data objects which are configured to store data from the context of the destination VSP. Once created, the entire lifecycle of the replication session occurs at the VSP level and replication of the internals of the VSP are entirely hidden from the end user.

Abstract: Methods and systems to obtain desired web content for a mobile device are disclosed. Users access web pages with mobile devices such as smart phones in addition to their non-mobile devices. In order to conveniently display information on mobile devices having smaller screens, mobile versions of web pages offering abridged content are available as well as non-mobile versions. When a web page is selected from search results provided from a query in a web search, the mobile or non-mobile versions of the web page may be delivered. By delivering a web page version to a mobile device based on relevance rankings determined for the non-mobile and mobile versions of the web page, desired content is more efficiently delivered. In this manner, a search experience may be improved by reducing deliveries of mobile versions of web pages to mobile devices where an alternative non-mobile version of the web page is preferred.

Abstract: Methods, systems, and apparatuses, including computer programs encoded on computer-readable media, for advertisement keyword scoring. A processing circuit receives a request for an advertisement to be provided to a user during a user session. The advertisement is to be provided alongside other content that is associated with a first plurality of keywords. A processing circuit identifies a plurality of advertisements based on the first plurality of keywords. Each of the plurality of advertisements are associated with a second plurality of keywords. The processing circuit calculates a keyword score for each of the second plurality of keywords for each of the plurality of advertisements. Based on the keyword score, one of the keywords for each of the plurality of the plurality of advertisements is selected. Based on a comparison of the selected keywords, the advertisement to be provided to the user is selected.

Abstract: For search token mnemonic replacement, code detects the search token mnemonic in a string. The search token mnemonic is associated to a search token that includes a search definition that specifies a search rule for one or more dissimilar search paths. The code searches the search paths using the search rule. In addition, the code replaces the search token mnemonic with the search result in the string.

Abstract: Embodiments of methods for record linkage and comparing attributes are presented herein. Broadly speaking, embodiments of the present invention associate data records using distance measures and weights. More particularly, embodiments of the present invention generate a weight-based comparison of attributes. More specifically, embodiments of the present invention involve deduplication of records in a single database and linkage of records in multiple databases. In some embodiments of the invention, records may be merged into a master database based on the linkage and comparison of attributes. In addition, embodiments of the present invention may calculate a quality measure to be used in comparing attributes and records.

Abstract: In one embodiment, a method includes accessing a data set comprising a list of objects matching a query, a pre-determined static-rank for each object calculated based on a static-scoring algorithm, and a final-rank for each object calculated based on a final-scoring algorithm, and revising the static-scoring algorithm based on a comparison of the static-ranks and the final-ranks of each object listed in the data set, where the static-scoring algorithm is revised in order to reduce a difference between the static-ranks and final-ranks of the objects listed in the data set.

Abstract: Methods for faceted searching within clustered in-memory databases are disclosed. Faceted searching may be used to generate search suggestions. The faceted search engine may be able to use non-literal key algorithms for a partial prefix fuzzy matching and may include a feature disambiguation module. The disclosed search engine may be capable of processing large amounts of unstructured data in real time to generate search suggestions.

Abstract: Technologies are described for performing replication within a database environment. For example, replication of database data can be performed using data manipulation language (DML) statements and logical logs. A database node can execute a DML statement, create a logical log comprising the DML statement, and insert the logical log into a logical log queue. The logical log can be sent to one or more other database nodes for execution of the DML statement stored within the logical log. Logical logs can be grouped for sending to other nodes. Logical logs can be executed on a first node and one or more other nodes within the same transaction boundary. Execution of DML statements can be decoupled from sending, receiving, grouping, and/or processing of logical logs.

Abstract: A method and an apparatus for creating and using recursive index in search engines. In particular, extracting text from an index of a search engine starting at an arbitrary position in the text, and analyzing texts for co-occurrence of words, and using said extraction and analysis for inferring implicit relationships among objects in sequences thereof. As such, utility of search engines to index and retrieve information represented by a sequence of objects different from text information objects are extended. A method and an apparatus extends the basic hit with at least two word identifications, one for the previous word and one for the next word.

Abstract: A first backup storage system within a receiving domain receives information from an originating domain distinct from the receiving domain. The first backup storage system includes at least one storage device and the information includes backup data and corresponding lifecycle policy information for the backup data. The first backup storage system automatically performs an operation relating to the backup data, where the operation is specified by the received lifecycle policy information. In some embodiments, the lifecycle policy information may be received by the receiving domain within a header located within the backup data.

Abstract: A computer-implemented method for data mirroring for network attached storage includes duplicating an identity mapping database on a second NAS server and creating a queue of updated data files containing updated elements since a prior synchronization. Data files containing the updated elements are transmitted from the first NAS server to the second NAS server. An updated copy of the identity mapping database from the first NAS server is stored at the second NAS server. The updated data files and metadata information from the first NAS server are written to the second NAS server. The permission entries of the transmitted data files from the first NAS server are translated using the identity mapping databases of the first and second NAS servers, such that the permission entries reflect the local ID mapping database on the second NAS server.

Abstract: Methods, systems, and computer-readable media for developing, storing, validating, tracking and transferring stored procedures are presented. The stored procedures may be stored in a central storage location. The storage location may receive a first version of a stored procedure and generate a change identifier for the first version. The system may evaluate the stored procedure to determine whether it complies with standards of the entity. In some examples, the first version may be checked-out and transferred to another environment for, for instance, modification to create a second version. The second version may then be transmitted to the central storage location for storage. A second change identifier may be generated and associate with the second version. The second version and the second change identifier may be stored. Similarly, an unlimited number of modifications to the stored procedure, each associated with a unique change identifier from the storage system, may be made.

Abstract: Embodiments of the invention are directed to systems, methods and computer program products for converting MLOAD and TPUMP operations. In some embodiments, a system is configured to: receive a first information, wherein the first information comprises at least one piece of data; count the number of pieces of data; compare the counted number of pieces of data to a predetermined threshold value; and identify a load utility based on the comparison between the counted number of pieces of data and the predetermined threshold value.

Abstract: An approach is provided for presenting a user interface and associating one or more commenting information with on one or more content items detected in one or more media items. Further, a user may associate one or more commenting information related to a point of interest/object wherein one or more content items associated with the point of interest/object may be retrieved and aggregated with the one or more commenting information.

Abstract: Embodiments of the invention are directed to systems, methods and computer program products for converting MLOAD and TPUMP operations. In some embodiments, a system is configured to: receive a first information, wherein the first information comprises at least one piece of data; count the number of pieces of data; compare the counted number of pieces of data to a predetermined threshold value; and identify a load utility based on the comparison between the counted number of pieces of data and the predetermined threshold value.

Abstract: Systems and methods for collecting, classifying and organizing user information into a dynamically-updated user profile are provided. Information pertaining to a user is obtained from one or more data sources, and the information is then classified into specific categories using field mapping and other techniques, after which it is organized into a user profile and securely stored in a database. The user profile is dynamically-updated by automatically detecting and storing updates to the information in the user profile based on user interactions, communications and other online or electronic activities. Information is instantaneously collected from user-completed electronic form input fields which is mapped back to the user profile. The user profile is a single, comprehensive source of user information that is securely stored and available to the user in any location and for any purpose, such as automatically and instantaneously populating fields of an electronic document, form or web-based application.

Abstract: A user interface is generated that displays a set of selectable terms from a glossary of business terms and is configured to generate a business metadata query that identifies a forum with member profiles. A data movement executable is generated that identifies the forum and an analytical processing environment. The data movement executable is deployed and data is moved from the forum into the analytical processing environment. Analytics are performed on the data from the forum. Metadata is identified from the analytics. The glossary of business terms is updated using the metadata from the analytics.

Abstract: Mechanisms are provided for retrieving and presenting related content using text stream data feeds. Text stream data feeds such as caption information associated with media content or conversations associated with social networking applications are aggregated and used to retrieve related media content, text documents, and advertisements. Text stream data feeds that a user is exposed to may indicate that the user is interested or at least primed for particular types of related content. In particular examples, an inverse vector space search engine is used to determine particular pieces of related content and categories of interest. Post filtering may also be applied to the results.

Abstract: An approach for synopsis guided scan processing of MIN/MAX data queries where a minimal or maximal data query operation and a synopsis store are received. The synopsis store includes at least one of tuple range identifiers, column minimal and maximal metadata values. The synopsis store is sorted, where the column minimal or maximal metadata values search order is created for the tuple range identifiers. Dataset data associated with the tuple range identifiers is searched in the search order for a minimal or maximal value result until the minimal value result is less than or equal to a next column minimal metadata values or the maximal value result is greater than or equal to a next column maximal metadata values respectively and the minimal or maximal value result associated with the respective minimal or maximal data query operation is output.

Abstract: A clustered source code management system is described. The system comprises a plurality of cluster nodes, a shared file server storing repository data, and a load balancer. Each of the plurality of cluster nodes is configured to receive an incoming request sent from a client computer, the incoming request being a source code management request to access repository data stored on the shared file server and process the incoming request to determine if a type of the incoming request is a cacheable request type. If the incoming request is of a cacheable request type, the cluster node is configured to determine if a valid cached response to the incoming request is available on storage media locally accessible to the cluster node; and, if so, respond to the incoming request by communicating the valid cached response to the client computer.