249 results about "Foreign key" patented technology

A computerized method for representing a data record comprising: querying a data source to obtain data selected from the group consisting of a data element in a record, and metadata concerning the record; presenting in a display a record handle for manipulation of the record; presenting in the display a data item wherein the data item is a list of data items or a reference to another record; and, optionally, presenting on the display the metadata above the data item. In some embodiments, the method includes the step of retrieving one or more heterogeneous records from a plurality of databases for display and manipulation. The invention is also a grid control programmed to implement a disclosed method and is a computer-readable medium having computer-executable instructions for performing a disclosed method. The invention links the grid control of the invention with automatic query generation using hierarchical data schema trees. Both the trees and the grid records represent relational foreign keys as extra reference columns. In the grid control, these reference columns are additional embedded record handles.

A method and system for migrating data between databases is provided. Metadata is obtained from a source database and used to determine the manner in which the data within the source database should be migrated to a target database. The metadata provides a mechanism for structuring queries to retrieve the data within the source database in a generic manner, thereby providing a generic determination of the structure of the data to be migrated. The dependencies among tables in the source database are discovered, thereby providing an order to the migration operations to be performed when migrating the data. This order ensures that the data can be migrated correctly in the presence of referential integrity (foreign key) constraints. In addition, custom mapping operations may be performed during the migration operations so that the data from the source database is modified before writing the data to the target database.

The invention discloses a data partitioning method for a distributed parallel database system. The method comprises the following steps of: establishing a fact table and a dimension table according to the constructed distributed parallel database system; inserting records of the dimension table and the fact table on different nodes according to a partitioning rule; copying the records of the dimension table to the nodes of the fact table; and deleting and updating the data. When a data set or data stream is imported or inserted into the distributed database system in a partitioning way, the relation between tables defined by a database schema can be met on each node, particularly the primary key-foreign key restrictive condition, so the data on each node has local completeness of the data. For the query processing on the connection between the tables by using the primary key-foreign key restrictive condition, the data of each node has the local completeness on the query, so dynamic repartitioning of data between the nodes is not needed; and thus the method has the advantages of preventing time-consuming network transmission of the data, shortening the query response time and improving the query efficiency.

A Relational Database Management System (RDBMS) having any arbitrary structure is translated into a multi-dimensional data model suitable for performing OLAP operations upon. If a relational table defining the relational model includes any tables with cardinality of 1,1 or 0,1, the tables are merged into a single table. If the relational table is not normalized, then normalization is performed and a relationship between the original table and the normalized table is created. If the relational table is normalized, but not by dependence between columns, such as in the dimension table in a snowflake schema, the normalization process is performed using the foreign key in order to generate the normalized table. Once the normalized table is generated, OLAP measures are derived from the normalized relational table by an automated method. In addition, OLAP dimensions are derived from the normalized relational table and the results of the OLAP measures derivation by an automated method according to the present invention. According to an aspect, it is possible to associate a member of a dimension to another member of the same or another dimension. According to another aspect, it is possible to create a new dimension of analysis, the members of which are all the different values that a scalar expression can take on. According to yet another aspect, it is possible to access the various instances of a Reporting Object as members in an OLAP dimension. According to the yet another aspect, it is possible to apply opaque filters or a combination of them to the data that underlies analysis.

A Relational Database Management System (RDBMS) having any arbitrary structure is translated into a multi-dimensional data model suitable for performing OLAP operations upon. If a relational table defining the relational model includes any tables with cardinality of 1,1 or 0,1, the tables are merged into a single table. If the relational table is not normalized, then normalization is performed and a relationship between the original table and the normalized table is created. If the relational table is normalized, but not by dependence between columns, such as in the dimension table in a snowflake schema, the normalization process is performed using the foreign key in order to generate the normalized table. Once the normalized table is generated, OLAP measures are derived from the normalized relational table by an automated method. In addition, OLAP dimensions are derived from the normalized relational table and the results of the OLAP measures derivation by an automated method according to the present invention. According to an aspect, it is possible to associate a member of a dimension to another member of the same or another dimension. According to another aspect, it is possible to create a new dimension of analysis, the members of which are all the different values that a scalar expression can take on. According to yet another aspect, it is possible to access the various instances of a Reporting Object as members in an OLAP dimension. According to the yet another aspect, it is possible to apply opaque filters or a combination of them to the data that underlies analysis.

A processing device generates a relationship view of managed entities in a storage area network based on objects stored in a relational database. Each managed entity (e.g., file system, database, volume, storage device, etc.) in the storage area network has a corresponding managed object stored in the relational database. Generally, managed objects of a particular type are categorized into one or more tables. Such tables are related to one another by foreign key attributes, which represent relationships between types of managed objects (and thus a relationship between corresponding managed entities). Relationships among the managed objects in the relational database may be generally classified as either association or containment. Association identifies a logical relationship between managed objects. Containment identifies groups of managed objects that are logically associated with each other. The processing device uses these identified relationships to generate the appropriate relationship view for a selected managed entity.

