178 results about "Relation (database)" patented technology

A system and method lets a user create or import ontologies and create databases and related application software. These databases can be specially tuned to suit a particular need, and each comes with the same error-detection rules to keep the data clean. Such databases may be searched based on meaning, rather than on words-that-begin-with-something. And multiple databases, if generated from the same basic ontology can communicate with each other without any additional effort. Ontology management and generation tools enable enterprises to create databases that use ontologies to improve data integration, maintainability, quality, and flexibility. Only the relevant aspects of the ontology are targeted, extracting out a sub-model that has the power of the full ontology restricted to objects of interest for the application domain. To increase performance and add desired database characteristics, this sub-model is translated into a database system. Java-based object-oriented and relational application program interfaces (APIs) are then generated from this translation, providing application developers with an API that exactly reflects the entity types and relations (classes and methods) that are represented by the database. This generation approach essentially turns the ontology into a set of integrated and efficient databases.

The present invention relates to the usage pattern, commonly found in many software applications, of defining sets of objects based on object attributes. A specifically designed set definition language for defining sets, called SDL, is described and a software system that implements this language efficiently on top of a standard relational database management system (RDBMS) is presented. The unique features of the SDL language are the implicit constraints that are enforced on the relational data that belong to the objects. Unique to the SDL system is also the logical metadata of dimensions that enables the SDL system to enforce these constraints across relations. The SDL system utilizes several optimization techniques to enable efficient implementation on top of RDBMS. It is also shown how the SDL language and the SQL language can be merged with bidirectional inlining using syntactic gates. Query composition tools are also described that facilitate the creation of SDL expressions.

A method (and corresponding database system) for displaying in a view window information characterizing semantics of relations between objects. For each given relation between at least one subject object and at least one direct object, bi-directional modifier data is stored that represents first text characterizing semantics of a relationship of the at least one first object to the at least one second object, and represents second text characterizing semantics of a relationship of the at least one second object to the at least one first object. In response to predetermined user input associated with an object node displayed in the view window, a set of relations whose at least one subject object or at least one direct object is associated with the object node is identified. For at least one relation in the set of relations, the view window is updated to include a second node comprising a graphical representation of: the first text of the given relation in the event that the given object is a subject object in the given relation, or the second text of the given relation in the event that the given object is a direct object in the given relation. The second node may be a relation node associated with a given relation, or a mixed node associated with a relation-type pair. In response to predetermined input with a second node, the second node may be expanded to identify and display one or more object nodes (identifying direct object(s) of relations derived from expansion of a subject object associated therewith or identifying subject object(s) of relations derived from expansion of a direct object associated therewith). Preferably, this expansion routine is recursive in nature.The method (and database system) of the present invention may be used in a wide assortment of software applications, including enterprise applications (such as e-business applications, supply chain management applications, customer relationship management applications, decision support applications), the file system in operating systems, web browsers, e-mail applications and personal information management applications. Importantly, the method (and database system) provides an easy, user friendly and efficient mechanism to define, view and query the organization of the data elements (and the relationships therebetween) stored and accessed in such software applications, in a manner that conveys the real-world meaning of such relationships.

A database querying system to facilitate the retrieval of desired data from a database including information categories, the system including a plurality of object data items categorized in one information category and a plurality of object data items categorized in another information category. A processor assembly responsive to a user query is also provided and is structured to identify the desired data from the user query. A relationship category defined by relationships between the object data items of the information categories is further provided, the user query including a relationship identifier corresponding the relationship category so as to simplify syntax of the user query. Interpretation of relational-database query and data manipulation languages against non-relational schemas, including conceptual, semantic, object-relational, or object-oriented database schemas, by regarding the schemas as representing virtual relational databases with every class replaced by a virtual table comprised of all the attributes reachable from the class by a chain of relations. The interpretation allows concise and simple querying of non-relational and relational databases in a languages originally intended only for relational databases. The system further provides for wrapping of a relational database into a semantic conceptual schema so as to allow formulation of queries in SQL against the wrapping schema, reducing the size of SQL queries.

The invention relates to a method and system for migrating relational data to the HBbase. The system comprises a relational data base, an HBase database, an SQL analysis module, a query conversion module and a data mode management module. As a mapping relation list is designed in the HBase database, a mapping relation of mode information in an original relation database and mode information in the HBase database is stored and mode information of a data form in the original relation database the is completely reserved, a mapping manner can be flexibly configured and more options are provided for users. Due to the efficient data organizing manner of the HBase, the access performance is greatly improved and the storage space is saved. Meanwhile, the data export function is provided and data interaction with other sub-systems is achieved. In addition, the data query function supports SQL query and converts an SQL query statement into a query statement of the HBase database, so that the users can transit to the HBbase database more smoothly.

