Did You Know...
...that the x-ray was discovered purely by accident? When German physicist Wilhelm Konrad von Roentgen was experimenting with cathode rays in 1895, he put an activated Crookes tube in a book and went out to lunch. When he returned, he discovered that a key that had also been placed in the book showed up as an image on the developed film!
PatentStorm News
Make the Most of Our Site
See this month's Top Inventors and Most Cited Patents.
Stay on top of the latest innovations by subscribing to an RSS feed.
Registered users: Manage your profile.
| Application No. | Application Title | Issue Date |
| 20120054225 | Query and Exadata Support for Hybrid Columnar Compressed Data A method and apparatus is provided for optimizing queries received by a database system that relies on an intelligent data storage server to manage storage for the database system. Storing compression units in hybrid columnar format, the storage manager evaluates simple... | 03/01/2012 |
| 20110302205 | METHOD AND MECHANISM FOR DETERMINING LIFE INTERVALS FOR A KEY IN AN INDEX Disclosed is a mechanism, system, interface, and process to determine one or more life intervals when given a key. In addition, one or more life intervals can be determined for each key within a range of keys. This type of process is useful for auditing purposes or if i... | 12/08/2011 |
| 20100281079 | COMPRESSION ANALYZER Techniques are described herein for automatically selecting the compression techniques to be used on tabular data. A compression analyzer gives users high-level control over the selection process without requiring the user to know details about the specific compression ... | 11/04/2010 |
| 20100281004 | STORING COMPRESSION UNITS IN RELATIONAL TABLES A database server stores compressed units in data blocks of a database. A table (or data from a plurality of rows thereof) is first compressed into a “compression unit” using any of a wide variety of compression techniques. The compression unit is then stored in one... | 11/04/2010 |
| 20100278446 | STRUCTURE OF HIERARCHICAL COMPRESSED DATA STRUCTURE FOR TABULAR DATA A highly flexible and extensible structure is provided for physically storing tabular data. The structure, is referred to as a compression unit, and may be used to physically store tabular data that logically resides in any type of table-like structure. According to one... | 11/04/2010 |
| 20100036803 | ADAPTIVE FILTER INDEX FOR DETERMINING QUERIES AFFECTED BY A DML OPERATION Techniques are disclosed for creating and using a filter index in order to identify registered queries whose result sets are likely to have been changed by changes made to tables. The filter index entries are based on filter conditions. The filter conditions are created... | 02/11/2010 |
| 20100036831 | GENERATING CONTINUOUS QUERY NOTIFICATIONS Techniques are described to allow a query to be registered as a persistent stored entity within the database, and to generate notifications as and when the query result changes continuously as long as the query continues to be registered with the database. According to ... | 02/11/2010 |
| 20100030781 | METHOD AND APPARATUS FOR AUTOMATICALLY CLASSIFYING DATA One embodiment of the present invention provides a system for automatically classifying data in a database. During operation, the system receives and executes a database operation. Next, the system automatically determines if any data was modified as a result of executi... | 02/04/2010 |
| 20090292679 | CASCADING INDEX COMPRESSION Techniques for compressing branch nodes in an index are provided. The branch nodes may be part of a main index of a multi-level index that also includes one or more journal indexes. A Bloom filter may be generated and associated with, e.g., a branch node in the main ind... | 11/26/2009 |
| 20090292947 | CASCADING INDEX COMPRESSION Techniques for maintaining a cascading index are provided. In one approach, one or more branch node compression techniques are applied to the main index of a cascading index. In an approach, a Bloom filter is generated and associated with, e.g., a branch node in the mai... | 11/26/2009 |
| 20080281846 | High performant row-level data manipulation using a data layer interface Performing an operation directly on data stored in a database table provides for avoiding generation and processing of SQL statements. A Data Layer interface, comprising a set of APIs, allows internal database server components to call directly to the Data Layer for mak... | 11/13/2008 |
| 20080183686 | Apparatus to selectively remove the effects of transactions in online database and enable logical recovery A method and apparatus for selective removal of user data changes is provided. In one embodiment, the methodology is implemented by a logical recovery mechanism. Upon receiving a request to selectively remove user data changes stored in a database, the mechanism creates... | 07/31/2008 |
| 20080144079 | System and method for data compression A method of processing data from a file includes obtaining a first portion of the file, creating a first compression unit by compressing at least the first portion of the file, obtaining a second portion of the file, creating a second compression unit by compressing at ... | 06/19/2008 |
| 20080098045 | Techniques for automatically tracking and archiving transactional data changes A technique for making versions of rows of a user-defined tracked table temporally queryable. The database management system of the technique permits temporal queries of user-defined tables. The queries return versions of rows in the user-defined table that are currentl... | 04/24/2008 |
| 20080098236 | System and method for data encryption A method of processing data from a file includes obtaining a first portion of the file, encrypting the first portion of the file to create a first encrypted portion, obtaining a second portion of the file, encrypting the second portion of the file to create a second enc... | 04/24/2008 |
| 20080098083 | System and method for data de-duplication A method of processing a file includes receiving a request to store the file, receiving the file, determining whether a database already contains the file, and storing the file in the database if the database does not already contain the file. A method of processing a f... | 04/24/2008 |
| 20080065672 | Insertion rate aware b-tree Systems, methods, and other embodiments associated with insertion rate responsive b-trees are described. One system embodiment includes a capacity logic to detect a divide condition for a leaf node and an insert logic to determine an insertion level for the leaf node. T... | 03/13/2008 |
| 20070288529 | Framework to optimize delete all rows operations on database objects A bulk delete operation with reduced latency allows for retrieval of deleted data. Each database object holds a Delete SCN indicating when a bulk delete operation was last performed. Each row in the database object holds a Row Modification SCN indicating when the row wa... | 12/13/2007 |
| 20070088912 | Method and system for log structured relational database objects A system, method, computer program and article of manufacture for updating a disk that moves updates for a specific database object into available contiguous free data blocks, and writes the multiple updates to disk using a single disk access, maintaining database trans... | 04/19/2007 |
| 20070043748 | Method and apparatus for organizing digital images with embedded metadata One embodiment of the present invention provides a system that facilitates automatically organizing digital images using metadata which is embedded in the digital images. The system operates by receiving a digital image with embedded metadata, wherein the embedded metad... | 02/22/2007 |
| 20060212492 | Method and mechanism for identifying transaction on a row of data A method and mechanism for identifying one or more transactions that have modified or created an object in a database system. Also disclosed is a method and mechanism to compensate for the effects of a transaction in a database system is disclosed. The disclosed approac... | 09/21/2006 |
| 20060149791 | Database-driven distributed recovery A method and apparatus for database-driven distributed recovery is provided. According to one aspect, a transaction manager sends, to one or more resource managers, connection information that indicates how to connect to the transaction manager. A resource manager that ... | 07/06/2006 |
| 20060122963 | System and method for performing a data uniqueness check in a sorted data set Embodiments of the present invention include a method for performing a data uniqueness check in a set of sorted data blocks comprising accessing data to be inserted into the set of sorted data blocks, determining a proper data block of the set of sorted data blocks for ... | 06/08/2006 |
| 20050278350 | Providing mappings between logical time values and real time values Techniques are provided for providing mappings between logical time values and real time values for a database. The techniques include, if a first event related to the database occurs, writing an entry of a current LTV and a current RTV in a volatile mapping data struct... | 12/15/2005 |
| 20050278359 | Providing mappings between logical time values and real time values in a multinode system Techniques are provided for providing mappings between logical time values and real time values in a multinode system. The techniques include, if a first event occurs, then writing an LTV-to-RTV mapping to a non-volatile data structure. If a second event occurs, then a ... | 12/15/2005 |
| 20050262110 | Vector reads for array updates An array update operation which specifies number of (row-identifier, value) pairs for updating rows in a table of a database is implemented as follows. A block-identifier of a block (on disk) that holds a row identified by a row-identifier in a specified pair is looked ... | 11/24/2005 |
| 20050256849 | Automatic tuning of undo retention A method and apparatus for data recovery are disclosed. A plurality of queries executing in a database system are tracked. A query with a longest duration is selected and undo retention duration is calculated for supporting the longest query. ... | 11/17/2005 |
| 20050256908 | Transportable database A method and apparatus for creating a target database on a target platform based on a source database on a source platform is provided. A target database is created on the target platform based on data, metadata (for example, data in the system tablespace and control fi... | 11/17/2005 |
| 20050256897 | Providing the timing of the last committed change to a row in a database table Processing a database statement received from a database client, which requests information about the timing of a last committed change to a row in a database table, comprises retrieving a logical time value that represents a commit time associated with the row and prov... | 11/17/2005 |
| 20050256829 | Undo advisor A method and apparatus for data recovery are disclosed. Undo tablespace size is calculated for user-specified undo retention time based on system statistics collected over a period of time specified by a history time parameter. ... | 11/17/2005 |
| 20050240633 | Online recovery of user tables using flashback table A method and apparatus for updating databases are disclosed. In response to a flashback request, a database object is restored to a state as of a specified flashback time. The changes introduced into the database object are reversed in a sequence starting with a change ... | 10/27/2005 |
| 20050125573 | Method and mechanism of accessing segments in data storage systems A method and mechanism of accessing segments in data storage systems is disclosed. In one embodiment, extents in a segment are coalesced into groups based on the data storage device each extent is stored on. Rather than submit an I/O operation for each extent, a single ... | 06/09/2005 |
| 20050120064 | Method and mechanism for determining life intervals for a key in an index Disclosed is a mechanism, system, interface, and process to determine one or more life intervals when given a key. In addition, one or more life intervals can be determined for each key within a range of keys. This type of process is useful for auditing purposes or if i... | 06/02/2005 |
| 20050120062 | System, structure, interface, and semantics for implementing row versions: accessing past versions of a data item Disclosed is a mechanism, system, interface, and process to allow specification of a new table decoration clause to obtain one or more past version of one or more data items. The version query provides for a direct interface to get multiple versions of the row(s). In ad... | 06/02/2005 |
| 20050114409 | Method and mechanism for row versioning Disclosed are algorithms, mechanisms, processes, mechanisms, and systems to implement a query upon past versions. In one approach, the version query can be defined as either “rowid”-based access or non-rowid based access. With rowid based access, a given rowid is us... | 05/26/2005 |
| 20050055385 | Querying past versions of data in a distributed database Past versions of data in a distributed database system comprising multiple databases and associated database servers are queried using temporal database access mechanisms, where a request for data in a past state from a “remote” database can be received at a “loca... | 03/10/2005 |
| 20050055381 | Active queries filter extraction A query result set is an example of a type of body of data whose content is defined by a query. Modifications to a database can change the result of a query and therefore what the content of such a body of data, such as a result set, should be. Active Queries is an appr... | 03/10/2005 |
| 20050055384 | Query based invalidation subscription A query result set is an example of a type of body of data whose content is defined by a query. Modifications to a database can change the result of a query and therefore what the content of such a body of data, such as a result set, should be. Active Queries is an appr... | 03/10/2005 |
| 20050050109 | Method and mechanism for dependency tracking at low granularity levels A method and mechanism for tracking dependencies at low granularity levels in a database system is disclosed. An embodiment utilities commit time values at low granularity levels which are associated with structures in a database system. Those associated commit time val... | 03/03/2005 |
| 20050015563 | Guaranteed undo retention Techniques are provided for guaranteed undo retention. The techniques include a database server attempting to store undo information in undo storage. In order to store the undo information, the database server may overwrite expired undo records; write to empty undo exte... | 01/20/2005 |
