1303 results about "Relational table" patented technology

A data structure visualization tool visualizes a data structure such as a decision table classifier. A data file based on a data set of relational data is stored as a relational table, where each row represents an aggregate of all the records for each combination of values of the attributes used. Once loaded into memory, an inducer is used to construct a hierarchy of levels, called a decision table classifier, where each successive level in the hierarchy has two fewer attributes. Besides a column for each attribute, there is a column for the record count (or more generally, sum of record weights), and a column containing a vector of probabilities (each probability gives the proportion of records in each class). Finally, at the top-most level, a single row represents all the data. The decision table classifier is then passed to the visualization tool for display and the decision table classifier is visualized. By building a representative scene graph adaptively, the visualization application never loads the whole data set into memory. Interactive techniques, such as drill-down and drill-through are used view further levels of detail or to retrieve some subset of the original data. The decision table visualizer helps a user understand the importance of specific attribute values for classification.

A method for storing and retrieving data in a storage node of a data store and storage node of a data store, storing in main-memory at least one segment of a relational table The storage node includes at least one computational core running at least one scan thread each dedicated to the scanning of one of the at least one segment. At least one scan thread uniquely, continuously and exhaustively scans the dedicated segment of the relational table. The storage node receives and processes batches of query and update operations for the at least one segment of the relational table. The query and update operations of a batch are re-indexed at beginning of each scan by the scan thread. Then, the indexed query and update operations of a batch are independently joined to data records of said segment that match with predicates of the indexed query and update operations.

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.

A method and apparatus for defining and processing aggregate data is disclosed. Using database abstraction techniques, a set of logical fields may be used to compose queries of a set of underlying physical data sources. In one embodiment, a logical field may represent an aggregate data value calculated from the elements appearing in a column of a relational table in an underlying physical data source. The elements may be divided into to subsets to calculate multiple aggregate values. An abstract derived entity is a data object present in a database abstraction model that may be accessed as though it were a relational table contained in an underlying physical data source. In one embodiment, columns of the table defined by the abstract derived entity may be populated with aggregate data values joined to other data as specified by a composition rule included in the definition of the abstract derived entity.

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.

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, system, and computer program product are provided for a new data visualization tool that visually approximates a scatter plot and provides smooth animation of graphics by using interpolated data. An interpolation process is performed over pre-processed bins of scattered data points. A user can smoothly animate a plot along several dimensions by using an external query device to vary a selected data attribute. If the external query device (or slider) control is positioned in between discrete positions of the slider, the displayed plot corresponds to interpolated data. Adjacent data structures are determined corresponding to the position of the external query device. The adjacent data structures are merged together, then aggregated the using the spatial columns of the data structure as a unique key. An interpolated bin is generated, where the weight of the bin is interpolated and the dependent attribute is also interpolated and weighted. The interpolated dependent attribute is mapped to color in the visualized scatter plot. The plot appears as rendered splats corresponding to bin positions of the interpolated bins, where each splat has an opacity that is a function of the interpolated weight of data points in the corresponding bin.

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.

A shareable application program interface (API) and network data model infrastructure which is used in combination with a relational database to provide data storage and processing functions for network data. The network data model is stored in relational tables that describe a set of nodes and links forming a network wherein each of node represents an object of interest and link represents a relationship between two nodes. A generic node table contains a row describing each node in the network, and a generic link table contains row data describing each link. In addition, a path table whose contents are commonly generated by network analysis procedures contains rows which describe corresponding paths each consisting of an alternating sequence of nodes and links. The sequence of links in each path are identified in a separate path-link table. The system provides two application program interfaces, a PL / SQL API and a Java API, which executing application programs to use stored procedures for creating the node and link tables, store data describing nodes and links in the tables, and perform standard operations on the network data.

A technique is provided for generating one or more XML documents from a relational database using the XPath data model. Data stored on a data storage device that is connected to a computer is transformed. Initially, a document object model tee is generated using a document access definition, which defines the mapping between an XML tree structure and relational tables. The document object model tree is traversed to obtain information to retrieve relational data. The relational data is mapped to one or more XML documents.

A method for publishing relational data as XML by translating XML queries into queries against an 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 and into instructions for a tagger. The SQL query is executed, and the SQL query results are then fed into the tagger, which follows tagger instructions to generate the marked up output.

Apparatus for storing and processing a plurality of data items each comprising supplied data values organized in one or more fields each of which stores typed data. Character strings and natural language text are converted to numerical token values in an array of fixed length integers and other forms of typed data (real numbers, dates, times, boolean values, etc.) are also converted to integer form and stored in the array. Stored metadata specifies the data type of all data in the integer array to enable each integer to be rapidly accessed and interpreted. When fixed length data types are present, the metadata specifies location, size and type of each fixed length element. When variable length data is stored in the integer array, size and location data stored in the integer array is accessed to rapidly and directly access the variable size data. The presence of implicit or explicit size information for each data structure, including variable size structures, speeds processing by eliminating the need to scan the data for delimiters, and by reducing the processing needed to perform memory allocation, data movement, lookup operations and data addressing functions. Data stored in the integer array is subdivided into items, and items are subdivided into fields. Items may be organized into more complex data structures, such as relational tables, hierarchical object structures, linked lists and trees, and the like, using special fields called links which identify other referenced items.

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.

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 are provided for creating object-oriented materialized views. The object-oriented materialized views may be object materialized views or object-relational materialized views. The base tables may be object tables, object relational tables, or relational tables. The object-oriented materialized views may be refreshed, fully or incrementally. When an object-oriented materialized view is created, refresh code is generated for it. Through the use of object-oriented materialized views, users gain both the efficiency of materialized views and the power of the object-oriented paradigm.