Described herein are optimizations and execution strategies for spreadsheet extensions to SQL. The partitioning of data, as specified in a spreadsheet clause, provides a way to parallelize the computation of spreadsheet and to provide and improve scalability. Even if the partitioning is not explicitly specified in the spreadsheet clause, the database optimizer can automatically infer the partitioning in some cases. Efficient hash based access structures on relations can be used for symbolic array addressing, enabling fast computation of formulas. When rewriting SQL statements, formulas whose results are not referenced in outer blocks can be removed from the spreadsheet clause, thus removing unnecessary computations. The predicates from other query blocks can be moved inside query blocks with spreadsheets clauses, thus considerably reducing the amount of data to be processed. Conditions for validity of this transformation are given.

A method and system for managing data and organizational constraints is provided. Data is collected and stored as records in a database and multi-dimensional matrices known as parameters are associated with each of the sets of records. The parameters are then processed using various formulae and functions and the results of the processing are kept separate from the parameters themselves allowing for a flexible and fast response to any change in any of the parameters. The dimensions of each parameter are defined to include zero or more properties configured to access the multi-dimensional matrices and each parameter is defined in relation to each of the dimensions of the parameter. The set of dependencies among the parameters form part of a large constraint propagation network so that any change to a value of one of the parameters will be propagated throughout the network.

A spring layout system or the like is then executed to nodes (A to U in FIG. 10) and edges (e1 to e15) defined in a binary relation model database to thereby automatically draw a graph. Nodes are replaced by rings and edges are replaced by springs, and a layout is calculated so that forces of the springs (a repulsive force and an attractive force) acting on the rings can realize a minimum energy state of the system. Node coordinate positions are determined based on the calculated forces, and the nodes and the edges are drawn in the form of a graph. The “repulsive force” is a force generated between every pair of nodes present within a certain distance, and the nodes are dispersed and overlaps of nodes are removed by the repulsive force. The “attractive force” is a force generated between every pair of nodes present within the certain distance. The nodes connected to each other by edges by the attractive force are closer to each other. Therefore, relevant nodes can be made closer and easily discriminated from irrelevant nodes.

The invention provides an IEC 61850 universal database information model and a design method for an interface of the IEC 61850 universal database information model. The database model consists of an information model, an equipment model and an application model, wherein the information model obeys IEC 61850; the equipment model obeys IEC 61970; the information model comprises engineering instantiation configuration information of intelligent electronic equipment; and the engineering instantiation configuration information comprises a model type database table, a data type database table, a template type database table and a communication type database table. By a database design with three layers of frameworks, so that a standard model is multiplexed; a database can be automatically established by directly adopting a security coding device (SCD) model file, and an incidence relation among the information model, the equipment model and the application model can be automatically constructed; therefore, the engineering debugging period and the maintenance cost can be obviously reduced; the database information model based on the universal data type is constructed; a search mode quoted by a data object based on a character string format is designed; moreover, an open access interface is supplied; and the IEC 61850 universal database information model is suitable for different database platforms.

The invention relates to a modeling method of a data logic model utilizing public conceptual sets. A set of symbolic languages supporting fast building of the data logic model is built. The modeling method comprises modeling elements such as relationship set and entity, basic attributes, conceptual attributes, and composite attributes, provides stronger semantic expression ability than traditional E-R (entity-relation) diagram, and can supports building of data models of various complex information systems. By using the public conceptual sets, building speed of the data models is increased, iterative development is avoided, data standardization is facilitated, visualized support systems are provided to building of logic models, the data models designed by a graphical interface can be exported into international XMI (XML metadata interexchange) format so as to be compatible with other model designing tools, building of the data models of the information systems is more convenient and faster, designing and implementation of a database mode are simplified greatly, and visualized fast building of the data models by developers during engineering is facilitated.

The invention discloses a statistical representation method supporting free combination and nesting of data in a relational database. The process comprises the steps of source table customization, statistical table customization and output customization. In the step of defining a statistical table by the adoption of the representation method, a database is selected, wherein the program display database contains all tables and fields, a user selects needed tables and fields, a program prompts the user to confirm the incidence relation among the tables, and a source table can be generated after the user clicks for determination; the user can organize various statistical tables according to his / her own demands with the source table. According to the representation method, by decomposing the statistical demands of the user, the method can be applied to realization of statistical table components and has unprecedentedly powerful functions, almost any statistical table can be realized by the adoption of the statistical representation method, the method can be applied to realization of a statistical table system, the statistical table customization process turns into a simple and clear process, and the method supports direct statistical analysis on arbitrary relevant data in the database by the user.