The present invention automatically generates a dimensional model from an object model. The relationships in the object model are used to infer foreign key relationships in the dimensional model.

The invention discloses a dynamic recognition method for intelligent substation network device topology based on MAC address matching. The method includes the steps that an corresponding relation table between the IP address / multicasting address of an intelligent electronic device (IED) and the name of the IED is obtained through analyzing an intelligent substation configuration file (SCD), and a corresponding relation table between the IP address / multicasting address of the IED and an MAC address is obtained through analyzing a section data message; an MAC address forwarding table of a switch is obtained through a simple network management protocol (SNMP); the MAC address serving as a foreign key is matched with the two-dimensional table to generate a switch port-IED name table, so that topology recognition of the switch and the connected IED is finished, and graphic displaying is performed. Based on a common topology search method of the switch, the method achieves dynamic recognition of IED topology in a network and helps the operation management level of the intelligent substation network to be improved.

The invention concerns a detection of duplicate tuples in a database. Previous domain independent detection of duplicated tuples relied on standard similarity functions (e.g., edit distance, cosine metric) between multi-attribute tuples. However, such prior art approaches result in large numbers of false positives if they are used to identify domain-specific abbreviations and conventions. In accordance with the invention a process for duplicate detection is implemented based on interpreting records from multiple dimensional tables in a data warehouse, which are associated with hierarchies specified through key-foreign key relationships in a snowflake schema. The invention exploits the extra knowledge available from the table hierarchy to develop a high quality, scalable duplicate detection process.

Techniques for transforming records prior to loading the records into a data warehouse in an efficient manner. In one embodiment, instead of using lookup transformations, a database operation such as an outer join operation is used to transform records stored in a fact staging table to add foreign keys to the records corresponding to the dimension tables that are associated with a fact table in a data warehouse to which the records are to be loaded. Since the outer join operation is memory intensive, a determination is made as to which dimension tables from the multiple dimension tables associated with the fact table are suitable, from a performance perspective, for the outer join operation. Only those suitable dimension tables are outer joined to the fact staging table to add the foreign keys for the outer joined dimension tables to the fact staging table records. Lookup transformations may be used to add foreign keys to the fact staging table records for the non-suitable dimension tables. The transformed fact records with the foreign keys may then be loaded into the fact table in the data warehouse.

One embodiment of the invention employs techniques for providing a default object-relational mapping between persistent data objects (i.e., the objects that represent persistent data from a database) and a relational database. In a Java environment, for example, each entity bean is mapped to a particular database table, and each of the persistent fields within the entity bean are mapped to columns of the database table. Relationships between entity beans are expressed as mappings between primary keys and foreign keys within the database schema. Dependent-value persistent fields may be mapped to multiple columns or to a single column of a special Java type (java.sql.Types. BLOB). In addition, one embodiment of the invention generates a default database schema using the default O / R mapping by executing a series of SQL commands generating the tables and columns.

A computerized system and method for transforming (formatting or aggregating) the results of a query into a hierarchical information stream, such as an extensible Markup Language (XML) data stream is disclosed. A database server receives a query and generates a rowset. A rowset processor, using the mode specified in the query, processes the rowset and query to generate the XML data stream. For the “auto1” mode, the rowset processor transforms a rowset into an XML data stream using primary-foreign key information specified in the query to determine nesting. For the “auto2” mode, the rowset processor transforms a rowset into an XML data stream using table ordering information included in the query to determine nesting. For the “explicit” mode, the rowset processor transforms a rowset into an XML data stream using the explicit organizational information specified in the query. In one embodiment, it is easier for a developer to compose expressions to generate nested hierarchical structures than previous formulations and simpler semantics are provided without implicit hierarchy inference. The syntax of an embodiment of the hierarchical formatting function includes optional arguments including a name option, a root option, map option, namespace options and a null option.

Populating a database, including providing a database having a schema; inferring from the schema dependencies among a fact table and related dimension tables; and inserting, in accordance with the dependencies, rows of data into the fact table and rows of data into the dimension tables. In typical embodiments, inferring dependencies further comprises selecting from metadata describing a schema for the database expressions of dependencies and inserting the expressions of dependencies into a dependency list. In typical embodiments, wherein inserting rows of data further comprises determining whether related dimension data exists for each foreign key in each row of data inserted into the fact table and for each foreign key for which related dimension data does not exist, inserting a row of dimension data into a dimension table related to the fact table through the foreign key.

