Abstract: Crawling computer-based documents by performing static analysis on a computer-based document to identify within the computer-based document one or more execution vectors, where each execution vector includes a computer program segment including a call to an entity that is external to the computer-based document, and one or more additional computer program segments whose execution precedes and leads ultimately to execution of the computer program segment that includes the call to the entity, and causing any of the computer program segments in any of the execution vectors to be executed during a crawling of the computer-based document, and any computer program segment within the computer-based document that is excluded from the execution vectors to be excluded from execution during the crawling of the computer-based document.

Abstract: Techniques include receiving a search query; determining a topic related to the search query; identifying, within a specific time following receipt of the search query, one or more members of a social network who are available to interact and who are members of a group relating to the topic; and outputting, for use in augmenting a graphical user interface, data corresponding to information about the one or more members. The data can include data for a link to the group on the social network.

Abstract: Techniques for mastering resources in a cluster of nodes are provided. A global backup lock manager (GBLM) is maintained for a cluster of nodes that implement distributed lock management. Before a server instance is taken down, for example, for maintenance purposes, such as installing a new version of the server instance code, the mastership information that the server instance stores is reflected in the mastership information maintained by the GBLM. Thus, shutting down the server instance does not involve remastering the resources mastered by the server instance. As a result, shutting down the server instance may take minimal time.

Abstract: Systems and methods to create a merged lexeme set from a first lexeme set and a second lexeme set such that an existential lexeme search may be performed on both data originally from the first lexeme set and data originally from the second lexeme set via the merged lexeme set, and wherein information in the merged lexeme set includes information as to which lexeme set a lexeme originated. Specifically Prefix Burrows-Wheeler Transform (“PBWT”) systems and techniques are applied to the scenario where a plurality lexeme sets are merged to a single merged lexeme set. Additionally, applications of PBWT systems and techniques as applied to genome sequence data and k-Mer searches are disclosed.

Abstract: A distributed feature collection and correlation engine is provided, Feature extraction comprises obtaining one or more data records; extracting information from the one or more data records based on domain knowledge; transforming the extracted information into a key/value pair comprised of a key K and a value V, wherein the key comprises a feature identifier; and storing the key/value pair in a feature store database if the key/value pair does not already exist in the feature store database using a de-duplication mechanism. Features extracted from data records can be queried by obtaining a feature store database comprised of the extracted features stored as a key/value pair comprised of a key K and a value V, wherein the key comprises a feature identifier; receiving a query comprised of at least one query key; retrieving values from the feature store database that match the query key; and returning one or more retrieved key/value pairs.

Abstract: A computer-implemented method for expanding search results may include (1) determining that a user is attempting to perform a search, (2) presenting an option to the user to include, within results of the search, a document family associated with a found document, (3) determining that the user has selected to include the document family associated with the document, and (4) including the document family in the search results in response to determining that the user has selected to include the document family associated with the document. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for evaluating substitute terms. One of the methods includes receiving a query having an original term and determining one or more substitution contexts for the original term, wherein a substitution context includes one or more context terms and an indication of a position in the query of the original term and the one or more context terms. The substitution contexts are classified into a first category or a second category based on a respective score of each substitution context. The original term is associated with one or more substitution contexts in the first category.

Abstract: Target tree generation can include constructing a mapping file comprising a definition of a target tree and generating the target tree using source data and the mapping file.

Abstract: Generally described are systems and methods for conducting content differential analysis on multiple versions of an item, such as a book published with multiple editions or an item released with multiple versions. A version similarity scoring system may be configured to perform such content differential analysis on item content between two or more versions, and generate one or more similarity scores or assessments between versions. Similarity scores may be generated for the item as a whole as well as for some or all particular content portions or features of the item. The similarity scores for various versions may be provided to consumers viewing item detail pages for a multi-version item, as well as to vendors as part of purchase planning and market price setting decision processes.

Abstract: System and method for automatically recognizing media contents comprise steps of capturing media content from the Internet and/or devices, extracting fingerprints from captured contents and transferring to the backend servers for identification, and backend servers processing the fingerprints and replying with identified result.

Abstract: A method of querying a social network associated with a user may include receiving, by a computing device, a query that includes an indication of a product, and an identifier associated with the user. The method may include executing, by the computing device, the query across the social network by sending the query to one or more agent applications associated with one or more members of the social network, and receiving a notification from one or more of the agent applications if a profile for a member of the social network indicates that the member is associated with the product, and a privacy policy associated with the member permits the agent to send the notification.

