1276 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.

In response to the provision of a collection of semi-structured data (or its schema), a mapper generates a structured organization to store the collection of semi-structured data. The mapper further collaterally generates a description of how the semi-structured data are stored under the structured organization. In one embodiment, normalized relational tables are used for the structured organization. In alternate embodiments, non-normalized relational tables or other structured organization may also be used. The reverse, that is, the creation of a semistructured data organization for a collection of structured data may also be performed.

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.

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.

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 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.

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.

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 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.

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.

A set of data is received that includes a plurality of event data objects or a plurality of meta data objects, wherein a structure of the set of data is a schemaless data representation. The set of data is automatically translated into a relational representation. The translated set of data is stored in a key-value data store for a query-based retrieval.

A method and apparatus for managing data written in a markup language so as to allow efficient storage, deletion, updating and retrieval of the digital data and a recording medium for storing a program designed to perform the same method. To allow efficient storage, deletion, updating and retrieval of digital data, data written in a markup language is split into fragments and each fragment is managed in a predetermined relational table. An index for the digital data based on the fragment allows the fragmented digital data to be efficiently accessible.