Abstract: A system and method for graph-based publication/subscription are provided. A graph comprising nodes and edges is created, each node representative of a point of interest in an information domain, each edge linking a first node and a second node and representative of a relationship between a first and a second point of interest. A request to publish content on at least one selected node and/or at least one selected edge is received. A request to subscribe to a subset of nodes and/or a subset of edges is received from a subscriber. The subscription request is correlated with the publication request to determine whether the subset of nodes comprises the selected node and whether the subset of edges comprises the selected edge. The content is notified to the subscriber if the subset of nodes comprises the selected node and the subset of edges comprises the selected edge.

Abstract: Systems and methods are provided that, in some embodiments that extract user data from at least one data warehouse. The user data is sorted within each dimension, and partitions each dimension into bins. Clusters are defined as each bin that includes user data for a number of users that exceeds a threshold. Clusters are determined for every combination of dimensions. Each combination of clusters that exceed the threshold is defined as clusters that are formed from multiple dimensions. All clusters and other clusters are stored into a cluster definition table. The clusters are used to analyze the profile of specific users.

Abstract: An exemplary computer implemented method for processing data in a database management system implemented on a network of two or more nodes is disclosed. The method includes receiving a query referencing first and second user-defined table functions and a table distributed across the two or more nodes. The first user-defined table function is executed on each of the two or more nodes by processing records of the table residing on the respective nodes. A data sample is generated per node as a result of executing the first user-defined table function on each of the two or more nodes. The generated data samples are stored in a selected set of nodes. The second user-defined table function is executed on each of the selected set of nodes by processing records of the data samples residing on the respective nodes of the selected set of nodes to compute a user-defined aggregate.

Abstract: One or more computing devices may comprise congestion management circuitry, one or more client file system request buffers, and DESS interface circuitry. The congestion management circuitry is operable to determine an amount of congestion in the DESS. The one or more client file system request buffers is/are operable to queue first client file system requests of a first priority level and second client file system requests of a second priority level, wherein the first priority level is higher priority than the second priority level. The DESS interface circuitry is operable to control a rate at which the first file system requests and second file system requests are fetched from the one or more client file system request buffers based on the amount of congestion in the DESS, on the first priority level, and on the second priority level.

Abstract: A system and method of providing customized hair care information including the step of gathering data on an individual's hair. The system and method includes the step of creating, within a computerized system, an account. The system and method includes storing the gathered data in association with the account in a computerized data storage device. The system and method include the step of analyzing the stored data using a processor in association with a computerized knowledge base thereby generating account analytics. The step of analyzing stored data from a plurality of diverse accounts includes the step of grouping the analyzed stored data by at least one category selected from the group of categories consisting of: race/ethnicity, hair color, hair composition, hair style, hair length, hair thickness, and hair curliness. The system and method includes automatically generating a customized hair report based on the account analytics.

Abstract: Methods and apparatuses for determining set-membership using Single Instruction Multiple Data (“SIMD”) architecture are presented herein. Specifically, methods and apparatuses are discussed for determining, in parallel, whether multiple values in a first set of values are members of a second set of values. Many of the methods and systems discussed herein are applied to determining whether one or more rows in a dictionary-encoded column of a database table satisfy one or more conditions based on the dictionary-encoded column. However, the methods and systems discussed herein may apply to many applications executed on a SIMD processor using set-membership tests.

Abstract: Techniques related to a database performance tuning framework are disclosed. The techniques include a system for improving performance of a database query, the system configured to generate one or more query execution time statistics relating to a database query operation performed by a database in response to a received query, store the query execution time statistics, determine the database query operation is slow based on the stored query execution time statistics, generate one or more database statistics based on the contents of the database, generate a suggested index using one or more of the generated database statistics, create the suggested index, determine another one or more query execution time statistics for the database query operation after creating the suggested index, and retain the suggested index based on a comparison of the stored query execution time statistics and the another query execution time statistics.

Abstract: Methods and apparatuses for determining set-membership using Single Instruction Multiple Data (“SIMD”) architecture are presented herein. Specifically, methods and apparatuses are discussed for determining, in parallel, whether multiple values in a first set of values are members of a second set of values. Many of the methods and systems discussed herein are applied to determining whether one or more rows in a dictionary-encoded column of a database table satisfy one or more conditions based on the dictionary-encoded column. However, the methods and systems discussed herein may apply to many applications executed on a SIMD processor using set-membership tests.

Abstract: The present disclosure is directed to generating search results, recommendations, and/or the like. In particular, the methods and systems of the present disclosure can: receive data describing one or more aspects of an entity; determine, based at least in part on the aspect(s) of the entity, one or more additional aspects of the entity; determine, based at least in part on the aspect(s) of the entity and the additional aspect(s) of the entity, a metric indicating a reputational prominence of the entity relative to multiple other entities of similar type; generate, based on the metric, one or more search results, recommendations, and/or the like; and communicate, to a computing device (e.g., for display, and/or the like), data indicating the search result(s), recommendation(s), and/or the like.

Abstract: Embodiments of the present invention relate to the field of storage technologies, and provide a distributed database processing method. A database processing device receives an access request; obtains, from a partition routing table of the data table according to the query index field and the value of the query index field, partition information and a value that correspond to the query index field; and sends, according to the partition information and the value of the partition information that correspond to the query index field and the value of the query index field, the access request to a database corresponding to the partition information and the value of the partition information.