This is a computer-implemented method for managing and enhancing data independence among multiple logical representations and storage structures of data by accessing and updating physical storage through a relational representation. The present invention supports both data independence and storage flexibility by using membership abstraction as the equalizing access for any logical representation and actual storage, while the prior art is restricted to user-supplied denotations and catalog entries.

Mechanisms for searching XML repositories for semantically related schemas from a variety of structured metadata sources, including web services, XSD documents and relational tables, in databases and Internet applications. A search is formulated as a problem of computing a maximum matching in pairwise bipartite graphs formed from query and repository schemas. The edges of such a bipartite graph capture the semantic similarity between corresponding attributes of the schema based on their name and type semantics. Tight upper and lower bounds are also derived on the maximum matching that can be used for fast ranking of matchings whilst still maintaining specified levels of precision and recall. Schema indexing is performed by ‘attribute hashing’, in which matching schemas of a database are found by indexing using query attributes, performing lower bound computations for maximum matching and recording peaks in the resulting histogram of hits.

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.

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.

A method for storing XML documents in a relational database system while exploiting XML Schema information to capture information about types, inheritance, equivalence classes, and integrity constraints in the generated relational schema, enabling efficient querying. The invention simplifies complex XML schema types, translates the simplified XML schema types into relational tables, and then stores relations corresponding to each XML element in relational table rows. The simplification includes grouping all occurrences of a given element together, assembling two or more element types into element groups if the schema indicates that elements of those element types will occur the same number of times, and applying a number of transformation rules to the element groups. The translation includes constructing a type graph from the simplified schema, building an element graph for each global element in the simplified schema from the type graph, and generating relational tables from the element graph.

A translation scheme translates DICOM content into a format compatible for storage in an NDMA relational database. The translation scheme employs a schema for indexing the DICOM content, and employs a mechanism for translating queries embedded in XML into SQL. The translation scheme translates DICOM compatible data into a tab delimited flat representation of the DICOM content. The flat representation is then translated into data compatible with a relational database format, such as SQL, and then into database insert commands. The schema enables capture of the DICOM information into relational tables. Methods are also provided to service XML formatted research and clinical queries, to translate XML queries to optimized SQL and to return query results to XML specified destinations with record de-identification where required. Methods are also provided to interface to NDMA WallPlugs, secured query devices, or GRID devices.

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 provides a method for controlling user rights. The method comprises the following steps: a user role is correspondingly acquired from a preset user role mapping relational table; the resource access right of the role is picked up, and the resource access right is defined by a regular expression, recorded in a right definition file, and marked by an exclusive resource code; the resource access request from the user is intercepted, and the resource code of the resource is acquired; by matching the resource code with the resource access right of the role, if matched, the resource is returned to the user; and if not matched, the resource access request from the user is refused. In the inserting mode, the method can be applied to e various system structural frames; moreover, the method also has the advantages of wide application range, flexible definition, and obvious lowering of system development and operation costs.

The invention provides a data migration method, a data migration device and a data migration system. The method comprises the steps of acquiring SCHEMA information of a relation database table from the relation database, mapping the SCHEMA information into a XML model of a non-relation database and recording the corresponding mapping relation in a mapping relation table, Based on the mapping relation table, the data of the relation database is guided in the XML model of a non-relation database. The invention resolves the technical problem of smoothly transferring the data in the relation database to the non-relation database, which achieves the smooth switching of business data.

A technique for updating collection-valued and other complex structured columns in a nested table using a nested extension of an UPDATE statement that uses syntax and semantics to modify collection-valued columns in a way that is analogous to the syntax and semantics of the UPDATE statement that is used to modify scalar-valued columns of the table (called the outer UPDATE). Using the same syntactic and semantic constructs as the table at the outer level allows an existing implementation that processes modifications to relational tables to reuse its implementation techniques for processing outer updates to modify collection-valued columns as well. The UPDATE extensions enable the specification of updates to nested collections embedded at arbitrary levels of depth in the object model. The new syntax is embedded inside the outer UPDATE statement in a way that parallels the structure of the data itself and thus maps more directly to the user's conceptual model of the data. The method for implementing the UPDATE extensions uses a change descriptor, which is a data structure that aggregates substantially all changes, both scalar and collection-valued into a single value that can be applied to the changed collection-valued column. This technique can also be used for modifications to other kinds of complex-structured columns such as objects or xml. The change descriptor includes hierarchical information for the cell, thereby enabling efficient application of multiple updates at various granularity levels in a single operation and enabling the implementation of efficient index maintenance algorithms by updating only the indexes affected by the UPDATE operation and updating only those index rows that were affected by the UPDATE operation.

Systems, methods, computer program product embodiments are provided for executing a function in a path-based query when extracting data from a markup language document for return as a relational table, the markup language document organized hierarchically into nodes. An embodiment includes receiving a path-based query including a complex row pattern and column definition, forming multiple sets of nodes based on a simplified row pattern and column definition, determining ancestor-descendent pairings for the nodes in the column definition set, and utilizing the ancestor-descendent pairings with the simplified row pattern to return a relational table satisfying the complex path-based query. An embodiment further includes extensible markup language (XML) as the markup language, and an XPath query expression as the complex path-based query.

Embodiments of the invention provide methods, systems, and articles of manufacture improving the process of query composition, query processing, and presenting query results to users of an abstract database. Embodiments of the present invention organize and view data using abstract records. Specifically, users compose a query according to the logical relationships present in the data. Rather than evaluate conditions against a set of rows from a relational table, conditions included in abstract query are evaluated against instances of an abstract record. Instances that satisfy the conditions specified by an abstract query are returned as query results. In a specific case abstract records are used to evaluate a “never exists conditions, that determine the absence of data in an abstract records that satisfy a particular condition.