Abstract: Methods and apparatus are provided in which applications that run on different devices can be upgraded with migration of data to a new database format. A method of upgrading a first version of an application installed on a first device to a second version is provided, where first and second transaction logs for respective first and second schema versions are stored in respective first and second log containers on a server computer, and the first version of the application stores data in accordance with a first schema version, and further stores a cache of at least a portion of the first transaction log in a log database on the first device, migrating the log database to the second schema version, storing a duplicate copy of the first transaction log in the second log container, and rewriting the duplicate copy of the first transaction logs using the second schema.

Abstract: In a method for a direct answer for search, a search query is received over a network, one or more answer candidate snippets for the search query are received, with an answer candidate snippet having at least a portion of content available over the network for an answer candidate, one or more answer entities are determined within a selected answer candidate snippet, a frequency of the one or more answer entities found within the one or more answer candidate snippets for the search query is determined, a confidence score is adjusted for the selected answer candidate in accordance with the frequency of the one or more answer entities found within the one or more answer candidate snippets, and at least one answer candidate snippet is sent for a response to the search query.

Abstract: Policy-based storage and retrieval combined with a distribution algorithm results in automatic and even distribution of policy-based storage structures across a set of nodes and dynamic, automated homing or ownership of policy-based storage structures. Large numbers of policy-based storage structures may be distributed without manual administration, allowing for rapid creation and destruction of storage structures. The overall load may be distributed and balanced across the server pool. Multiple entries having the same key value in a database- or table-like structure allow for distribution of policy-based storage and retrieval by key value and for queue semantics to be utilized for microqueues in the large database- or table-like structure.

Abstract: In one embodiment, a method includes generating, by a computer system, a search-engine query from stored identity-theft nomenclature. The method also includes querying, by the computer system, at least one search engine via the search-engine query. Further, the method includes crawling, by the computer system, at least one computer-network resource identified via the querying. In addition, the method includes collecting, by the computer system, identity-theft information from the at least one computer-network resource. Additionally, the method includes processing, by the computer system, the identity-theft information for compromised personally-identifying information (PII).

Abstract: Embodiments of the invention relate to systems and methods for cloning a production database for quality assurance (QA) by the merchant users. A QA user may request tokens, card types and other data associated with a payment device for quality assurance purposes. The payment network redirects the QA request to a go-between database that is present between the QA user and the production environment of the payment network rather than pull the information directly from the production environment. As a result, the merchant is able to use tokens for testing, without violating consumer privacy and security rules and regulations (e.g., PCI rules). The QA user does not have to create a customized testing solution.

Abstract: In a method for sharing computer-generated search results, in an integrated development environment (IDE), a first computer inserts, into a message, a portion of search results of a search of one or more files accessible via the IDE. The portion of the search results includes a user-selectable file name. The first computer inserts metadata into the message. The metadata includes an identifier of a version of the file. The first computer displays the message in a graphical window such that the search results are visible in the graphical window and the metadata is invisible in the graphical window. The first computer sends the message to a second computer.

Abstract: In one embodiment, a method includes maintaining access to information comprising nodes and edges; receiving a request from a first user corresponding to a first user node for a structured document corresponding to a first concept node; determining a first data set that identifies concept nodes connected by edges with user nodes that are each connected by edges with both the first user node and the first concept node; determining a second data set that identifies concept nodes connected by edges with the first concept node and user nodes that are each connected to the first user node; generating a score for each concept node in the data sets; selecting one or more concept nodes based on their scores as recommended nodes; and transmitting to the client device the structured document and code executable by a client application to render node names or identifiers of the recommended nodes for display.

Abstract: Many computing scenarios involve an item cache or index, comprising items corresponding to source items that may change without notice, rendering the item in the item cache or index stale. It may not be possible to guarantee the freshness of the items, but it may be desirable to reduce staleness in an efficient manner. Therefore, the refreshing of items may be prioritized by first predicting the query frequency of respective item representing the rate at which an item is retrieved from the item cache (e.g., by monitoring queries for the item), predicting an update frequency representing the rate at which the source item is updated by the source item host (e.g., by classifying the source item type), and computing a refresh utility representing the improvement in cache freshness achieved by refreshing the item. Respective items may then be prioritized for refreshing according to the computed refresh utilities.

Abstract: A computer implemented method for data archiving and dearchiving in a business environment is described herein. According to an implementation, the method includes obtaining metadata configuration associated with a source database storing transaction information, the transaction information being related to a business transaction. Based on the metadata configuration an archive specification is generated. Further, based on the archive specification and the metadata configuration, an archive mapping is configured. According to an aspect, the archive mapping is synchronized with an update in one of the metadata configuration. The archive mapping can be implemented for archiving the transaction information. Additionally, the archived transaction information can be de-archived, or can be purged onto a back-up repository.

Abstract: An integrity record is appended to data slices prior to being sent to multiple slice storage units. Each of the data slices includes a different encoded version of the same data segment. An integrity indicator of each data slice is computed, and the integrity record is generated based on each of the individual integrity indicators, and may be, for example, list or a hash of the combined integrity indicators. When retrieving data slices from storage, the integrity record can be stripped off, a new integrity indicator of the data slice calculated, and a new integrity record created. The new integrity record can be compared to the original integrity record, and used to verify the integrity of the data slices.