Abstract: Systems and methods for interest-driven business intelligence systems including event-oriented data in accordance with embodiments of the invention are illustrated. In one embodiment, an interest-driven business intelligence system includes raw data storage configured to contain raw data and perform ETL processes, a data mart configured to contain metadata that describes the raw data, and an intermediate processing layer, wherein the intermediate processing layer is configured to compile an interest-driven data pipeline configured to generate ETL processing jobs to generate event-oriented data from the raw data by filtering the raw data based on the metadata describing the raw data, determining ordering data based on the metadata describing the raw data, aligning the filtered raw data based on the ordering data, and generating event-oriented data based on the aligned filtered raw data, and storing the event-oriented data in the data mart.

Abstract: The present disclosure is directed to generating search results, recommendations, and/or the like. In particular, the methods and systems of the present disclosure can: receive data describing one or more aspects of entities of different types; determine, based at least in part on the aspect(s) of the entities, one or more additional aspects of the entities; determine, based at least in part on the additional aspect(s) of the entities, a metric indicating an extent to which the entities correspond to one another; generate, based on the metric, one or more search results, recommendations, and/or the like; and communicate, to a computing device (e.g., for display, and/or the like), data indicating the search result(s), recommendation(s), and/or the like.

Abstract: A method for partitioning an association table in a distributed database, where a manager determines a first data table in data tables requiring partition and generates a colocation partition (CP) table set of the first data table, the CP table set of the first data table includes the first data table and at least one CP table of the first data table, and a CP table of the first data table includes a data table whose partition key includes a subset of a partition key of the first data table. The manager partitions the first data table according to the partition key and partitions each CP table in the CP table set, a partition range of a partition key of each CP table is the same as a partition range of a corresponding partition key in the first data table.

Abstract: A method for sorting alarm-messages of a plant having at least one alarm-area each having at least two plant-devices connected by at least one connection, wherein the at least one alarm-area is defined so that the plant-devices and the respective connection provide a directed graph, involves: providing at least one database containing alarm-data and topology-data; wherein the topology-data describe a directed graph having at least one connection with a related flow direction between the respective plant-devices of the respective assigned alarm-area; generating at least one partly complete first alarm-order of the alarm-messages of the at least one alarm-area by sorting the alarm-messages according to the flow direction of the directed graph.

Abstract: A system and method of analyzing data receives a user-specified selection of a data source, a user-specified selection of a type of data representation, and a user-specified description of a view to be constructed in accordance with the user-specified selection of the type of data representation. An application program interface (API) function generates a multidimensional query based on the user-specified type of data representation and the user-specified description of the view to be constructed, and submits the multidimensional query to the an On-line Analytical Processing (OLAP) server. The application program interface (API) function receives a multidimensional response from the OLAP server containing results acquired by the multidimensional query of the data source, and generates the view based on the results contained in the multidimensional response and in accordance with the user-specified selection of the type of data representation and the user-specified description of the view.

Abstract: A device, system, and computer implemented method for storing segmented data in a computer memory, the segmented data indicating which of a plurality of entities belong to which of a plurality of segments, each segment accommodating entities sharing a single binary characteristic. A computer receives a list of entity identifiers selected from a sequence of entity identifiers, each entity identifier in the list representing an entity which belongs to a segment; the computer uses the list to create a bitmap in which each bit has a bit position in a bit sequence corresponding to the sequence of entity identifiers. The state of each bit indicates whether the entity identifier representing that position in the sequence identifies an entity belonging in the segment or not; and the bitmap is stored in a memory in association with a segment identifier, as the segmented data.

Abstract: A garbage collection (GC) process within a deduplication backup network comprising a GC component identifying metadata stored in file system (FS) segments, storing the metadata in a metadata container locally on the server as well as on cloud storage, and reading the locally stored metadata container through the GC process to obtain metadata of the FS containers and determine live data regions of the FS containers, wherein the metadata contains fingerprints of all segments of the file system containers; and a copy forward component forwarding the live data regions to new containers written both locally on the server and on the cloud storage, writing live portions of the metadata container to a new metadata container written both locally on the server and on the cloud storage, and deleting dead compression regions from the cloud storage and deleting the original metadata container from local storage and the cloud storage.

Abstract: A data processing method is provided, wherein the method includes for each region in multiple regions, generating, according to a correspondence between location information of a user in a user group and the region, a user appearing information bit set corresponding to the region, where a bit value of each bit in the user appearing information bit set indicates whether a corresponding user in the user group appears in the region; receiving a request message carrying a region indication parameter; querying, according to the region indication parameter, for a user appearing information bit set corresponding to a region indicated by the region indication parameter, and performing data processing according to the found user appearing information bit set. Thus, a user appearing information bit set corresponding to a region is generated, thereby reducing data storage space, and increasing computing efficiency and a computing speed when performing data processing.

Abstract: Described herein are enterprise search systems and methods that cluster search results that are associated with the same metadata or the same enterprise search site into one or more clustered results panels of a search results panel. The search results that are not included in the clustered results panel(s) are included in a non-clustered results panel of the search results panel.

Abstract: Query optimization using of a query that is compiled into a query tree. The optimization is efficiently performed by using a distinct value estimation data structure (e.g., a KMV synopsis) that represents within an interval distinctness of values that are generated based on data within an interval, even if the resultant data from a subinterval is considered. Various candidate query trees are evaluated, with distinct value generation data structures being propagated for parent nodes based on the distinct value generation data structures of its child node(s). Propagation operations correlate to the operation represented by the parent node in the query tree. The optimizer uses the propagated distinct value estimation structure in order to evaluate the number of distinct values of data that would result from execution of the candidate query tree at least at the corresponding operations (and not just based on the distinct values of the input data).