Call forwarding a telephone number, including tracking recent locations of a user with the user's mobile personal communications device and a wireless telecommunications network; identifying a locale for the user in dependence upon the recent locations and upon historical location records for the user; and forwarding a telephone number in dependence upon the locale. In many embodiments, identifying a locale further comprises comparing historical location records and recent locations, wherein the historical location records are related to the locale through a locale identification field used as a foreign key.

A solution is provided wherein only primary keys are used as meta-data to construct many-to-many relationships between table, resulting in amore robust, efficient database structure. Once tables of user-specific data are bound to the database as meta-data using their primary keys, the system may automatically ensure the handling of the records as related units. This eliminates the traditional heavy-weight dependence on foreign key relationships.

The disclosure describes a method for automating the transformation data for business applications. The method involves a transformation engine using a data map between a set of physical entities corresponding to business objects in a source database instance and a corresponding set of physical entities in a target database instance. The data transformation engine using the data map generates automatically scripts to extract data from the source database instance to a set of intermediate tables, transform the data in the set of intermediate tables, and load the transformed data to the target database instance. The data map may be generated based on one or more of foreign key information and constraint information. The method also considers the dependencies of various business objects on each other and the sequence in which the business objects should be transformed.

Systems and methods for extension of a query language for defining a simple formulation of joins by capturing the semantics of an existing linkage between a plurality of tables, via employing a reference join. Such reference join enables a compiler to exploit existing relationships in a data base, and employ existing knowledge about referential constraints for an unambiguous transformation of the reference join expression into the equivalent INNER JOIN on the columns involved. Accordingly, a simpler query syntax and semantics can be provided to express multi-table join navigation over primary key / foreign key relations, for example.

Instructions are generated to manipulate target objects and relationships in a relational database when a source object having a one-to-many relationship of privately owned type with the target objects is manipulated. To generate instructions, mapping meta-data is used which contains information as to how object classes of the object model map to tables in the database and how relationships map to foreign keys.

Systems and methods consistent with the invention may include generating, via a processor, an entity relationship model to indicate a plurality of types of relationships between the entities, determining relationships between the database tables corresponding to the entities by using the entity relationship model, wherein the database tables are stored in a computer memory device, generating a graph based on the entity relationship model, generating sets of database elements representing the entities and corresponding data objects stored in the database tables, wherein the element sets are generated based on the generated graph, assigning ordering numbers to the database element sets and database elements included in the database element sets and executing the query transaction by using the data objects in an order based on the ordering numbers.

A universal data object discovery system automatically identifies candidate universal data objects, ranks the candidate universal data objects according to predetermined criteria, and merges source schemas into unified universal data objects within a set of data sources. From data inputs and a set of control parameters, the system computes a degree of sharing score for composite structures in the source schemas. The data inputs comprise source schemas, similarity values for data structures, and foreign key relationships. The system identifies as candidate universal data objects those structures whose degree of sharing score exceeds a threshold. The system calculates a similarity between candidate universal data objects and merges candidate universal data objects that are similar. The merged universal data objects are the output of the system.

The invention provides an automatic generation method and device for testing data of a database and a testing system. The method comprises the steps that a database list needing to generate testing data is selected; parameters of the database list are inquired; according to the parameters of the database list, generation rules of the testing data are selected, and the testing data are generated; insert rules of the testing data are selected, and the generated testing data are inserted into the database list according to the insert rules. According to the automatic generation method and device for testing data of the database and the testing system, the technical problem of field correlation foreign key recognition is solved, various flexible testing data generation rules are provided, the intelligent insert rules are provided, the data insert speed is greatly increased, a user interface is provided, and operation is easy.

Embodiments of the invention provide access to a user's profile information to a location based service, location enable user profile information in external databases, portals, etc., and allow the seamless / transparent provision of location services using both internal and external profile information. A compact definition of a schema of an external database (that comprises a user's profile information) is stored. Data source information that describes how to connect and communicate with the external database and a structured query language (SQL) statement is stored, wherein the statement, upon execution, extracts properties from the external database corresponding to the compact definition. A foreign key identifies a record in the external database and positional information for the record in the external database is stored as a geocoding index. The stored information is then used to provide access to the user's profile information.

In one aspect, a database analytical tool or function analyzes join queries to detect queries which could be reduced if a referential integrity relationship were known. In another aspect, a probable latent referential integrity relationship is detected using one or more heuristics. Preferably, a join query is analyzed to detect a joined table which has no other conditions placed on it, and no referential integrity relationship already defined. For any such query, the analysis attempts to verify a probable latent referential integrity relationship using at least one heuristic, such as comparing cardinality of the potential primary key with the size of the table and / or with the cardinality of the foreign key. It is further possible to execute the join for some sample of records, and determine whether any records were found which did not conform to referential integrity constraints.

