Abstract: Some embodiments provide a program that identifies an entity having an entity attribute. The program receives, from each method of several methods, a set of candidate identity attributes that are each for identifying a particular entity having the entity attribute specified in the document. Each method of the several methods generates the corresponding set of candidate identity attributes based on the entity attribute specified in a document. The program calculates a score for each candidate identity attribute in the sets of candidate identity attributes. The program identifies, based on the sets of scores, an identity attribute from the sets of candidate identity attributes that identifies the entity having the entity attribute specified in the document.

Abstract: A disclosure provides techniques for generating search results containing state links to applications. A method includes receiving a query containing one or more query parameters from a remote computing device and identifying a set of third party applications corresponding to the one or more query parameters. For each third party application, the method includes transmitting at least a subset of the one or more query parameters to a server associated with the third party application, receiving a response from the server associated with the third party application, and generating a state link to a native application version of the third party application based on the response. The method further includes providing the states links to the remote computing device.

Abstract: A method for map-reduce job virtualization is disclosed. The method includes receiving a map-reduce job written in a first map-reduce language. The map-reduce job is to be performed in parallel on a plurality of nodes of a plurality of clusters. The method also includes selecting one or more clusters to run the map-reduce job. The method further includes identifying a second map-reduce language associated with the selected clusters. The method also includes converting the first map-reduce language of the map-reduce job into the second map-reduce language. The method further causes the map-reduce job in the second map-reduce language to be run on the plurality of nodes of the selected clusters.

Abstract: Methods and apparatuses for organizations to monitor, analyze and respond to unstructured and structured data that is related to their Governance, Risk, and Compliance (GRC) programs. Embodiments of the invention generated mapped Risk Control Matrices (RCMs) and/or insights for improving the GRC process from unstructured and structured data. Natural language processing is employed to process the aggregated data from various data sources to create attributes and contributors. The attributes and weighted contributors are processed to form mapped RCMs and/or GRC-related insights.

Abstract: Systems and methods are disclosed for news events detection and visualization. In accordance with one implementation, a method is provided for news events detection and visualization. The method includes, for example, obtaining a document vector based from a document, obtaining one or more clusters of documents, each cluster associated with a plurality of documents, a cluster vector, and a cluster weight, determining a matching cluster from the one or more clusters based at least on the similarity between the document vector and the cluster vector of the matching cluster, and associating the document with the matching cluster.

Abstract: Systems and methods are disclosed for news events detection and visualization. In accordance with one implementation, a method is provided for news events detection and visualization. The method includes, for example, obtaining one or more documents, the one or more documents being grouped into one or more clusters having a score, and the one or more clusters being grouped into one or more megaclusters, presenting information associated with the one or more documents on one or more timelines, wherein the one or more documents are grouped into different megaclusters being presented in a visually distinct way, and filtering the presented information based on the scores associated with the one or more clusters.

Abstract: In one implementation, a query is received that is related to data stored in a database that is implemented in computer memory. Based on the received query, attributes of data stored in the database that are relevant to generating a response to the received query are identified. Information that is indicative of attributes for which values are recorded in different tables included in the database is accessed. Based on having accessed this information, tables included in the database that record values for the attributes identified as being relevant to generating a response to the received query are identified. These tables then are joined to create, within computer memory, a new table that reflects relationships between values of attributes identified as being relevant to generating a response to the received query.

Abstract: A computer system including a memory, at least one processor coupled to the memory, and a search component executable by the at least one processor is provided. The search component is configured to receive information descriptive of at least one search term; execute a first query against a plurality of documents that identifies at least one first document of the plurality of documents responsive to the at least one search term; identify one or more secondary terms associated with the at least one first document based on occurrence of the one or more secondary terms within the at least one first document; and provide a search result including at least one of the one or more secondary terms and one or more identifiers of one or more documents including the one or more secondary terms. The search result may also include one or more identifiers of bookmarked documents.

Abstract: Methods, systems and programming for providing query suggestions including entities. In one example, a prefix of a query is first received. A plurality of query suggestions are then identified based on the prefix of the query. The plurality of query suggestions include at least one entity. Scores of each of the plurality of query suggestions are computed using a first model. The first model includes an adjustable parameter used for computing the score of the at least one entity. The plurality of question suggestions are ranked based, at least in part, on the scores.

Abstract: Transparent file processing is supported in Unix-like operating systems by emulating the desired file processing through a number of recipes that accommodate different contexts. Recipes are provided, for example, for local folders in user space, for whole devices (e.g., flash drives or network drives), and for folders synchronized to cloud data. By detecting the path type for a file operation and selecting and applying the appropriate recipe, file processing can be performed in a manner transparent to the user.

