Patent classifications
G06F16/24556
User Privacy Data-Based Recommendation Method and Apparatus, Medium, and System
A user privacy data-based recommendation method includes sending a user preference tag to a cloud, where the user preference tag includes a first generalized tag obtained after a first tag generated based on privacy data of a user is generalized, receiving a plurality of resource items found by the cloud from a resource library based on the user preference tag, and selecting a recommended resource item from the plurality of resource items.
Methods and apparatus to partition data
Methods and apparatus to partition data are disclosed. An example apparatus to partition panelist data includes an indicator matrix generator to determine an indicator matrix including panelist vectors for panelists based on panelist data associated with the panelists, a first one of the panelist vectors for a first one of the panelists to indicate whether the first one of the panelists: has a first characteristic, meets a first criterion based on the first characteristic and a second characteristic, has a third characteristic, and meets a second criterion based on the third characteristic and a fourth characteristic. The example apparatus further includes a matrix reducer to reduce the indicator matrix to a set of unique panelist vectors that represent partitions of the panelist data, the partitions of the panelist data to utilize less storage capacity than the panelist data.
Social communities assistant
A social communities assistant system may serve as a proxy for a user when communicating with social networking communities. The user may have a single interface on, such as an application, to communicate with a plurality of social communities. As a proxy, the social communities assistant system may manage parallel communications among the social communities on behalf of the user. The social communities assistant system may manage communications of various types. These types of communication may include queries, responses, statements, event notifications, or actions, among other things.
A/B testing of service-level metrics
The disclosed embodiments provide a system for performing A/B testing of service-level metrics. During operation, the system obtains service-level metrics for service calls made during an A/B test, wherein the service-level metrics are aggregated by user identifiers of multiple users. Next, the system matches the service-level metrics to treatment assignments of the users to a treatment group and a control group in the A/B test. The system then applies the A/B test to a first grouping of the service-level metrics for the treatment group and a second grouping of the service-level metrics for the control group. Finally, the system outputs a result of the A/B test for use in assessing an effect of a treatment variant in the A/B test on the service-level metrics.
Inheritance in dynamic hierarchical systems
Methods and apparatus are disclosed for representing a dynamic hierarchical system as a composite graph data structure. Members of a system are represented as primary nodes of a tree. Multiple system states have respective trees, which can be overlaid to obtain a composite graph. The composite graph can be augmented with secondary nodes for member attributes, and further nodes for state-dependent values of the attributes. Methods of processing bottom-up, top-down, and filtered queries are disclosed. Applications to military, manufacturing, and communication networks are provided.
Method for duplicate determination in a graph
Embodiments of the present invention determines duplicates in a graph. The graph comprises nodes representing entities and edges representing relationships between the entities. The method comprises: identifying at least two nodes in the graph. A neighborhood subgraph may be determined for each of the two nodes. The neighborhood subgraph includes the respective node. The method further comprises determining whether the two nodes are duplicates with respect to each other, based on a result of a comparison between the two subgraphs.
Adaptive compression optimization for effective pruning
A database management system is described that can encode data to generate a plurality of data vectors. The database management system can perform the encoding by using a dictionary. The database management system can adaptively reorder the plurality of data vectors to prepare for compression of the plurality of data vectors. During a forward pass of the adaptive reordering, most frequent values of a data vector of the plurality of data vectors can be moved-up in the data vector. During a backward pass of the adaptive reordering, content within a rest range of a plurality of rest ranges can be rearranged within the plurality of data vectors according to frequencies of the content. The reordering according to frequency can further sort the rest range by value. Related apparatuses, systems, methods, techniques, computer programmable products, computer readable media, and articles are also described.
Database performance degradation detection and prevention
Techniques for database performance degradation detection and prevention are described. A statement performance monitor observes queries executed against a database engine and clusters the queries into groups of queries. The index utilization of the query groups and execution metrics are tracked over time, and a sudden change of index utilization can be detected. The change can be reported to users and/or new indexes may be automatically generated to serve affected query groups. Additionally, a statement performance monitor may be deployed to statically analyze code to identify modified queries and the resultant change of use of query indexes.
Dynamic aggregate generation and updating for high performance querying of large datasets
The present disclosure provides a detailed description of techniques used in systems, methods, and in computer program products for dynamic aggregate generation and updating for high performance querying of large datasets. Certain embodiments are directed to technological solutions for determining at least one aggregate of selected virtual cube attributes (e.g., measures, dimensions, etc.) describing a virtual multidimensional data model of a subject database, and generating an aggregate table and a set of aggregate metadata for the aggregate. In some embodiments, an aggregate database statement configured to operate on the subject database can be issued to generate the aggregate table and/or aggregate metadata. Further, the aggregate can be dynamically determined responsive to receiving a database statement configured to operate on the virtual multidimensional data model representing the subject database. Also, the aggregate table can comprise one or more partitions in an aggregate view to facilitate aggregate management and/or quality.
DATA UNIFICATION
Solutions for data unification include: receiving a data record, the data record comprising a plurality of data fields; selecting, from among the plurality of data fields, a subset of the data fields, the subset of the data fields being fewer in number than the plurality of data fields, wherein selecting the subset of the data fields comprises: applying a first rule to select at least a first one of the data fields within the data record for inclusion in the subset of the data fields; using content of the subset of the data fields, generating a stable identifier (stableID) for the data record; and inserting the stableID into a primary key data field of the data record.