1500 results about "Relvar" patented technology

Improved method of and apparatus for joining and aggregating data elements integrated within a relational database management system (RDBMS) using a non-relational multi-dimensional data structure (MDD). The improved RDBMS system of the present invention can be used to realize achieving a significant increase in system performance (e.g. [deceased] decreased access / search time), user flexibility and ease of use. The improved RDBMS system of the present invention can be used to realize an improved Data Warehouse for supporting on-line analytical processing (OLAP) operations or to realize an improved informational database system or the like.

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 provides a system and method for dynamic object-driven database manipulation and mapping system which relates in general to correlating or translating one type of database to another type of database or to an object programming application. Correlating or translating involves relational to object translation, object to object translation, relational to relational, or a combination of the above. Thus, the present invention is directed to dynamic mapping of databases to selected objects. Also provided are systems and methods that optionally include caching components, security features, data migration facilities, and components for reading, writing, interpreting and manipulating XML and XMI data files.

An XML-based framework (30) for developing software applications (12) includes a document manager (32) to manage activities relating to one or more XML-based data documents (34) associated with an application (12), each data document (34) modeling data associated with the application (12) and representing relationships between the data document (34) and one or more other data documents (34). The framework (30) includes a rules manager (36) to manage rules (38) specifying logic for handling notifications associated with XML-based action documents (34) received at the application (12), the notifications requesting actions involving data documents (34). The framework (30) also includes an operations manager (40) to manage the execution of transactions involving data documents (34) based on operations (42) defined for the application (12) during its development. The framework (30) provides a generic XML-based transaction engine, the application (12) being one of a plurality of distributed applications (12) each being an instance of the generic transaction engine. An electronic marketplace with a distributed transaction layer may include such a plurality of distributed applications (12), where the applications (12) interact with one another using the distributed transaction layer (14) to conduct electronic commerce within the marketplace.

