The present application discloses a method, an apparatus, a device, and a storage medium for intention recommendation, which relates to the field of big data, artificial intelligence, intelligent search, information flow and deep learning technologies in the field of computer technologies. A specific implementation scheme includes: receiving an intention query request carrying an intention keyword and a user identification, determining a first recommendation list according to the intention keyword and a pre-configured intention repository, where the intention repository includes at least one tree-shaped intention set, and each tree-shaped intention set includes at least one graded intention, processing intentions in the first recommendation list by using intention strategy information corresponding to the user identification to obtain a target recommendation list and output it.

A software voting or prediction system iteratively solicits participant preferences between members of a set, with a binary tree built used to minimize the number of iterations required. As each member of the set is considered, it is pairwise-compared with select members represented by nodes already in the binary tree, with iterations beginning at a root node of the tree and continuing to a leaf node. The newly considered member is placed as a new leaf node, and the tree is height-rebalanced as appropriate. Red-black tree coloring and tree rotation rules are optionally used for this purpose. Yes/no preference tallies are kept for each member of the set throughout the tree-building process and are ultimately used for scoring. Height-rebalancing of the tree helps minimize the number of iterations needed to precisely score each member of the set relative to its alternatives.

In some implementations, events measured at various points in time may be organized in a data structure that defines an event represented by a document. In particular, events can be organized in columns of documents referred to as buckets. These buckets may be indexed using B-trees by addressing metadata values or value ranges. Buckets may be defined by periods of time. Documents may also be geoindexed and stored in one or more locations in a distributed computer network. One or more secondary indexes may be created based on time and/or metadata values within documents.

A method may include inserting, into a hash trie, data records from a database table. The inserting may include traversing the hash trie to identify, for each data record included in the database table, a corresponding node at which to insert the data record. The hash trie may be traversed based on a hash of a key value associated with each data record. The node at which to insert a data record may be identified based on an offset forming a binary representation of the hash of a key value associated with that data record. The offset may include a portion of a plurality of binary digits forming the binary representation. A data record may be inserted at a corresponding node by updating a data structure included at the node. A database operation may be performed based on the hash trie filled with the data records from the database table.

Systems and methods for retrieval of information from read-only databases that hold taxonomic-related and sequence-related data. A method may include receiving organism names from a taxonomy database and detecting new organism names. The method may also include retrieving hierarchical data and assigning the new organism names to buckets based on the hierarchical data. The method may further include receiving sequence data elements from a nucleotide database, identifying particular buckets to correspond to a screener data set, querying organism names assigned to the particular buckets with names of reference sequences of the sequence data elements, generating a mapping between the sequence data elements and organism names returned as a result of the queries, and storing the mapping.

Described are methods, systems and computer readable media for dynamic updating of query result displays.

Some embodiments of the invention provide a method for defining code-based policies. The method generates a policy-builder first view of a policy for display in a graphical user interface (GUI) by processing a syntax tree that is generated from a code second view of the policy. The method receives, through the policy-builder first view, a modification to a portion of the policy. To reflect the modification, the method updates a portion of the syntax tree that corresponds to the portion of the policy that is affected by the modification. Based on the updating of the syntax tree, the method updates the code second view by modifying a portion of the code second view that corresponds to the updated portion of the syntax tree.

In some aspects, the disclosure is directed to methods and systems for data storage and retrieval from a computer memory. A computing device may store a first hierarchical data structure having a first sequence of sub-data structures and a second hierarchical data structure having a second sequence of sub-data structures in memory. The computing device may link the first hierarchical data structure and the second hierarchical data structure together. The computing device may link the first hierarchical data structure and the second hierarchical data structure by inserting an identifier of a sub-data structure of the second sequence in the first sequence.

In one or more embodiments, a system generates a navigable interface for traversing sets of content based on system-determined relationships between the sets of content. The system uses a trained machine learning model to determine characteristics, such as layout, for sets of content. The characteristics are mapped to a content type. The system organizes the sets of content, based on respective content type, into a set of pages of a multipage navigable interface. Furthermore, the system selects navigational relationships between the sets of content based on respective content type. The navigational relationships are implemented via interface elements that allow for navigation between the pages of the navigable interface including corresponding sets of content.

System and method for managing copy-on-write (COW) B tree structures for metadata of storage objects stored in a storage system determine, when a request to modify a target storage object stored in the storage system that requires a modification of a target leaf node in a B tree structure for metadata of the target storage object is received, whether an operation sequence number of the target leaf node is greater than a snapshot sequence number of a parent snapshot of a running point of the B tree structure. When the operation sequence number is greater than the snapshot sequence number, the target leaf mode is modified in place without copying the target leaf node. When the operation sequence number is not greater than the snapshot sequence number, the target leaf node is copied as a new leaf node for the B tree structure and the new leaf node is modified.