Abstract: Some aspects of this disclosure involve computation of a preference score for a certain type of food. In some embodiments described herein, measurements of affective response of at least ten users are collected. The measurements may include various values indicative of physiological signals and/or behavioral cues of the at least ten users. Each measurement of a user is taken with a sensor coupled to the user up to four hours after the user consumed the certain type of food. A preference score is computed based on the measurements. The preference score is indicative of how much the at least ten users enjoyed consuming the certain type of food and/or how well they felt after consuming the certain type of food.

Abstract: A computing device supporting ordered mode journaling. The computing device includes a memory that stores a program for operating a file system supporting ordered mode journaling; and a processor that operates the program stored in the memory. Wherein during execution of the program, when ordered mode journaling for a transaction including one or more files is implemented, the processor stores the transaction in a data area of the memory, and implements the journaling by storing a common journal including metadata of the transaction in a journal area of the memory.

Abstract: A method and apparatus for a data analysis system for analyzing data object collections is provided. The data analysis system includes one or more graphical user interfaces comprising various interface elements that enable users to create visual queries. A visual query is constructed as a graph representing a pattern of interest in a collection of data objects. A visual query may include one or more graph elements and property information associated with the specified graph elements. After a user has constructed a visual query, the system may transform the visual query into a query template. A query engine may then execute the query template to search a data object collection for data object results corresponding to the specified pattern. The search for instances of a specified pattern in a collection of data objects is referred herein to as a “search around.

Abstract: A graph data search method and apparatus, where the method includes obtaining a query request including a query condition that carries a start graph node, the query request queries a first to-be-queried graph node matching the query condition from a graph data set, and the graph data set includes the start graph node, a plurality of to-be-queried graph nodes, an association relationship between the start graph node and the plurality of graph nodes, and an association relationship between each to-be-queried graph node and another graph node, filtering out, according to the query condition and a preset available resource condition, a second to-be-queried graph node that does not meet the query condition and an association relationship in the graph data set that includes the second to-be-queried graph node, and performing a query in the reduction subgraph using the query condition.

Abstract: A query is executed in a massively parallel processing data storage system comprising a master node communicating with a cluster of multiple segments that access data in distributed storage by producing a self-described query plan at the master node that incorporates changeable metadata and information needed to execute the self-described query plan on the segments, and that incorporates references to obtain static metadata and information for functions and operators of the query plan from metadata stores on the segments. The distributed storage may be the Hadoop distributed file system, and the query plan may be a full function SQL query plan.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for generating real-time search results. In one aspect, a method includes receiving a search query from a client; determining that real time search results should be included in a user interface document responsive to the search query; generating the user interface document, including client software to cause the client to present real time search results for the query; and sending the user interface document to the client.

Abstract: Software running on servers at a website hosting a news service generates a first profile for a user of the news service. The first profile is based at least in part on implicit relevance feedback from the user on content presented by the news service. The software obtains a second profile for the user from a web-searching service. The software creates a score for a candidate item of content. The score is based on similarity of the candidate item to the first profile and similarity of the candidate item to the second profile. Similarity to the second profile measures at least similarity to a plurality of web-search queries and similarity to any titles of any search results resulting from each of the queries. The software then presents the item of content to the user in a content stream served by the news service, based on the score.

Abstract: Query generation for searchable content is provided. In some embodiments, query generation for searchable content includes receiving searchable content (e.g., the searchable content can include a unique identifier for the searchable content, such as a Uniform Resource Locator (URL) for a web site, and the web site can include one or more web pages); and generating a set of queries, the set of queries including one or more queries (e.g., the set of queries can include ranked queries) that are relevant to the searchable content.

Abstract: A method for providing information representing physical features of a portion of a three-dimensional surface, the information including data files at different resolution levels. The data files are stored in a hierarchical file system. A hash value is computed from a file designator of a data file and is assigned to the data file. The data file is stored according to the assigned hash value in the file system. A request hash value is received from the external device, and a data file that has an assigned value corresponding to the request hash value is provided to the external device. A method for receiving such information is also provided, in which information including an information designator is requested. A request hash value is computed from the information designator and transmitted to the server. A data file that includes the requested information is received from the remote server.

Abstract: Salient sampling for query size estimation includes identifying two or more columns in a database table that have corresponding columns in one or more other tables. One or more hash functions are applied to domains of each of the identified columns. A first hash function is applied to a domain of the first column and a second hash function to a domain of the second column. A subset of the rows in the database table is selected. The selecting includes selecting rows in the database table where results of the first hash function meet a first numeric threshold and selecting rows in the database table where results of the second hash function meet a second numeric threshold. A sample database table corresponding to the database table is created. The sample database table includes the selected subset of the rows in the database table.