Abstract: A search query and a concept comprising a feature are received from a user. Positive and negative item sets are identified, where items of the positive item set comprise the feature and items of the negative item set do not comprise the feature. A hyperplane located between the positive and negative item sets is generated using a machine learning model. A concept activation vector (CAV) orthogonal to the hyperplane is determined. The CAV is used to produce a modified search query vector. Based on comparing the modified search query vector with item vectors, a second set of search results is provided.

Abstract: Methods, systems, and programming for retrieving content items for a search are described herein. In a non-limiting embodiment, a query including a plurality of terms may be received. For each of the plurality of terms, a posting list of one or more content items may be obtained. The posting list may include a ranked list of term scores corresponding to the one or more content items, each of the term scores being indicative of a level of relevance of a corresponding content item to a term associated with the posting list. A list of relevant content items for the query may be determined based on the term scores in each posting list for the one or more content items identified with respect to each term. At least one of the relevant content items may be provided as a response to the query.

Abstract: Methods, systems, and programming for updating a search index are described herein. In a non-limiting embodiment, event data representing actions performed on a plurality of content items managed via the search index may be obtained. The event data may be filtered based on pre-determined criteria to generate updated event data, where the updated event data represents relevant actions performed on at least one of the plurality of content items and are associated with the search index. An updated search index based on the updated event data may then be generated.

Abstract: The disclosed embodiments describe techniques for isolating and managing models via versioning. In one embodiment, a method is disclosed comprising reading a configuration document associated with a first model; incrementing an internal write version of the configuration document; storing the internal write version in the configuration document; generating documents belonging to a second model such that respective document identifiers of the documents include a next external version a first field and the incremented internal write version in a second field; and uploading the documents to a serving system, causing the serving system to replace the first model with the second model.

Abstract: Technologies for enhancing work scheduling of a big data framework. The technologies can include generating, in a database, configurable namespaces to be used by a work scheduling enhancement application to group together tasks of one or more big data clusters. The namespaces can be hierarchical. The technologies can also include linking in the database, by the application, related tasks with respective namespaces to categorize and group together the related tasks. The technologies can also include configuring, by the application, a display scheme for displaying error handling and root cause analysis of tasks of the one or more big data clusters. The technologies can also include generating or rendering, by the application, a GUI having a navigable hierarchal view for displaying the namespaces. The generation or rendering of the GUI can be based partially on the display scheme.

Abstract: Technologies for enhancing work scheduling of a big data framework. The technologies can include generating, in a database, configurable namespaces to be used by a work scheduling enhancement application to group together tasks of one or more big data clusters. The namespaces can be hierarchical. The technologies can also include linking in the database, by the application, related tasks with respective namespaces to categorize and group together the related tasks. The technologies can also include configuring, by the application, a display scheme for displaying error handling and root cause analysis of tasks of the one or more big data clusters. The technologies can also include generating or rendering, by the application, a GUI having a navigable hierarchal view for displaying the namespaces. The generation or rendering of the GUI can be based partially on the display scheme.

Abstract: Systems and methods for indexing content in a personal search system are disclosed. In one embodiment, the method comprises receiving a content item from a data source; extracting, from the content item, at least one document appearing in the content item, the at least one document including a first timestamp; storing the document in a content index; retrieving an event associated with the document from an event index, the event including a second timestamp and one or more attributes; generating an updated document based on the one or more attributes, the updated document including the second timestamp and the one or more attributes; and replacing the document stored in the content index with the updated document if the second timestamp is later than the first timestamp.

Abstract: Methods, systems, and programming for updating a search index are described herein. In a non-limiting embodiment, event data representing actions performed on a plurality of content items managed via the search index may be obtained. The event data may be filtered based on pre-determined criteria to generate updated event data, where the updated event data represents relevant actions performed on at least one of the plurality of content items and are associated with the search index. An updated search index based on the updated event data may then be generated.

Abstract: The present teaching relates to concurrent database operation. In one example, a plurality of requests which includes a scan request to obtain first data associated with a plurality of first keys stored in a database is received concurrently. A global version number is updated upon receipt of the scan request. The first data associated with the plurality of first keys is obtained based on the updated global version number. The first data is provided in response to the scan request.

