2125 results about "Table (database)" patented technology

A method and system for updating data for a set of objects in a database is provided. A request identifies a set of objects using a property of the objects and an operation to be performed thereon. The object request is translated to a relational request such that a column in a table corresponding to the property can be operated upon by a relational data store mechanism.

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.

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 optimization technique that reorders outerjoins and antijoins with inner joins in a bottom-up optimizer of a relational database management system (RDBMS). Each join predicate is associated with a normal eligibility list (NEL) that includes tables that are referenced in the join predicate and an extended eligibility list (EEL) that includes additional tables that are referenced in conflicting join predicates. An EEL includes all the tables needed by a predicate to preserve the semantics of the original query. During join enumeration, the optimizer determines whether a join predicate's EEL is a subset of all the tables in two subplans to be merged, i.e., whose EEL is covered. If so, the two subplans are combined using the join predicate. Otherwise, the two subplans cannot be joined. Two approaches are used to reordering: without compensation and with compensation. The "without compensation" approach only allows join reorderings that are valid under associative rules. Thus, the optimizer will not combine subplans using a join predicate whose EEL is not covered. The "with compensation" approach allows two subplans to be combined using the join predicate, when a join predicate's EEL is not covered, as long as the join predicate's NEL is covered. Compensation is performed through nullification and best match. Multiple compensations may be merged and performed at any time.

An improved method and system for preserving data constraints during parallel apply in asynchronous transaction replication in a database system have been disclosed. The method and system preserves secondary unique constraints and referential integrity constraints, while also allowing a high degree of parallelism in the application of asynchronous replication transactions. The method and system also detects and resolves ordering problems introduced by referential integrity cascade deletes, and allows the parallel initial loading of parent and child tables of a referential integrity constraint.

Techniques used in a system for collaborative work which gives collaborators unskilled in data processing technologies access to a variety of information resources to provide the collaborators with information resources which are obtained in response to parameterized information requests such as queries. The techniques use records in database tables to represent a class of parameterized information requests. Information for instances of the class includes queries that may be used in the instances and default values for bind parameters in the queries. Values for the bind parameters may also be specified for classes of user interfaces that employ the information sources returned by the parameterized information requests and for instances of the user interface. A user may also use specify values for bind parameters in his or her instance of the user interface.

Disclosed are a computer-readable code, system and method for retrieving one or more records stored in electronic form in a library of records. The program that executes the method accesses a database table to identify, from user-generated information, one or more phrases likely to be contained in or associated with a record of interest, and from these phrase(s), identifies one or more phrase-related tags. The program uses the one or more tags so identified to find, independent of user input, test tags associated with those already identified, and to present to the user the number of records associated with the test tags, allowing the user to find records based on the inclusion of known tags and associated phrases.

A database system providing improved methods for optimization and execution of queries aggregating information from multiple database tables is described. The improved method breaks serial operations into a group of child operations that can be individually optimized and processed in parallel. A query including a grouping operator over a union node is split by pushing the grouping operation down into each input arm of the union node. Specifically, grouping operators are inserted into each child arm of qualifying union nodes, enabling separate physical database tables to be summarized in parallel. Each of the child grouping operators concurrently groups data and generates summary results in parallel, taking advantage of capabilities of available parallel processing hardware. The aggregate operators of the original master grouping operator are modified to accept and correctly synthesize sub-aggregated results generated by each of the child grouping operators. The method also enables individual optimization of operations on each database table, including use of advantageous index-only execution plans.

A process control system that automatically monitors processes and performs activities based on conditions detected during monitoring. The information needed to do the monitoring and perform activities is contained in tables in a database system. The process control system may be configured by configuring entries in the tables. A parallel state machine permits activities to be performed for the process in parallel. The parallel state machine employs a task that is represented in the database tables. The task defines a set of activities that must all be performed in order for a state transition to occur and the parallel state machine causes a process's state to change only when the activities defined in the task have all been performed. In addition, a graphical user interface is disclosed for defining tasks.

A method and system is provided that enables OLE DB (Object Linking and Embedded Database) applications to access embedded table-structured relationships in hierarchical databases as Normalized relational tables.

The invention discloses a resource description framework querying method and system based on a relational database, wherein the method includes the following steps: establishing a result variable table according to the SPARQL query statement input by a user, separating the SPARQL query statement to obtain each basic graphic pattern, and establishing the constant table, the variable table and the blank note table corresponding to the basic graphic patterns and a pattern string identifying the logical relation between the basic graphic patterns; generating a pattern tree based on the pattern string; generating the SQL subquery fragment for each basic graphic pattern according to the corresponding element structural table of each basic graphic pattern, and representing the relationship between the basic graphic patterns based on the pattern tree to connect the SQL subquery fragments into a whole SQL query statement section; utilizing the SQL query statement section obtained through conversion to query the RDF data in the relational database; and semantics wrapping the query result according to the limitation of the SPARQL result set and the user setting and returning the query result to the user.

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.

A database partial compression mechanism compresses only part of a database table based on historical information regarding how the database table has been accessed in the past. The function of the database partial compression mechanism may also be governed by a user-specified partial compression policy. When the historical information indicates a portion of a table is not frequently used, the portion of the table is compressed without compressing other portions of the table. The result is a table that is uncompressed for portions that are accessed often and compressed for portions that are accessed less often.

A method for representing a database in a computer readable medium. Accessing a first table in the database. The first table has rows of data, each row of data having one or more columns. Storing a first representation of the first table in a volatile computer memory in a column-oriented format, the column-oriented format comprising at least one B-tree for at least one column, wherein the B-tree is composed of at least one array and the at least one B-tree includes references to a plurality of arrays, each array of the plurality of arrays comprised of data corresponding to the rows of one column of the table, wherein the storing further comprising storing data corresponding to the rows in a packed format. Storing a second representation of the database on the computer-readable medium, the second representation substantially identical to the first representation.