Abstract: A computer implemented method for detecting errors in data includes obtaining one or more graph functional dependency (GFD) rules comprising a set of GFD rules, obtaining a set of GFDs representative of the data, building a canonical graph for the GFD rules, and determining that one or more GFD of the set of GFDs conflict based on the set of GFD rules and the canonical graph and, based thereon, determining an error in the set of GFDs.

Abstract: A graph data storage method for non-uniform memory access architecture (NUMA) processing system is provided. The processing system includes at least one computing device, each computing device corresponding to multiple memories, and each memory corresponding to multiple processors. The method includes: performing three-level partitioning on graph data to obtain multiple third-level partitions based on a communication mode among computing device(s), memories, and processors; and separately storing graph data of the multiple third-level partitions in NUMA nodes corresponding to the processors. A graph data storage system and an electronic device are further provided.

Abstract: A method for scheduling a computational operation based on graph data, which includes: dividing graph data into multiple partitions; scheduling the partitions to be allocated to multiple processors; successively assigning the partitions to corresponding threads of the processors for computation according to a respective degree of criticality of each partition; determining whether an idle processor exists, a processor being the idle processor when the processor includes one or more idle threads; communicating the idle processor with other processor(s) to find partition(s) to be computed and corresponding to the other processor(s); selecting and determining a partition to be computed; and migrating and binding the determined partition to be computed to thread(s) of the idle processor for processing. The present disclosure further relates to a system, a computer readable medium, and a device for scheduling a computational operation based on graph data.

Abstract: A mechanism of updating query results for a graph linking data in a computer system is disclosed. Results of the query on the graph linking data are received along with a change to the graph. The change to the graph is determined to be localizable or relatively bounded. Based on the determination of the localizable or relatively bounded change to the graph, the results of the query are updated based on the change to the graph without determining updated results of the query over the graph. This is accomplished by discovering nodes that are affected by the change to the graph, updating data associated with the affected nodes, and applying the updated data to the results of the query.

Abstract: A mechanism for rewriting a bounded query onto a view is disclosed. A query, access constraints, and cached view(s) are obtained. The cached view(s) contain results of the query as applied to a dataset stored in a database. A query rewriting plan is generated by adding a fetch from query operation to the plan when a rewritten query variable can be fetched from a query constant. A fetch from database operation is added to the plan when a rewritten query variable can be fetched as a query variable that obtains bounded data from the database. An access view operation is added to the plan when a rewritten query variable can be fetched from the cached view. The query rewriting plan is executed to fetch retrieved data. The query is executed on the retrieved data to determine updated results to the query without reapplying the query to the dataset.

Abstract: A computer implemented method for detecting errors in data includes obtaining one or more graph functional dependency (GFD) rules comprising a set of GFD rules, obtaining a set of GFDs representative of the data, building a canonical graph for the GFD rules, and determining that one or more GFD of the set of GFDs conflict based on the set of GFD rules and the canonical graph and, based thereon, determining an error in the set of GFDs.

Abstract: A mechanism for rewriting a bounded query onto a view is disclosed. A query, access constraints, and cached view(s) are obtained. The cached view(s) contain results of the query as applied to a dataset stored in a database. A query rewriting plan is generated by adding a fetch from query operation to the plan when a rewritten query variable can be fetched from a query constant. A fetch from database operation is added to the plan when a rewritten query variable can be fetched as a query variable that obtains bounded data from the database. An access view operation is added to the plan when a rewritten query variable can be fetched from the cached view. The query rewriting plan is executed to fetch retrieved data. The query is executed on the retrieved data to determine updated results to the query without reapplying the query to the dataset.

Abstract: A mechanism of updating query results for a graph linking data in a computer system is disclosed. Results of the query on the graph linking data are received along with a change to the graph. The change to the graph is determined to be localizable or relatively bounded. Based on the determination of the localizable or relatively bounded change to the graph, the results of the query are updated based on the change to the graph without determining updated results of the query over the graph. This is accomplished by discovering nodes that are affected by the change to the graph, updating data associated with the affected nodes, and applying the updated data to the results of the query.

Abstract: A processor executes instructions stored in non-transitory memory storage to receive a pattern query for a graph and determine a set of access constraints corresponding to the pattern query. A determination is made whether the pattern query is effectively bounded under the set of access constraints. A query plan is formed to retrieve a subgraph of the graph when the pattern query is effectively bounded under the set of access constraints. The answer to the pattern query is obtained by accessing the at least one subgraph in response to the query plan.

Abstract: A graph data search method and apparatus, where the method includes obtaining a query request including a query condition that carries a start graph node, the query request queries a first to-be-queried graph node matching the query condition from a graph data set, and the graph data set includes the start graph node, a plurality of to-be-queried graph nodes, an association relationship between the start graph node and the plurality of graph nodes, and an association relationship between each to-be-queried graph node and another graph node, filtering out, according to the query condition and a preset available resource condition, a second to-be-queried graph node that does not meet the query condition and an association relationship in the graph data set that includes the second to-be-queried graph node, and performing a query in the reduction subgraph using the query condition.

Abstract: A graph data search method and apparatus, where the method includes obtaining a query request including a query condition that carries a start graph node, the query request queries a first to-be-queried graph node matching the query condition from a graph data set, and the graph data set includes the start graph node, a plurality of to-be-queried graph nodes, an association relationship between the start graph node and the plurality of graph nodes, and an association relationship between each to-be-queried graph node and another graph node, filtering out, according to the query condition and a preset available resource condition, a second to-be-queried graph node that does not meet the query condition and an association relationship in the graph data set that includes the second to-be-queried graph node, and performing a query in the reduction subgraph using the query condition.

