533 results about "Column (database)" patented technology

Systems and methods for hosting variable schema data such as dynamic tables and columns in a fixed physical database schema. Standard objects, such as tables are provided for use by multiple tenants or organizations in a multi-tenant database system. Each organization may add or define custom fields for inclusion in a standard object. Custom fields for multiple tenants are stored in a single field within the object data structure, and this single field may contain different data types for each tenant. Indexing columns are also provided, wherein a tenant may designate a field for indexing. Data values for designated fields are copied to an index column, and each index column may include multiple data types. Each organization may also define custom objects including custom fields and indexing columns. Custom objects for multiple tenants are stored in a single custom object data structure. The primary key values for the single custom object table are globally unique, but also include an object-specific identifier which may be re-used among different entities.

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.

Systems and methods for clustered access to as many columns as possible given a particular ongoing query mix and a constrained amount of disk space is disclosed. A compressed database is split into group of columns, each column having duplicates removed and being sorted. Then certain groups are transferred to a fast memory depending on the record of previously received queries.

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.

In a database, a frequently retrieved column is encrypted using a common key, and other columns are encrypted using a specific row key. Thus, a retrieving process can be performed at a high speed, and the security can be improved. Then, the row and column of the database are encrypted by assuming the plaintext to be encrypted as a bit string, and performing a binary operation with a random bit string. A random bit string is obtained by sequentially generating multidimensional vectors using a nonlinear function by defining a predetermined bit length as 1 word and a plurality of words as components of the multidimensional vector.

Systems and methods for answering user questions using databases annotated with answerable questions are disclosed. The database includes database items organized into columns. Each of the columns may have a question annotated thereto. The question is a parameterized question that is answerable by the database items in the column. A question answering algorithm is used to search the database for an annotated question corresponding to a question that needs to be answered.

A graphical query interface provides visual feedback to a user during the construction of a query. In a first embodiment, the visual feedback helps the user determine the quality of the query as the query is being built. The relationship of columns in the database is graphically displayed to a user. When the user selects a column in the database, a filtered display mechanism displays only those columns or records that satisfy the portion of the query already constructed. In a second embodiment, the visual feedback eliminates some possible selections in the query tree due to previously-made selections that eliminate the eliminated selections as possibilities. In the second embodiment, the visual feedback mechanism may function according to data values in columns, and may also function according to known relationships between columns themselves.

A system for structuring digitally stored information and methods for searching the resulting structure are described. The structuring system comprises a database comprising a number of cells arranged in rows and columns for holding pieces of data representing the information. Only one piece of data may be stored in each cell and the pieces of data contained in cells in one row of the database constitutes a certain information. This information may be files on a computer hard disk, pages on the www etc. An index for each unique piece of data occurring in the database, where each index table providing information concerning all locations of that unique piece of data in the database, a main index listing once all the unique pieces of data in the database together with a corresponding index table identifier, the index table identifier providing a link to the corresponding index table for that particular piece of data, are also necessary elements in the structuring system, The structure of the database / index system in itself provides fast and simple access to the information contained therein. The information structuring system and the methods for structuring and searching digitally stored information may e.g. be used in a search engine for the Internet, in a mobile phone, WAP or as a search system for retrieving files and controlling the information stored in a LAN or computer hard disk.

A memory compiler to generate a set of memories is based on a subtraction approach from a set of templates (memory templates), including at least one layout database and auxiliary design databases, by software. The software can be based on general-purpose programming language or a layout-specific language. The compiled memories can be generated by reducing the memory array sizes in row and / or column directions by moving, deleting, adding, sizing, or stretching the layout objects, and disabling the high order addresses, etc. from the memory template by software. The new auxiliary design databases, such as layout phantom, behavior model, synthesis view, placement-and-routing view or datasheet, can also be generated by modifying some parameters from the memory template by software. One-time programmable memory using junction diode, polysilicon diode, or isolated active-region diode as program selector in a cell can be generated accordingly.

The invention herein provides method and apparatus, including software for determining a set of materialized views or indices of the contents or a subset of the contents of a database in a data processing system to be created for one or more users of the database. The method and apparatus provide method and means for evaluating a workload presented by a user to the database; evaluating the data processing system characteristics; evaluating the database characteristics; and, using the above evaluations for recommending a set of suitable materialized views or indices to the user. Another aspect of the invention, which may be used for a workload presented by a user of a database in a data processing system, provides method and apparatus, including software for determining a set of materialized views or indices of the contents or a subset of the contents of the database, by: generating a plurality of materialized view candidates from evaluation of the workload, data processing system characteristics and database characteristics; estimating statistics for the materialized view candidates such as the number of rows, row size, and column statistics; generating a plurality of potential index candidates by evaluating the workload, data processing system characteristics, database characteristics and the materialized view candidates; and, from the materialized view candidates and index candidates selecting a set of suitable materialized views and / or indices for submission to the user.

