Abstract: An embodiment of the invention includes a method of managing data items based on context, where markers are associated with the data items, where the markers indicate states of authors of the data items when the data items were created. The markers can be associated with the data items by a processor. A query for a data item can be received from a user via an interface, where the query can include one or more markers indicative of the state of an author of the data item when the data item was created. The results of the query can be displayed, where the results of the query can include data items that are associated with the marker(s).

Abstract: A unified document retention management system exposes a retention policy management portal to enable a user to selectively prescribe a unified retention policy to multiple productivity platforms to deploy the unified retention policy across the user selected productivity platforms. Data retention rules of the unified retention policy may define actions to be performed with respect to files that satisfy certain predefined conditions. An exemplary data retention rule prescribes a retention age threshold to files that have been tagged with a particular label. Files may be manually labeled by users and/or may be automatically labeled by the system in accordance with one or more smart label rules. The retention age threshold may be enforced for such tagged files by preventing the files from being deleted and/or modified prior to them reaching the retention age threshold. Then the files may automatically be purged from system storage upon reaching the retention age threshold.

Abstract: A method for rendering context based information on a user interface includes receiving a user request to extract the context based information from a database. The database includes a plurality of documents and the request includes at least one search criteria required to determine a context of the user request. The method includes generating a list of documents corresponding to the context of the user request and rendering on a viewing portion of the user interface the list of documents corresponding to the context of the user request.

Abstract: A method, system and computer program product for index maintenance in a computer system comprising a plurality of nodes, a database, and an index to the database. In one embodiment, the method comprises, for a defined period of time, building a snapshot of selected change requests received by the nodes to change the database. After this defined period of time, a selection is made, based on specified criteria, whether to rebuild a new index to the database, or to add entries to a current index. When the selection is to rebuild a new index, the new index is rebuilt based on data in the database and in the change requests in the snapshot. When the selection is to add entries to a current index, entries are added to the current index based on data in the database and in the change requests in the snapshot.

Abstract: Providing at least one contextually relevant suggestion to one or more users of an ongoing message exchange thread between the users. The suggestion is provided for presentation to the user(s) via user interface output device(s) of computing device(s) of the user(s). The suggestion indicates a query that can be submitted to an automated assistant to cause the automated assistant to incorporate, into the message exchange thread, content that is responsive to the query. In some implementations, the suggestion is a selectable suggestion and content that is responsive to the query is incorporated into the message exchange thread in response to user interface input that is directed to the selectable suggestion. In some implementations, the suggestion is determined based on one or more messages that have already been communicated between users of the message exchange thread.

Abstract: A method for rendering context based information on a user interface includes receiving a user request to extract the context based information from a database. The database includes a plurality of documents and the request includes at least one search criteria required to determine a context of the user request. The method includes generating a list of documents corresponding to the context of the user request and rendering on a viewing portion of the user interface the list of documents corresponding to the context of the user request.

Abstract: A method for rendering context based information on a user interface includes receiving a user request to extract the context based information from a database. The database includes a plurality of documents and the request includes at least one search criteria required to determine a context of the user request. The method includes generating a list of documents corresponding to the context of the user request and rendering on a viewing portion of the user interface the list of documents corresponding to the context of the user request.

Abstract: A data storage system implements techniques for efficient retrieval of data stored thereon, using time of upload or another monotonically increasing variable as a key or identifier for the data to be stored and/or retrieved. Data is sorted according to, e.g., upload time, and the data is addressed with respect to time of upload and byte offset within the archive.

Abstract: A data modification request for modifying data in a primary database is received at the primary database. Based on the data modification request, second data in the primary database is modified to first data. Based on the data modification request, a first log and a second log are generated, where the first log is a simplified log including the first data and the second log is a complete log including the second data. Persistence processing is performed on the first log. A modification result that corresponds to the data modification request is returned.

Abstract: A database system may receive a query and form a plan for executing the query using a hypothetical index selected based on columns referenced by the query. The database system may compare the hypothetical index to indexes on the computing nodes of the database system. Based on the comparison, the database system may form a new index, based on the hypothetical index, on one of the computing nodes. An additional computing node may be added to the database system for the purpose of maintaining the new index. Subsequent queries having commonality with the first query may be processed on a node maintaining the first index.