An improved command handler (and database system utilizing the improved command handler) interfaces to a datastore storing item data for a plurality of items and bi-directional modifier data, corresponding to a relation between at least one first item and at least one second item, that represents first text characterizing semantics of a relationship of the at least one first item to the at least one second item, and represents second text characterizing semantics of a relationship of the at least one second item to the at least one first item. The command handler operates, in response to receiving a first-type query command that specifies at least one given item, to access the datastore to identify i) at least one related item that is related to the given item, and identify ii) either the first text or the second text characterizing semantics of the relation between the given item and the at least one related item. The command hander returns i) data corresponding to the at least one related item; and ii) data corresponding to the identified first text and or second text characterizing semantics of the relation between the given item and the at least one related item. Preferably, the data returned in response to the first-type query command identifies the at least one related item. and identifies the first text or second text characterizing semantics of the relation between the given item and the at least one related item. In addition, the command handler preferably supports additional commands that retrieve from the datastore information related to specified objects, object types, and relations.The command handler (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 command handler (and database system) provides an efficient mechanism to query the organization of the data elements (and the relationships therebetween) stored and accessed in such software applications, in a manner that efficient and readily adaptable to client-server database systems or other distributed database systems.

The invention relates to a system and method for creating, editing, using one or more multi-relational ontologies and applying knowledge contained in one or more ontologies to one or more applications. The system may extract concepts, relationships, assertions and other information from a domain specific corpus of documents. The system may also create rule-based assertions that are then curated and published as one or more ontologies that can be used in various ways.

A robust method to compress relations close to their entropy while still allowing efficient queries. Column values are encoded into variable length codes to exploit skew in their frequencies. The codes in each tuple are concatenated and the resulting tuplecodes are sorted and delta-coded to exploit the lack of ordering in a relation. Correlation is exploited either by co-coding correlated columns, or by using a sort order that can leverage the correlation. Also presented is a novel Huffman coding scheme, called segregated coding, that preserves maximum compression while allowing range and equality predicates on the compressed data, without even accessing the full dictionary. Delta coding is exploited to speed up queries, by reusing computations performed on nearly identical records.

According to the present invention there is provided a method for establishing a data warehouse capable from a plurality of source databases including at least one relational database and at least one object-oriented database, comprising the steps of: integrating the schema of said plurality of source databases into a global schema, including resolving semantic conflicts between said source databases, and establishing a frame metadata model for describing data stored in said local databases, said frame metadata model including means for describing any constraints developed during schema integration and further including means for describing relationships between data stored in local object-oriented databases.

A software system automatically and dynamically generates a fully functional user interface (UI) based upon, and connected directly to, an underlying data model (as instantiated within a relational database management system (RDBMS)). The UI derives from an automated interrogation of the RDBMS, and comprises all mode displays (e.g., browse, search, edit, add) for all tables, and a full complement of mechanisms—integrated directly into the mode displays—for representing, navigating, and managing relationships across tables, regardless of the complexity of the underlying RDBMS schema. It utilizes a hierarchical “context stack” for suspending the working state of a particular table while “drilling down” to work with related-table information and return relevant changes to the base table. The embodiment further provides methods to enhance and extend the internal representation of table structures, constraints, relationships, and—special requirements (“business rules”) for improved revelation of the schema structure through external interrogation.

The TABLE function mechanism available in a RDBMS is used to integrate RDF models into SQL queries. The table function invocation takes parameters including an RDF pattern, an RDF model, and an RDF rule base and returns result rows to the SQL query that contain RDF triples resulting from the application of the pattern to the triples of the model and the triples inferred by applying the rule base to the model. The RDBMS includes relational representations of the triples and the rules. Optimizations include indexes and materialized views of the representations of the triples, precomputed inferred triples, and a method associated with the TABLE function that rewrites the part of the SQL query that contains the TABLE function invocation as an equivalent SQL string. The latter technique is generally applicable to TABLE functions.

The TABLE function mechanism available in a RDBMS is used to integrate RDF models into SQL queries. The table function invocation takes parameters including an RDF pattern, an RDF model, and an RDF rule base and returns result rows to the SQL query that contain RDF triples resulting from the application of the pattern to the triples of the model and the triples inferred by applying the rule base to the model. The RDBMS includes relational representations of the triples and the rules. Optimizations include indexes and materialized views of the representations of the triples, precomputed inferred triples, and a method associated with the TABLE function that rewrites the part of the SQL query that contains the TABLE function invocation as an equivalent SQL string. The latter technique is generally applicable to TABLE functions.

A method and system for persisting an object in a relational database schema by creating a new relational table at application program run-time for each class of objects to be persisted. The method may generate a schema map object for each class of objects to be persisted. The schema map object may be generated in response to the first transaction in which an object of a certain class is to be persisted and remains in memory for persisting, querying, restoring or deleting objects of that class. The schema map object determines the fields of each class of objects to be persisted, defines one or more columns in the table in accordance with the data types of the fields, and controls the passing of data between the table and the object fields.

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.

The invention discloses a distributed database synchronization system which comprises database nodes and a management node, wherein the database nodes outwards provide distributed database access, updating and inquiry services on the basis of Web services; all the database nodes have no master-slave difference, and are independently in charge of providing distributed database services; all the database nodes have no direct relationships and periodically obtain a synchronization configuration table and a network member configuration table from the management node, and establish a synchronization relationship with other database nodes; and a Web-service-based synchronization module is adopted in all the database nodes, the traditional database is encapsulated by using the synchronization module for providing one group of API (Application Program Interface) function for the outside. Data transmission is carried out by using the Web-service-based SOAP (Simple Object Access Protocol). The distributed database synchronization system can adapt to various complex heterogeneous networks, and can be used for solving the problems of incompatibility and incapability of mutual synchronization of data among various traditional databases.

A method for publishing relational data as XML by translating XML queries into queries against a relational database. Conversion of the relational database into an XML database is not required. Each relational table is mapped to a virtual XML document, and XML queries are issued over these virtual documents. An XML query is parsed and transformed into a language-neutral intermediate representation, which is a sequence of operations describing how the output document is derived from the underlying relational tables. The intermediate representation is then translated into an SQL query over the underlying relational tables. The intermediate representation is also used to generate a tagger graph, which the tagger runtime ‘walks’ to generate the tagged, structured XML output. Each of the nodes of the tagger graph are operators which perform processing on the results of the SQL query. The SQL query is executed, and the SQL query results are then provided to the tagger. The tagger runtime applies the operators of each node to the inputs at that node to produce the structured XML document as a query result, guided by the structure of the tagger graph.

A repository contains multiple versions of an object, and any version of the object can be modified by a user, as and when necessary. A table for one object (“first object”) that is contained in another object (“second object”) has at least two columns, namely one column for a minimum version of the second object and another column for a maximum version of the second object. If a number of versions of the first object are responsive to a query, then one version of the first object is selected if a version of the second object that is responsive to the query happens to be in the range defined by the just-described minimum version number and the maximum version number. Depending on the embodiment, the second object can be an immediate parent of the first object, or can be an ancestor (also called “first class object”) of the first object that is not contained in any other object. In some embodiments, one or more attributes of the first object are stored in a first table along with a unique identifier and a version number. In addition, information on relations of the first object to other objects as well as an identity of a configuration (to which the current version of the first object belongs) are stored in a second table. Therefore, a pair of tables are used for each object, so as to decouple information that defines an object from information on relationships of the object. If a change happens in just the relationship of an object then no change is made to the table containing the definition of the object. Similarly, if a change happens in just the definition of the object, then no change is made to the table containing the relations of the object. Moreover, when a change happens to an object, if the object has a number of ancestors and decendants only an immediate parent of the object is updated, thereby to eliminate a versioning chain reaction (i.e. other objects are not affected).

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.

An un-indexed, partitioned temporary table and an exchange table are used in the inferencing of semantic data in a relational database system. The exchange table has the same structure as a semantic data table storing the semantic data. In the inferencing process, a new partition is created in the semantic data table. Inference rules are executed on the semantic data table, and any newly inferred semantic data generated is added to the temporary table. Once no new data is generated, the inferred semantic data is copied from the temporary table into the exchange table. Indexes that are the same as indexes for the semantic data table are built for the exchange table. The indexed data in the exchange table is then exchanged into the new partition in the semantic data table. By use of the un-indexed, partitioned temporary table, incremental maintenance of indexes is avoided, thus allowing for greater efficiency.

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.

The present invention provides a system and method for dynamic object-driven database manipulation and mapping system which relates in general to correlating or translating one type of database to another type of database or to an object programming application. Correlating or translating involves relational to object translation, object to object translation, relational to relational, or a combination of the above. Thus, the present invention is directed to dynamic mapping of databases to selected objects. Also provided are systems and methods that optionally include caching components, security features, data migration facilities, and components for reading, writing, interpreting and manipulating XML and XMI data files.

An authoring tool (or process) to facilitate the performance of an annotation function and an indexing function. The annotation function may generate informational annotations and word annotations to a database design schema (e.g., an entity-relationship diagram or “ERD”). The indexing function may analyze the words of the annotations by classifying the words in accordance with a concordance and dictionary, and assign a normalized weight to each word of each of the annotations based on the classification(s) of the word(s) of the annotation. A query translator (or query translation process) to (i) accept a natural language query from a user interface process, (ii) convert the natural language query to a formal command query (e.g., an SQL query) using the indexed annotations generated by the authoring tool and the database design schema, and (iii) present the formal command query to a database management process for interrogating the relational database.

Methods and apparatus for integrating relational and hierarchical data, schema definitions, and queries in a data processing system are provided. It is determined if one or more schema definitions or one or more query expressions are provided as input to the data processing system. The one or more schema definitions are converted into an intermediate schema language component of an intermediate data language when one or more schema definitions are provided. The one or more query expressions are converted into an intermediate query language component of the intermediate data language when one or more query expressions are provided. The intermediate schema language component or the intermediate query language component is compiled in an intermediate data language processing engine into a run-time representation in accordance with a relational-hierarchical analysis.

The invention belongs to the technical field of industrial big data application, and particularly relates to an industrial big data multidimensional analysis and visualization method based on a JSON document structure. The method comprises the following steps: by taking JSON as a basic carrier of data, constructing an industrial data mart in parallel by utilizing Spark and ElasticSearch through configuring a relational database and a file system data source and defining data conversion and data cleaning operations; configuring an overall process of data analysis in a graphical mode to construct an analysis data set of a multi-dimensional structure, and repeated association operation on massive data being avoided; and for a specific data analysis scene, customizing each dimension calculation index of the data analysis report in a visual dragging mode based on a pre-constructed multi-dimensional analysis data set, and generating an interactive graphic analysis report. According to the method, the JSON document format is used as a carrier of basic data, and the advantages of the JSON document format in storage and analysis are utilized, so that multi-dimensional analysis structure modeling and user-defined interactive analysis are more convenient and efficient.

An authoring tool (or process) to facilitate the performance of an annotation function and an indexing function. The annotation function may generate informational annotations and word annotations to a database design schema (e.g., an entity-relationship diagram or “ERD”). The indexing function may analyze the words of the annotations by classifying the words in accordance with a concordance and dictionary, and assign a normalized weight to each word of each of the annotations based on the classification(s) of the word(s) of the annotation. A query translator (or query translation process) to (i) accept a natural language query from a user interface process, (ii) convert the natural language query to a formal command query (e.g., an SQL query) using the indexed annotations generated by the authoring tool and the database design schema, and (iii) present the formal command query to a database management process for interrogating the relational database.

A secondary index search in a relational database system compares primary key selection criteria against a primary key value stored in a secondary index record that satisfies secondary key selection criteria instead of searching a primary index for a primary key value that satisfies the primary key selection criteria.