A computer-implemented database and method providing an efficient, ordered reduced space representation of multi-dimensional data. The data values for each attribute are stored in a manner that provides an advantage in, for example, space usage and / or speed of access, such as in condensed form and / or sort order. Instances of each data value for an attribute are identified by instance elements, each of which is associated with one data value. Connectivity information is provided for each instance element that uniquely associates each instance element with a specific instance of a data value for another attribute. In accordance with one aspect of the invention, low cardinality fields (attributes) may be combined into a single field (referred to as a “combined field”) having values representing the various combinations of the original fields. In accordance with another aspect of the invention, the data values for several fields may be stored in a single value list (referred to as a “union column”). Still another aspect of the invention is to apply redundancy elimination techniques, utilizing in some cases union columns, possibly together with combined fields, in order to reduce the space needed to store the database.

The present invention provides “XML Schema Collections” and methods and systems for using the same. XML data is typically stored as an XML instance, each of which should conform to a “schema” according to a desired goal. An XML schema provides identification and organization for the data supplied by an XML instance. XML Schema Collections are collections of one or more XML schema namespaces. An storage location designated for storage of XML data, such as an XML column in a relational database, can be “typed” with an XML Schema Collection object, allowing that storage location to store XML instances that conform to more than one XML schema. XML Schema Collections provide increased data storage versatility, and facilitation of data searches.

One embodiment of the present invention provides a system that decrypts an encrypted column in a row. During operation, the system receives the encrypted column in the row. The system then determines a security domain associated with the encrypted column in the row, wherein the security domain represents a set of columns in rows encrypted using the same key. Next, the system determines a key associated with the security domain. The system then decrypts the encrypted column in the row using the key. Note that using a security domain to represent a set of columns in rows enables the database to grant access to data within the database at arbitrary levels of granularity.

A method, apparatus, and article of manufacture for optimizing a star join operation in relational database management systems (RDBMS). A cross-product is generated from a plurality of dimension tables referenced by the star join. The join columns of the cross-product are then hashed to create a hash-row value. Using the hash-row value, a Star Map is probed to determine whether a record exists in a fact table that corresponds to the cross-product, wherein a first portion of the hash-row value is used to select a row of the Star Map and a second portion of the hash-row value is used to select a column of the selected row of the Star Map. The fact table is accessed to perform a merge join with the cross-product when the selected column of the selected row of the Star Map indicates that the record exists in the fact table.

Method, system, and program product for searching unstructured data. The unstructured data, as text data or image data, is searched by first searching the unstructured data through an extended search broker. The extended search broker has intermediary components between a search requestor and a search agent for unstructured data searching. The search agent returns the search results to the broker for aggregation. The broker aggregates the search results and returns the search results to a wrapper. The wrapper then takes result attributes from the aggregated search results and makes the attributes available, e.g., as one or more columns in a nickname table. This nickname table is searchable by a relational database using a structured query language.

A data processing system receives data in a first format utilizing a markup language such as eXtensible Markup Language (XML), and stores the data in a different, relational database format involving multiple tables and columns, etc. The system translates subsequent query input expressed in the first format to prepare representative query instructions in SQL or another query language compatible with relational data, and thereafter executes the prepared instructions upon data in the relational database. The system outputs results of the query in format dictated by the query input.

An improved system and method for compression in a distributed column chunk data store is provided. A distributed column chunk data store may be provided by multiple storage servers operably coupled to a network. A storage server provided may include a database engine for partitioning a data table into the column chunks for distributing across multiple storage servers, a storage shared memory for storing the column chunks during processing of semantic operations performed on the column chunks, and a storage services manager for striping column chunks of a partitioned data table across multiple storage servers. Any data table may be flexibly partitioned into column chunks using one or more columns with various partitioning methods. Domain specific compression may be applied to a column chunk to reduce storage requirements of column chunks and increase transmission speeds for sending column chunks between storage servers.

A classification engine provides flexible support for manipulation of attribute-based data by dynamic generation of SQL with classifiers constructed from different schema objects representing different database schemas. The classifiers may be constructed by defining classifiers corresponding to the database schema, and mapping the classifiers to columns on tables in the database. The invention also allows a classification system to modify the database structure and easily conform the classification engine to the modified structure without recompiling the engine or rewriting the application that use the classification system. The engine is conformed to the new structure by constructing a second schema object for the modified database. The schema objects are preferably defined using a field-based language such as extensible markup language (XML).

Provided are a method, system, and program for managing a database. A request is processed to create an index on at least one key column of a table in a computer readable medium. A determination is made of table partitions in which rows of the table are stored. One index partition is generated for each determined table partition, wherein each index partition includes nodes, wherein each node in each index partition includes a key value from at least one column in a corresponding table row in the table partition associated with the index partition and a location identifier identifying the corresponding table row in the corresponding table partition. In certain embodiments, a technique is implemented during queries to limit the search to a subset of the multiple index partitions when possible and return rows in the order of the key columns of the index while the same range of key values can exist across multiple index partitions.

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.