Abstract: A processor executes instructions stored in non-transitory memory to determine whether a query to big data is bounded evaluable, or may be rewritten to access a bounded amount of data or information in a dataset. A query plan may retrieve the information by using indices in access constraints of the query. The cost associated with obtaining the information by using the query plan may be dependent on the query and access constraints and not the size of the dataset. A query plan to obtain the information may be formed for different types or classes of queries, such as conjunctive queries (CQ), unions of conjunctive queries (UCQ) and positive existential FO (first order) conjunctive queries (?FO+). When a query is not bounded evaluable, a determination is made whether an approximation to the information may be retrieved. An approximation may be obtained by using upper and lower envelopes or specialized queries.

Abstract: Graph pattern association rules (GPARs) are proposed for social media marketing. Extending association rules for item-sets, GPARs help discover regularities between entities in social graphs, and identify potential customers by exploring social influence. The problem of discovering top-k diversified GPARs is NP-hard. A parallel algorithm is thus disclosed with accuracy bound. A parallel scalable algorithm is further disclosed that guarantees a polynomial speedup over sequential algorithms with the increase of processors.

Abstract: The present invention provides a visualization method based on quartile graph display data, the method comprising: the step of defining a data grid (Gx) and determining the display scale of the X axis; the steps of data source configuration, scanning, and reading; the step of analyzing stored data and correcting the X axis to display the scale, and calculating the quartile of the data in each data grid (Gx) of each scale level; the step of using a quartile graph to display the data. By means of defining a data grid (Gx) to store data, the four display scales of the X axis being interchangeable, and using a quartile graph to display data, the present invention displays the distribution of two-dimensional data in extremely large-volume data or big data environments, and provides interactive functionality. The present invention also provides a visualization system based on quartile graph display data.

Abstract: A data quality measurement method based on a scatter plot, the method comprising: defining a data grid (Gxy) and fitting a plurality of trend lines; using a scatter plot to display data and according to actual trends, selecting a trend line and displaying same; generating data quality rules according to the determined trend line type and parameters; selecting appropriate data quality rules and measuring data quality according to a threshold. By means of defining the data grid (Gxy) to store data, using a scatter plot to display data, and generating data quality rules according to the determined trend line type and parameters, and further setting a threshold according to said rules and measuring data quality, applications such as display of data, analysis of abnormal data, and data error correction can be performed for enormous amounts of data. Another embodiment provides a data quality measurement system based on a scatter plot.

Abstract: The present invention provides a data quality measurement method based on a quartile graph, the method comprising: defining a data grid (Gx) and fitting a plurality of trend lines; scanning a data source and storing, and according to actual trends of the data, selecting a trend line and displaying data; generating data quality rules according to the determined trend line type and parameters; selecting appropriate data quality rules and measuring data quality according to a threshold. By means of defining a data grid (Gx) to store data, using a quartile graph to display data, and generating data quality rules according to the determined trend line type and parameters, and further setting a threshold according to said rules and measuring data quality, the present invention performs, for enormous amounts of data, applications such as display of data, analysis of abnormal data, and data error correction.

Abstract: The present invention provides a visualization method based on quartile graph display data, the method comprising: the step of defining a data grid (Gx) and determining the display scale of the X axis; the steps of data source configuration, scanning, and reading; the step of analyzing stored data and correcting the X axis to display the scale, and calculating the quartile of the data in each data grid (Gx) of each scale level; the step of using a quartile graph to display the data. By means of defining a data grid (Gx) to store data, the four display scales of the X axis being interchangeable, and using a quartile graph to display data, the present invention displays the distribution of two-dimensional data in extremely large-volume data or big data environments, and provides interactive functionality. The present invention also provides a visualization system based on quartile graph display data.

Abstract: A grammar for mapping a first grouping of XML data into a second grouping of XML data and a method for accomplishing same to incorporate the first grouping into the second grouping. The grammar includes a first rule for computing a first child element attribute and a second rule for computing a second parent element attribute. The first rule and second rule vary according to a production of an element type of the first grouping. The element types include PCDATA, disjunctive, conjunctive and Kleene star, each having a unique rule set for defining inherited and synthesized attributes of the parent and child elements. The method includes the step of executing a mapping of a first grouping having at least one parent element and a set of corresponding child elements into a second grouping in accordance with the grammar rules based on the production of the element type.

Abstract: Methods and apparatus are provided for evaluating XPath filters on fragmented and distributed XML documents. According to one aspect of the invention, a method is disclosed for evaluating a query over a tree having a plurality of fragments distributed over a plurality of sites. The method comprises the steps of identifying the plurality of sites storing at least one of the plurality of fragments of the tree; providing the query to the plurality of identified sites, wherein each of the identified sites partially evaluates the query against one of more fragments of the tree stored by the respective site; obtaining partial results from the plurality of identified sites; and composing the partial results to compute a result to the query. The query may be, for example, a boolean XPath query. The method can be performed, for example, by a coordinating site that stores a root fragment of the tree.

Abstract: Methods and apparatus are provided for propagating functional dependencies with conditions. Propagation covers are computed using an SPC view of a dataset, wherein the SPC view comprises selection, projection and Cartesian product operations. Selection operations are processed to extract equivalence classes. Cartesian product operations are processed to obtain a renamed set of the plurality of conditional functional dependencies, that have attributes appearing in the SPC view. Domain constraints from the equivalence classes are applied to the renamed set to remove attributes not in the SPC view. Projection operations are processed using a reduction by resolution procedure to identify inferences that can be propagated to the SPC view from the conditional functional dependencies having attributes that do not appear in the SPC view. Domain constraints of the equivalence classes are converted to conditional functional dependencies; and a minimal cover of the SPC view is determined.