A computerized system and method for transforming (formatting or aggregating) the results of a query into a hierarchical information stream, such as an eXtensible Markup Language (XML) data stream is disclosed. A database server receives a query and generates a rowset. A rowset processor, using the mode specified in the query, processes the rowset and query to generate the XML data stream. For the “auto1” mode, the rowset processor transforms a rowset into an XML data stream using primary-foreign key information specified in the query to determine nesting. For the “auto2” mode, the rowset processor transforms a rowset into an XML data stream using table ordering information included in the query to determine nesting. For the “explicit” mode, the rowset processor transforms a rowset into an XML data stream using the explicit organizational information specified in the query. In one embodiment, it is easier for a developer to compose expressions to generate nested hierarchical structures than previous formulations and simpler semantics are provided without implicit hierarchy inference. The syntax of an embodiment of the hierarchical formatting function includes optional arguments including a name option, a root option, map option, namespace options and a null option.

The embodiment of the invention provides a data query method, device and system based on an OLAP system. The data query method includes the steps that a data query request sent by a user terminal is received, a first data table corresponding to first data table identification is partitioned logically to obtain at least two first partitions, and a corresponding connection mapping relation is built for each first partition; a second data table corresponding to second data table identification is partitioned logically to obtain at least two second partitions, a first foreign key value is obtained from each second partition, and the first foreign key values are within the boundary value range of the first partitions; the connection mapping relations are queried to obtain a first Hash subtable corresponding to the first foreign key values; the first Hash subtable is scanned to obtain corresponding data, and the data are returned to the user terminal. According to the data query method, through setting up the connection mapping relations, data query time is effectively shortened, and overhead of a server is reduced.

A method, system, and computer program product for reducing dependency calculation time in object persistence with circular referential integrity dependency is provided. The method includes building a graph using foreign key dependency from object to relational mapping, where nodes of the graph are object types and connected directionally from a source containing a foreign key to a target of a foreign key reference. The method further comprises topologically sorting the graph to order dependencies among the nodes including circular dependencies. The method also includes encapsulating the circular dependencies as a complex node. Furthermore, the method comprises performing object dependency calculations on the nodes and the complex node in the graph. The results of the object dependency calculations are used to generate a sequence in which the objects can be modified in a relational database.

The invention relates to a data storage optimization method for a hash joint. The method includes the steps of selecting a foreign key of a radix hash storage on a fact table, determining a dimension table, setting n bits of radix base numbers, determining 2n hash partition storages, setting 2n radix hash partition queues, storing the fact table and the dimension table by means of a page chain table, carrying out PAX column storage in a page, carrying out radix hash on recorded hash partition attribute values according to low n bits when records are inserted, storing the hash partition attribute values in corresponding pages, dynamically applying a new page after a certain radix hash partition page is filled with the records, directly having access to a specific radix hash partition queue according to a hash value of a connection key, having access to all records of the radix hash partition according to page addresses stored in the queue, having access to the records according to an original physical page link sequence of the tables when full-table scan is carried out, storing a small table R and a large table S in a partition manner, adopting a column type connection method to the fact table during hash joint in a database, and increasing or reducing the bits of the radix hash partitions to achieve dynamic increasing and reducing of the hash partitions.

A method of generating a searchable database system for storing and querying Extensible Markup Language (XML) documents is disclosed. A Document Type Description (DTD) associated with one or more XML documents is analyzed to determine a scope of XML documents defined by the DTD. A first set of elements associated with the DTD is identified. The first set of elements is mapped to a relational database. A second set of elements associated with the DTD to be stored in an XML database is identified. A collection of classes is created such that each class defines an object schema. The classes are mapped to a set of corresponding tables, and foreign and primary keys associated with the corresponding tables are identified.

The present invention relates to a method of managing a mobile multicast key using a foreign key. More specifically, the present invention relates to a method of managing a mobile multicast key using a foreign key for secure communication between a mobile terminal and a secure relay server in the region where microwaves from plural access points overlap.A method of managing a mobile multicast key using a foreign key according to the present invention has an advantage that multicast secure relay servers perform delegated authentication in advance in a region where microwaves overlap, thus reducing a delay time for authentication in a mobile terminal.And it has an advantage that it can minimize an effect from changes in group keys that user's movement make, by using a primary group key and a foreign key. This results in a reduction of an overhead from update of a group key while moving, and accordingly a reduction of a delay time.In addition, it has an advantage that it centralizes functions of key management to a secure relay server, thus overcoming the limitations on processing ability or network bandwidth of a mobile terminal.

Call forwarding a telephone number, including tracking recent locations of a user with the user's mobile personal communications device and a wireless telecommunications network; identifying a locale for the user in dependence upon the recent locations and upon historical location records for the user; and forwarding a telephone number in dependence upon the locale. In many embodiments, identifying a locale further comprises comparing historical location records and recent locations, wherein the historical location records are related to the locale through a locale identification field used as a foreign key.