A method for processing data contained in tables in a relational database includes joining a first table and a second table into a joined table determining metadata for at least one column of a table of the following tables: the first table, the second table, and the joined table. The metadata is used for processing data in the at least one column of the table, and for processing data in at least one column of at least one other table of the following tables: the first table, the second table, and the joined table.

The invention provides a full text retrieval inquiry index method for an extensible markup language document in a relational database. The method comprises the following four steps of: storing XML document data in the way of a mark sequence-based dimensional relation table; constructing a document structure basic information table; creating a word-based inverted index on a node text column of the document structure basic information table; and carrying out full text retrieval inquiry on the basis of the index. By the index method, the management efficiency of the extensible markup language document and the execution efficiency of the full text retrieval operation of the extensible markup language document can be effectively improved, and the inquiry execution time is shortened. The method has relatively high commonality and can be seamlessly fused with existing relation database in the way that the XML document data and the index data are stored in a using relation mode. At the same time, the method can be applied to inquiry of keyword research of the XML document data and then the execution efficiency of inquiry is improved.

Disclosed is a system, method, and program for extracting data from a record in a first format and inserting data into a record in a second format during an insert operation. A determination is made of location information for data in at least one record in at least one column in the first format involved in the insert operation from which data will be extracted and of location information for data in at least one record in at least one column in the second format involved in the insert operation into which the data extracted from a corresponding column in the first format will be inserted. For each column from which data will be extracted, the determined location information is used to generate at least one instruction to move the data in each column in the record in the first format to each corresponding column of one record in the second format. The location information of the columns in records in the first and second formats involved in the data movement operations is encoded in the at least one instruction. The instruction may be repeated for multiple records in the first format from which data will be extracted into multiple records in the second format.

A scheme is used to automatically discover algebraic constraints between pairs of columns in relational data. The constraints may be “fuzzy” in that they hold for most, but not all, of the records, and the columns may be in the same table or different tables. The scheme first identifies candidate sets of column value pairs that are likely to satisfy an algebraic constraint. For each candidate, the scheme constructs algebraic constraints by applying statistical histogramming, segmentation, or clustering techniques to samples of column values. In query-optimization mode, the scheme automatically partitions the data into normal and exception records. During subsequent query processing, queries can be modified to incorporate the constraints; the optimizer uses the constraints to identify new, more efficient access paths. The results are then combined with the results of executing the original query against the (small) set of exception records.

A database system providing SQL extensions for automated encryption and decryption of column data is described. In one embodiment, for example, in a database system, a method is described for providing automated encryption support for column data, the method comprises steps of: defining Structured Query Language (SQL) extensions for creating and managing column encryption keys, and for creating and managing database tables with encrypted column data; receiving an SQL statement specifying creation of a particular column encryption key; receiving an SQL statement specifying creation of a database table having particular column data encrypted with the particular column encryption key; and in response to a subsequent database operation that requires the particular column data that has been encrypted, automatically decrypting the particular column data for use by the database operation.

The invention discloses an HBase-based big data storage and retrieval method and system. A line key is generated through a defined RowKey expression with an HBase Thrift client based on a data file field mapping table, and data stored in lines is imported into an HBase database. On the premise of keeping consistence, multi-feature values of data objects are added according to a plurality of combination ways to form the line key; the multi-feature values and ordinary column value data construct HBase data lines; the HBase data lines are stored in a plurality of HBase data tables according to different line key construction ways; a fuzzy result set can be rapidly obtained according to matching of certain feature values in the line key during multi-feature value data retrieval; and filter filtration is further performed on the fuzzy result set to obtain a final accurate result set. A research result can be suitable for a big data conversion-storage process from different types of data files to a destination HBase database; high universality is achieved; line key storage data is formed according to a multi-feature value combination way; a rapid data retrieval interface can be provided; and the aim of rapidly retrieving is fulfilled.

A method, system and program for accessing records in a database object, such as an index or table. A cursor is maintained that points to a start entry in the database object. The database object has rows and columns of values. A runtime component receives a command to return a kth entry in the object having column values that satisfy predicates in a query statement. The runtime component calls a manager component that accesses entries in the database object to return the kth entry in the object having column values that satisfy the predicates. The manager component moves the cursor through sequential entries in the database object, in either the forward or reverse direction, until a kth entry that satisfies the predicates from the start entry is reached. The manager component positions the cursor to an entry that is the kth entry that satisfies the predicates from the start entry and returns data from the kth entry pointed to by the cursor to the runtime component.

A method, apparatus and program product is provided for optimizing a database query. A query syntax, system generated predicates, and requisite statistics of the database query are analyzed to determine if a predicate structure is a good candidate for a symbol table only data structure. The predicate structure is analyzed to determine if the predicate structure is already encompassed by an encoded vector index. The symbol table only data structure is generated for at least one column in a database table without generating a corresponding vector data structure from an encoded vector index if the predicate structure is a good candidate and not encompassed by an encoded vector index. The symbol table only data structure is maintained by detecting a change in data associated with the symbol table only data structure and updating the symbol table only data structure to reflect the change in the data.