Abstract: A method for providing content relevant images for an input question to a deep question answering system is disclosed. The method can include formulating, in response to receiving the input question, an answer to the input question. The method can also include identifying, based on the answer to the input question, a set of candidate images from a corpus of information. The set of candidate images may relate to the answer. The method can also include determining, based on a confidence value of the set of candidate images and a designated display specification, a first subset of the set of candidate images to provide in a display area. The method can also include selecting the first subset to be provided in the display area.

Abstract: Methods, techniques, and systems for using natural language processing to recommend related content to an associated text segment or document. Example embodiments provide a NLP-based content recommender (“NCR”) which uses NLP-based search techniques, potentially in conjunction with context or other related information, to locate and provide content related to entities that are recognized in the associated material. NCRs may be embedded as widgets, for example on Web pages to assist users in their perusal and search for information, provided by means of browser plug-ins or other application plug-ins, provided in libraries or in standalone environments, or otherwise integrated into other code, programs, or devices. This abstract is provided to comply with rules requiring an abstract, and it is submitted with the intention that it will not be used to interpret or limit the scope or meaning of the claims.

Abstract: A processor determines a predicted quantity of updates to be made to a set of data using a history of updates. The set of data is associated with a category of replication that indicates a first frequency of data replication to be applied to the set of data. The processor determines whether the first predicted quantity of updates meets a first threshold for a frequency of replication of the set of data. The first threshold indicates an allowed number of updates and meeting the first threshold indicates that an adjustment to the frequency of replication of the set of data is to be initiated. The processor responds to a determination that the first threshold has been met by associating the set of data with a category of replication that has a second frequency of data replication to be applied to the set of data.

Abstract: Computerized systems and methods are provided for generating results of a search query. In accordance with some implementations, data is received that is indicative of a character string related to a location and provided as input by a user. One or more hierarchically organized data trees are retrieved, from a storage device, for administrative areas related to the input character. Thereafter, probable target addresses are determined for the location utilizing the hierarchically organized data trees for each of the administrative areas, and a list of probable target addresses is provided for display to the user based on the hierarchy of the administrative areas.

Abstract: A system and method for externally verifying content popularity served via a content sharing service, including an access analyzer to create a list based on a number of accesses associated with content items served via the content sharing service, an external source interface module to monitor external sources for content items being served via the external sources, a list verifier to determine if the content items from the list match any of the content items from the external sources, and a list generator to create an externally verified list based on the determination from the list verifier.

Abstract: Embodiments of the present disclosure are directed to, among other things, validating the integrity of received and/or stored data payloads. In some examples, a storage service may perform a first partitioning of a data object into first partitions based at least in part on a first operation. The storage service may also verify the data object, by utilizing a verification algorithm, to generate a first verification value. In some cases, the storage service may additionally perform a second partitioning of the data object into second partitions based at least in part on a second operation. The second partitions may be different from the first partitions. Additionally, the archival data storage service may verify the data object using the verification algorithm to generate a second verification value. Further, the storage service may determine whether the second verification value equals the first verification value.

Abstract: Technologies are disclosed for generating query execution plans optimized for parallel execution for programs having both core database relational functions and user-defined functions. A variety of optimization strategies can be employed to improve performance in a parallel execution scenarios. A flexible range of permitted partition arrangements can be specified as acceptable to parallelized instances of the user-defined function. The optimizer can leverage such information when constructing an optimized query execution plan. Partitioning arrangements or other properties can be leveraged to avoid additional or unnecessary processing.

Abstract: Data storage operations, including content-indexing, containerized deduplication, and policy-driven storage, are performed within a cloud environment. The systems support a variety of clients and cloud storage sites that may connect to the system in a cloud environment that requires data transfer over wide area networks, such as the Internet, which may have appreciable latency and/or packet loss, using various network protocols, including HTTP and FTP. Methods are disclosed for content indexing data stored within a cloud environment to facilitate later searching, including collaborative searching. Methods are also disclosed for performing containerized deduplication to reduce the strain on a system namespace, effectuate cost savings, etc. Methods are disclosed for identifying suitable storage locations, including suitable cloud storage sites, for data files subject to a storage policy.

Abstract: Dynamic sourcing, in which a data request that is associated with a query is received and a parameter of data needed for satisfaction of the query is identified. Parameter information defining data available in at least one cube stored in a cache is accessed and the parameter is compared with the parameter information. Based on comparison results, it is determined whether one or more cubes in the cache include sufficient data to satisfy the query. In response to a determination that one or more cubes include sufficient data to satisfy the query, a response to the data request is generated by executing the query against the one or more cubes. In response to a determination that the cubes do not include sufficient data to satisfy the query, a response to the data request is generated by executing at least a portion of the query against a database system.