Abstract: A method of managing data includes generating a model file containing descriptions of the data, wherein the descriptions of the data in the model file are formatted as a collection of dictionaries, wherein the descriptions of the data are divided into multiple groups that are associated with multiple hierarchical pages, and wherein the multiple groups associated with the multiple hierarchical pages are listed in the model file in a flat structure, and generating a controller file that, when executed by a processor, causes the processor to interpret the model file and present the data in the multiple hierarchical pages to a user, wherein the controller file refers to one of the multiple groups in the model file, wherein the controller file is re-used to interpret the multiple groups in the descriptions of the data and present the data in the multiple hierarchical pages.

Abstract: Functionality is described for identifying a discussion topic based on user interest information. The user interest information may originate from one or more sources, such as the user's search-related behavior. The functionality then provides an opportunity for the user to engage in a communication exchange associated with the identified discussion topic.

Abstract: Methods, systems, and apparatus, including computer program products, for suggesting alternative query phrases based on query search results. In one aspect, a method includes receiving a search result for a query, the search result comprising a link to a resource, the resource including text, analyzing the text of the resource to identify a suggested query phrase in the text of the resource using a computed similarity measure, the similarity measure being a measure of similarity between the query and the suggested query phrase, the suggested query phrase being a phrase in the resource determined to be similar to the query and not identical to the query, and providing the search result, the suggested query phrase, and a user interface object for presentation to a user, the suggested query phrase and the user interface object provided in context in a section of contiguous text from the resource.

Abstract: Techniques, systems, and articles of manufacture for identifying event-specific social discussion threads. A method includes identifying a spatial relationship and one or more additional relationships across two or more topical clusters derived from a text source, extracting one or more temporally evolving discussion sequences across the two or more topical clusters, identifying at least one social discussion thread across the two or more topical clusters by identifying a correlation between the one or more additional relationships and the one or more temporally evolving discussion sequences, and to identifying a geographically-constrained social discussion thread among the at least one identified social discussion thread by identifying a correlation between the spatial relationship across the two or more topical clusters and the at least one identified social discussion thread.

Abstract: System and method for conducting a forensic analysis of electronic data having files and information indicative of a location of each of the files. The system has processors and a controller. The controller is configured to characterize the electronic data based, at least in part, on the files and the information indicative of the location of each of the files to obtain a characterization and distribute segments of the electronic data to the processors based, at least in part, on the characterization, each of the processors corresponding to at least one of the segments and each of the segments corresponding to at least one of the processors. Each one of the processors is configured to process each corresponding one of the segments to identify at least one characteristic of each corresponding one of the segments.

Abstract: Embodiments of the invention include a computer-implemented process for identifying implicit services links, using service usage information, in service registries and repositories. Service registry and repository receives service access information for a service to form received information, creates a services access context object in real time from all received information or a selected subset of received information to form a created services access context object, and stores the created services access context object in a data structure to form a stored services access context object. The computer-implemented process further analyzes a set of stored services access context objects in real time to form a set of results, wherein the results are within a predefined certainty and sends the result to a requester. The set of results comprises a set of implicit soft links determined by usage information in the services access context objects, wherein the implicit soft links are implicit services links.

Abstract: Highly relevant search results for unstructured queries are efficiently identified from normalized data. A server graphs relationships between each of the data objects. For each search term, the server identifies a candidate set of data objects mapped to the term. The server calculates priority scores for the candidate data objects based at least in part on one or more of: a link analysis of the graph; or an analysis of metadata describing structural constraints upon the candidate data objects. Based on the graph, the server identifies one or more search result subgraphs, each comprising at least one data object from each of the candidate sets. The server looks for subgraphs in an order that is based on the priority scores for the candidate data objects. The server may terminate its search early, in part because prioritizing the candidate data objects increases the likelihood of receiving relevant search results first.

Abstract: Managing different versions of a data record is provided. A mapping is maintained between a version-independent logical record identifier and a version-dependent physical record row identifier that correspond to each data record within a plurality of data records of a data table using a logical record identifier to physical record row identifier indirection mapping table. Entries within leaf pages of an index associated with the data table are updated to point to the version-independent logical record identifier corresponding to a data record instead of pointing to the version-dependent physical record row identifier corresponding to the data record. The logical record identifier to physical record row identifier indirection mapping table is updated in response to performing an operation on the data record instead of updating the entries within the leaf pages of the index associated with the data table.

Abstract: Management of heterogeneous data sources is described. In accordance with an embodiment method, a plurality of heterogeneous data sources is identified (410). The plurality of heterogeneous data sources can represent static data sources and management data streams received from servers for network management. The data sources can be encapsulated into data source containers (420). Each data source container can encapsulate a separate data source and can be mapped into an interdependent source graph (430). The interdependent source graph can include object links between the data source containers, the object links representing relationships existing between the data source containers. The interdependent source graph can be queried by traversing the interdependent source graph using data source container relationships to obtain management information about at least one of the data sources (440).

Abstract: A system and method are provided for publishing aggregated content. A syndication server is connected and in communication with one or more online information sources through a network. The syndication server extracts the aggregated content from the online information sources. The syndication server then re-structures the content, followed by enriching the semantics of the content. The modified content is then republished and made available on structured folders. A transfer protocol transfers the modified content to one or more mobile devices in communication with the syndication server.