Described are systems and methods relating to database query optimization and query cost estimation. The approach is described in the context of searching balanced and semi-balanced tree indexes such as B-trees, B+ trees, and R-B trees. The described approach may be used for both simple and composite queries, and the described approach may be used for relational queries, i.e., where a variable is less than or greater than a certain value and the database is being used to find the set of records that satisfy the relation. Further, the described approach may be used for generalized N-ary tree queries and cost estimations.

The invention provides a database query method and device and a computer readable storage medium, and the database query method comprises the following steps: S1, obtaining user input and selecting ato-be-queried database; s2, converting user input into SQL statements, and performing database query to obtain a data table; s3, converting the user input and the data table into a visual chart; and S4, displaying the visual chart. According to the database query method and device and the computer readable storage medium, the data query and data analysis efficiency of a user can be improved; whenthe visual form is generated, the use of all data table data is avoided, some sensitive information in the data is prevented from being leaked, and the data security is ensured, so that the data processing speed of the model is increased; and meanwhile, the relation between the modules is enhanced, so that the model can fully understand the input information.

Described herein are optimizations and execution strategies for spreadsheet extensions to SQL. The partitioning of data, as specified in a spreadsheet clause, provides a way to parallelize the computation of spreadsheet and to provide and improve scalability. Even if the partitioning is not explicitly specified in the spreadsheet clause, the database optimizer can automatically infer the partitioning in some cases. Efficient hash based access structures on relations can be used for symbolic array addressing, enabling fast computation of formulas. When rewriting SQL statements, formulas whose results are not referenced in outer blocks can be removed from the spreadsheet clause, thus removing unnecessary computations. The predicates from other query blocks can be moved inside query blocks with spreadsheets clauses, thus considerably reducing the amount of data to be processed. Conditions for validity of this transformation are given.

The invention discloses a dynamic hierarchical integrated data accessing method capable of guaranteeing semantic correctness and aims to solve the problem about how to provide data access with completely correct semantics under condition of integration of large-scale relation databases. The technical scheme includes that the dynamic hierarchical integrated data accessing method includes firstly, expanding to obtain a description logic subset DL-Lite, then layering the ontology TBox on the basis of the description logics, and establishing LAV (local as view) mapping and O-GAV (object-global as view) mapping between the relation database and the ontology; expanding and rewriting query request by means of SuperRef algorithm according to the T<Q> in layering of the TBox, and establishing a dynamic ABox A<Q> according to query results; and finally, refining the ABox A<Q>, and feeding back query response results. The dynamic hierarchical integrated data accessing method can provide data with the completely correct semantics for users and meet the requirement for correctness of the semantics in integrated data access. Further, calculating complexity can be reduced and expanding, query and rewriting efficiency can be improved.

The embodiment of the invention discloses a DB2 database data synchronization method, device and system. The method comprises the steps of obtaining a data synchronization request for a to-be-synchronized source library and a corresponding to-be-synchronized target library; if the request is a full-amount synchronization request, performing full-amount synchronization on the target library according to the data of the source library; if the request is an incremental synchronization request, acquiring log data generated by the source library in real time, analyzing the log data, and performingincremental synchronization on the target library according to an analysis result. According to the method, full-amount and incremental synchronization of the DB2 database can be realized, and the incremental synchronization mode of the method does not invade the source library and does not influence the service; besides, by expanding the cluster, sub-library and sub-table scene synchronization and sub-library and sub-table synchronization monitoring and coordination can be achieved, mapping relation configuration is conducted on the source library and the target library through middleware, data synchronization from the source library M to the target library N can be achieved, and more complex synchronization scenes are met; furthermore, the full-quantity and incremental synchronization process of the method supports breakpoint resume.

The invention provides an AST-based relational database SQL table relation analysis and display method, and belongs to the technical field of web, java and databases. According to the method, an abstract syntax tree AST of sql is generated through syntax and lexical analysis of sql, and then the generated abstract syntax tree AST is accessed and traversed to extract tables and fields, so that analysis of table relationships of sql statements of the relational database and analysis of subordinate field relationships are realized. The table relationship and the field relationship are visually displayed in a drawing form through Mxgraph. And the complexity of association analysis is further reduced, and the compatibility of the system is improved.