Abstract: Methods, systems, and programming for updating a search index are described herein. In a non-limiting embodiment, event data representing actions performed on a plurality of content items managed via the search index may be obtained. The event data may be filtered based on pre-determined criteria to generate updated event data, where the updated event data represents relevant actions performed on at least one of the plurality of content items and are associated with the search index. An updated search index based on the updated event data may then be generated.

Abstract: Systems and methods for indexing content in a personal search system are disclosed. In one embodiment, the method comprises receiving a content item from a data source; extracting, from the content item, at least one document appearing in the content item, the at least one document including a first timestamp; storing the document in a content index; retrieving an event associated with the document from an event index, the event including a second timestamp and one or more attributes; generating an updated document based on the one or more attributes, the updated document including the second timestamp and the one or more attributes; and replacing the document stored in the content index with the updated document if the second timestamp is later than the first timestamp.

Abstract: Methods, systems, and programming for accessing data are described herein. In a non-limiting embodiment, a request associated with a key may be received. A memory chunk in a first memory site associated with the key may be located. An entry in the memory chunk corresponding to the key may be determined. A first pointer to the key corresponding to a first location of the key within a buffer at a second memory site may be obtained from the entry. The key stored at the first location may be retrieved from the buffer at the second memory site.

Abstract: Systems and methods for indexing content in a personal search system are disclosed. In one embodiment, the method comprises receiving a content item from a data source; extracting, from the content item, at least one document appearing in the content item, the at least one document including a first timestamp; storing the document in a content index; retrieving an event associated with the document from an event index, the event including a second timestamp and one or more attributes; generating an updated document based on the one or more attributes, the updated document including the second timestamp and the one or more attributes; and replacing the document stored in the content index with the updated document if the second timestamp is later than the first timestamp.

Abstract: Technologies for enhancing work scheduling of a big data framework. The technologies can include generating, in a database, configurable namespaces to be used by a work scheduling enhancement application to group together tasks of one or more big data clusters. The namespaces can be hierarchical. The technologies can also include linking in the database, by the application, related tasks with respective namespaces to categorize and group together the related tasks. The technologies can also include configuring, by the application, a display scheme for displaying error handling and root cause analysis of tasks of the one or more big data clusters. The technologies can also include generating or rendering, by the application, a GUI having a navigable hierarchal view for displaying the namespaces. The generation or rendering of the GUI can be based partially on the display scheme.

Abstract: Methods, systems, and programming for accessing data are described herein. In a non-limiting embodiment, a request associated with a key may be received. A memory chunk in a first memory site associated with the key may be located. An entry in the memory chunk corresponding to the key may be determined. A first pointer to the key corresponding to a first location of the key within a buffer at a second memory site may be obtained from the entry. The key stored at the first location may be retrieved from the buffer at the second memory site.

Abstract: Methods, systems, and programming for updating a search index are described herein. In a non-limiting embodiment, event data representing actions performed on a plurality of content items managed via the search index may be obtained. The event data may be filtered based on pre-determined criteria to generate updated event data, where the updated event data represents relevant actions performed on at least one of the plurality of content items and are associated with the search index. An updated search index based on the updated event data may then be generated.

Abstract: Methods, systems, and programming for retrieving content items for a search are described herein. In a non-limiting embodiment, a query including a plurality of terms may be received. For each of the plurality of terms, a posting list of one or more content items may be obtained. The posting list may include a ranked list of term scores corresponding to the one or more content items, each of the term scores being indicative of a level of relevance of a corresponding content item to a term associated with the posting list. A list of relevant content items for the query may be determined based on the term scores in each posting list for the one or more content items identified with respect to each term. At least one of the relevant content items may be provided as a response to the query.

Abstract: Systems and methods for indexing content in a personal search system are disclosed. In one embodiment, the method comprises receiving a content item from a data source; extracting, from the content item, at least one document appearing in the content item, the at least one document including a first timestamp; storing the document in a content index; retrieving an event associated with the document from an event index, the event including a second timestamp and one or more attributes; generating an updated document based on the one or more attributes, the updated document including the second timestamp and the one or more attributes; and replacing the document stored in the content index with the updated document if the second timestamp is later than the first timestamp.

Abstract: The present teaching relates to concurrent database operation. In one example, a plurality of requests which includes a scan request to obtain first data associated with a plurality of first keys stored in a database is received concurrently. A global version number is updated upon receipt of the scan request. The first data associated with the plurality of first keys is obtained based on the updated global version number. The first data is provided in response to the scan request.