Abstract: Computer systems, devices, and associated methods of serializing a web page that is of a first format and includes a plug-in including properties of a second format are disclosed herein. In one embodiment, a method includes identifying, in a manifest for the plug-in, properties for inclusion in the first format in a serialized web page. The manifest may also include metadata associated with the properties in the list of properties. The method includes formatting the properties, including associated property values and metadata, in the first format and adding the formatted properties to the serialized web page. The plug-in properties not included in the manifest can be added to the serialized web page in the second format.

Abstract: Systems and methods for performing a recovery operation for a host. A user interface is displayed and a recovery operation is configured. During configuration of the recovery operation, the source of the backup for the recovery operation can be selected by a user. The recovery operation is performed based on the user-selected backup.

Abstract: Systems and methods for performing a recovery operation for a host. A user interface is provided than enables user interface interactions that are common to or independent of the host and user interface interactions that are specific to a client backup module selected for the recovery operation. The user interface retrieves a plug-in to enable the user interface interactions that are specific to the client backup module.

Abstract: A data modification request for modifying data in a primary database is received at the primary database. Based on the data modification request, second data in the primary database is modified to first data. Based on the data modification request, a first log and a second log are generated, where the first log is a simplified log including the first data and the second log is a complete log including the second data. Persistence processing is performed on the first log. A modification result that corresponds to the data modification request is returned.

Abstract: A method of processing a query to a graph database using processors. The method comprises providing threads to be executed on processors, each the thread is associated with one of a plurality of unique thread identifiers, providing a graph database having a plurality of graph database nodes and a plurality of graph database edges, each the graph database edge represents a relationship between two of the plurality of graph database nodes, receiving a query tree that defines a tree comprising plurality of query nodes connected by a plurality of query tree edges, and searching at least part of the graph database for a match with the query tree, wherein the searching is executed by the processors, and wherein each processor searches one of a plurality of sub-graphs of the graph database, each the sub-graph is defined by one of the plurality of thread identifiers.

Abstract: A data processing system for updating search result facets comprises a facet linking module which is configured to update a search result facet and corresponding facet categories in view of a non-linked search result property.

Abstract: Storage allocation based on secure data comparisons is disclosed. One example is a system including a plurality of intermediaries, a data allocator and a plurality of storage containers. Each intermediary receives a request from the data allocator to identify a target storage container of the plurality of storage containers, for secure allocation of a data term. Each intermediary compares, for each storage container, the truncated data term with a collection of truncated candidate terms to select a representative term of the candidate terms, identifies the selected representative term to the storage container, receives a similarity profile from each storage container, where the similarity profile is representative of similarities between the truncated data term and terms in the storage container, and selects a candidate target storage container based on similarity profiles received from each storage container.

Abstract: A computer-implemented system, methods and computer storage media are provided for creating extensible data structures for rule based systems to improve complex event processing. An underlying individual data model is accessed and the content is translated to create singleton values to be utilized in complex event processing to improve the execution fo the complex event processing.

Abstract: Methods, systems, and media for presenting content organized by category are provided. In some embodiments, the method comprises: receiving a request to present a page indicating content related to a first entity; identifying a first group of entities related to the first entity based at least in part on user interaction information; identifying a group of properties corresponding to the first entity; identifying, for each property, a second group of entities corresponding to the property; calculating, for each property, a score for the property; determining a subset of the properties in the group of properties based on the score of each property; identifying, for each property in the subset of properties, a group of content items corresponding to the property; determining a subset of content items from the group of content items; and causing a user interface indicating the subset of content items to be presented.

Abstract: Techniques related to a sparse dictionary tree are disclosed. In some embodiments, computing device(s) execute instructions, which are stored on non-transitory storage media, for performing a method. The method comprises storing an encoding dictionary as a token-ordered tree comprising a first node and a second node, which are adjacent nodes. The token-ordered tree maps ordered tokens to ordered codes. The ordered tokens include a first token and a second token. The ordered codes include a first code and a second code, which are non-consecutive codes. The first node maps the first token to the first code. The second node maps the second token to the second code. The encoding dictionary is updated based on inserting a third node between the first node and the second node. The third node maps a third token to a third code that is greater than the first code and less than the second code.