The invention provides an event portrait-oriented text analysis method for a dialogue system. The event portrait-oriented text analysis method comprises the following steps of: 1, extracting an event relationship; 2, event extraction and structuring; 3, event similarity calculation and fusion; 4, event trigger word extraction and argument extraction. According to the method, the method for constructing the event graph is fully researched, the logic structure relation between events is described by adopting a knowledge graph structure, and meanwhile, in order to describe the events more clearly, the multi-dimensional attributes of the events are portrayed. The invention provides a system structure constructed by a affair graph. The structure comprises text corpus collection, event relation extraction template construction, event extraction and structuring, event similarity calculation and fusion, event trigger word extraction and argument extraction model construction, event relation pair construction and graph database storage. In addition, by utilizing the system structure, a sequential affair map, a causal affair map, a conditional affair map, a turning affair map and a concurrent affair map are constructed.

The invention discloses an automatic generation method of a product description text based on a pre-training model. The method is characterized in that a framework pre-training model method is adopted, an auxiliary database and a pre-trained BERT model weight are introduced, a product description text is automatically generated according to given product function class attribute characteristics. The method specifically comprises the steps of constructing a dictionary, a co-occurrence relation library and a retrieval database, and generating a model and a text. Compared with the prior art, themethod has the advantages that a section of product description text which is smooth, readable and rich in information amount is generated according to the given product function type attribute characteristics, the three problems of small data size, generated text length control and function type attribute characteristic controllability are effectively solved, and the generation quality and text diversity of the product description text are improved.

The invention discloses a multi-source data and time sequence processing method and device for construction of an industry knowledge graph. The method comprises the following steps: constructing an ontology layer of the knowledge graph, wherein the ontology layer comprises ontologies, ontology attributes and an ontology relation; extracting entities and entity attributes from multiple data sources, and conducting inconsistency check on the entities; conducting inconsistency check on the entity attributes of all the entities, wherein an entity relationship between the entities inherits the ontology relationship between the ontologies corresponding to the entities; and establishing indexes of a knowledge graph database and a time sequence database. The method has the advantages that throughthe uniqueness of a standard naming table and the relational database, entity conflict resolution accuracy is ensured to the greatest extent; by utilizing the advantage that the knowledge graph has the ontology layer, accurate classification of the entity attributes is realized by establishing similar labels, and fusion efficiency is effectively improved; and the problem that the knowledge graph is difficult to process time sequence data is solved by establishing indexes between knowledge graph database ontologies and a time sequence database form.

The invention discloses a construction method and application of an SQL statement generation model of a natural Chinese language. The construction method comprises the following steps: S1, constructing the SQL statement generation model; and S2, taking the Chinese natural language question collected in the training set and the related database mode as input, taking the corresponding correct SQL statement as output, and training the SQL statement generation model by minimizing the difference between the SQL statement generated by the SQL statement generation model and the correct SQL statement. According to the invention, by combining type information of different data columns, an alignment relation and an implicit anaphora relation between a Chinese natural language question and a database mode are captured, and an explicit definition relation of the database mode and a link relation between the natural language question and the database mode are expressed in a directed graph mode; and by comprehensively considering the characteristics between the unstructured data and the structured data, the semantic features and the relationship features are combined for joint coding, so that the accuracy of the SQL statement generation model is greatly improved.

A method of satisfying a database query includes evaluating certain joins on a per-segment basis. An expression tree is produced for the query, and the expression tree is evaluated to identify joins whose operands are two instances of the same relation and whose join predicate conjunctively includes an equality comparison between two instances of the same column. When such a join is identified, it may be evaluated by segmenting the operand relation according to the columns that are compared for equality in the predicate. The join is then evaluated by performing the join operation separately on each segment. Segments may be spooled separately, thereby exploiting the efficiencies obtained by spooling even where the entire relation is too large to fit in the spool. Execution iterators are provided for spooling successive segments and for applying the join to the spooled segment.

The invention discloses an entity relationship-based feature construction method, and the method comprises the steps: obtaining a main table in a relational database and a plurality of auxiliary tables associated with the main table, enabling the main table to be provided with a main key column and a plurality of external key columns, enabling each entry in the main table to correspond to one entity, and enabling the auxiliary tables to be associated with the main table through external keys of the main table; constructing a directed inter-table relational graph by taking the main table and the auxiliary table as nodes and taking the incidence relation between every two of the main table and the auxiliary table as an edge; taking a node corresponding to the main table as a starting point,and traversing the inter-table relation graph to acquire inter-table relation data of each entity in the main table and the corresponding auxiliary table; and performing conversion calculation on theinter-table relationship data based on a preset conversion function to construct features corresponding to each entity in the main table. The invention further discloses a feature construction deviceand equipment based on the entity relationship and a storage medium. According to the method, the feature data is acquired based on the inter-table relational graph, and the features of the data can be represented from multiple dimensions on the whole, so that the modeling success rate is improved.

The invention relates to a database record data query system based on record logical representation. The database record data query system comprises a logical record definition and mapping component, a named relation and limited class defining component, a logical record query component, a record relation expansion sub-process and a record database. Several thoughts and methods of logical representation are used for data query of a common database without using the complicated implementation technology of the logical representation. A user of data can define logical records aiming at the data in the database according to self needs, and converts record logical representation record query conditions or commands into database query SQL (structured query language) statements by corresponding relations between logical records and database records; and the user can self-define record named relations and record limited classes by recording named relation definition rules, and uses record naming and the record limited classes in record query condition expressions or commands to enable the expressions of the record query conditions to be simpler.

The invention relates to a method for generating an addition, deletion, modification and check service interface based on database metadata. The method specifically comprises the following steps: step 1, preparing data in the earlier stage of the metadata; 2, determining a table Id corresponding to the main table according to the UUID and the data table name; and step 3, generating a database metadata addition, deletion, modification and check API interface. The technical scheme has the advantages that the method adapts to scenes with complex inter-table relations; the method adapts to data structure change scenes; the user permission can be controlled by configuring the attribute of the API, the safety of the interface is ensured, the workload of manually and repeatedly compiling the SQL statement is reduced, and the development efficiency is improved.

The invention relates to a metadata generation system based on multi-source data. The system comprises an original database, a metadata database, a mapping table database, a processor and a memory in which a computer program is stored, the original database is used for storing original data acquired from N data sources {P1, P2,... PN}, Pn is the nth data source, and the value range of n is 1-N; the meta-database is used for storing a metadata record, the metadata record comprises M metadata fields {D1, D2,... DM}, Dm is the name of the mth metadata field of metadata, and the value range of m is 1-M; and the mapping table database is used for storing a mapping table Rn corresponding to each data source Pn, and the Rn is used for storing a mapping relation between an original data field of the Pn and {D1, D2,... DM}. The multi-source data can be quickly and accurately converted into the metadata with the same data structure, and the information extraction efficiency and accuracy of the multi-source data are improved.

The invention discloses a knowledge graph construction method and device, a computer system and a readable storage medium, and the method comprises the steps: obtaining normal basic information from adatabase, extracting keywords of the normal basic information, and carrying out the duplicate removal of the keywords to obtain normal information elements; mining two normal information elements with a normal directed association relationship in each normal information element, and determining the two normal information elements as normal directed association features; mining two normal information elements with a normal undirected association relationship in each normal information element, and identifying the two normal information elements as normal undirected association features; and according to the normal directed association features and the normal undirected association features, constructing a knowledge graph used for expressing association relationships among the normal information elements. According to the method, the knowledge graph reflecting the sufficient unnecessary condition relation and the sufficient necessary condition relation between the normal information elements is constructed, deep mining of the data relation is achieved, and an institution can identify risks of different area angles through the knowledge graph.

The invention discloses a large-scale knowledge graph storage scheme based on a distributed key value library. A "KG over SQL" unified storage scheme or a "KG over KV" unified storage scheme is adopted; the unified storage scheme of "KG over SQL" comprises the following steps: reading knowledge graph data; extracting metadata in the mapping knowledge domain, and generating a corresponding SQL statement; extracting data in the knowledge graph, storing the data in a data structure, and generating a corresponding SQL statement; executing an SQL statement through an external SQL interface of the Cockroach DB database, and establishing a relation table; mapping the data in the relation table into a key value pair form by using an original data coding mapping scheme in a Cockroach DB database, and storing the data in a Cockroach DB bottom layer; By means of the "KG over KV" unified storage scheme, knowledge graph data are read, a knowledge graph is converted into a graph containing index nodes, index node graph data are stored in a data structure, and the data are mapped into a key value pair form through an optimized data coding mapping scheme and stored in a Cockroach DB bottom layer. According to the method, efficient data storage compatible with the RDF graph model and the attribute graph model can be realized.

Pertinent natural language authority documents are translated into corresponding statements in a system of predicate logic which statements are encoded into relations in a programming language. The authority documents are indexed into an electronic database to facilitate subsequent searching. User-entered query terms and / or query terms derived from pertinent prose are obtained, specifying at least one of a tax problem and an accounting problem; based on same, the electronic database is searched to locate applicable authority(ies). A comparison and inference engine executing on at least one hardware processor is activated to apply applicable relations in the programming language to a problem ascertainable from the query, to obtain a conclusion by applying derivation rules in the system of predicate logic. The conclusion is presented to a decision maker.