37 results about "Interposition operation" patented technology

A hybrid database table is stored as both a row and a column store. One or more techniques may be employed alone or in combination to enhance performance of the hybrid table by regulating access to, and/or the size of, the processing-intensive column store data. For example, during an insert operation, the column store data may be searched for a uniqueness violation only after certain filtering and/or boundary conditions have been considered. In another technique, a hybrid table manager may control movement of data to the column store based upon consideration such as frequency of access, or underlying business logic. In another technique, querying of a hybrid table may result in a search of the column store data only after an initial search of row store data fails to return a result.

Embodiments of the invention provide systems and methods for maintaining audit records for a database or other resource. According to one embodiment, a method for maintaining audit records for a database can comprise detecting an operation involving at least one record of the database. An audit record can be generated for the operation and the audit record can be stored in an audit table in the database. Insert operations and select operations for the audit table can be supported but other operations for the audit table can be prohibited. Additionally or alternatively, creation of more than one audit table having a same name and schema can be prevented.

The invention relates to a database one-way synchronization method for use among databases. The method comprises the following steps: inquiring data to be synchronized in a source database; checking whether a record to be synchronized exists in a target database or not, and performing an update operation or an insertion operation or not performing any synchronization operation according to a checking result; acquiring existing data in the target database; and checking whether data in the target database exist in the source database or not, and deleting the record or marking the record or not performing any synchronization operation according to a checking result. Through adoption of the database one-way synchronization method for use among databases disclosed by the invention, service decoupling can be realized, and one-way data synchronization among data of different types of databases and different structural tables can be realized through simple configuration.

One embodiment of the present invention provides a system that concurrently performs redundant via insertion and timing optimization during routing of an integrated circuit (IC) chip design. During operation, the system performs an initial routing on the IC chip design to obtain a routing solution, which includes a set of vias. The system then performs a redundant-via-insertion operation on the routing solution, wherein the redundant-via-insertion operation attempts to modify a via within the set of vias into a redundant via. Next, the system performs a timing optimization on the routing solution by iteratively: (1) performing a timing analysis on the routing solution; (2) performing a logic optimization on the routing solution; and (3) performing an incremental routing adjustment on the routing solution, wherein the incremental routing adjustment adjusts the redundant vias.

Disclosed is a method of a read-optimized memory database T-tree index structure. The method includes: for creating a data structure of a t-T tree, building a T-tree index structure according to existing data, performing insertion operation on the data according to size N of nodes in a T-tree structure, guaranteeing orderliness of data in the nodes, further performing split operation if one node is filled up with the data so as to guarantee balance of the tree, and do not performing any operation on internal T-tree left-right subtree fields in the tree structure in the stage in the process of creating the t-T tree; performing data query operation in the built t-T tree, wherein query operation is divided into single-value query and range query. High data access efficiency provided by the T-tree structure is fully utilized, so that good read performance is provided on the whole; cache hit ratio is increased by the aid of a cache locality-sensitive algorithm and by reduction of use of pointers.

Disclosed is an apparatus and system for reducing locking in materialized query tables (MQT) for distributive functions. The apparatus includes an insert module that inserts into an MQT table a child record when a new record is inserted into a base table associated with the MQT. The child record includes values associated with the insert operation. Also included is a delete module that inserts into the MQT a child record that includes measure values that are the negative of the measure values in the base table row that is the subject of the delete operation. An update module inserts two child rows into the MQT, one negating the affected record and the other adding the values of the update operation. Each inserted child row includes a unique identifier that relates the inserted row to a parent row. An execution module generates responses using the values indicated by the cumulative records in a family.

The invention discloses a method and device for detecting the performance of a database. The method comprises the following steps of: reading data from a memory, executing multiple times of operation on database tables according to the read data, writing results corresponding to the multiple times of operation into a disk, and recording time for completing the multiple times of operation, wherein the multiple times of operation comprises multiple times of insert operation, multiple times of query operation and multiple times of update operation, and the execution process of the multiple times of insert operation is implemented in a manner that the multiple times of insert operation aiming at the database tables is executed by at least one transaction; and acquiring the corresponding database performance detection results according to the recorded time for completing the multiple times of operation. By adopting the method and the device, the stability of the database performance detection results can be improved, and the detection results of the database performance of a user can be displayed in real time through a click requirement from a user interface.

Various approaches for processing a B+ tree data structure are described. In one approach, in a first transaction a first insert operation to a first data page of a first index page in the B+ tree data structure is detected, and then it is determined whether performing the first insert operation would block a second insert operation in a second transaction concurrent with the first transaction. At least one empty second data page is created in response to determining that the second insert operation would be blocked by the first insert operation. The B+ tree data structure is updated to include the at least one second data page in the B+ tree data structure, and the updated index pages and second data page are committed to retentive storage. Thereafter, the first insert can be completed.

A method for designing an integrated circuit die, the method including generating a first layout for the die which includes at least one decap; and performing a post-processing decap insertion operation to add at least one additional decap in excess of the at least one decap, the operation including: for at least a portion of the first layout, identifying at least some of whichever locations in at least the portion have positive slack, as “candidate” locations; and inserting at least one additional decap at at least one respective location from among the “candidate” locations.

Methods and a system are provided for accelerating an operation in a B+-tree. A method including forming triplets, by a triplet manager. Each of the triplets includes a pointer to a leaf node, a lower bound of a key on the leaf node, and an upper bound of the key on the leaf node. The method further includes performing, by the triplet manager, a lookup operation on the triplets responsive to the operation to avoid traversals of intermediate nodes for the operation. The method also includes executing, by a processor, the operation in the B+-tree while avoiding the traversals of the intermediate nodes for the operation responsive to a result of the lookup operation. The operation is any one of an insertion operation, a deletion operation, and a search operation.

The invention discloses a paste method capable of automatically correcting errors and a device thereof, which are used for improving the program quality and the development efficiency. The method comprises the following steps: inserting Chinese text formatting source codes in a clipboard into an appointed position of a file; parsing the source codes and codes around the appointed position of the file to obtain corresponding code information; analyzing whether the insertion operation can generate errors or not based on the code information and obtaining the types of the generated errors; and correcting the errors according to the obtained types. The method can avoid the problems caused by taking variables representing different meanings as a variable for use because of paste, improve the program quality, automatically correct other compile errors and improve the development efficiency.

A method and a system maintain consistency of a cache memory, accessible by multiple independent processes. The processes can share common data, and perform simultaneous data searching operations optionally followed by providing the data to the processes, and data removal/insertion. The searching, removal and insertion operations are comprehensively executed once initiated by processes, excluding one another when they must operate on common data. Removal and insertion are reversible. Providing, removing and inserting the data have a finite execution duration, preventing locking. Particularly, insertion (including a step of releasing an input when a partition of the cache memory is full) if requiring browsing through the entire partition to make a selection, is possibly interrupted if maximum browsing time is reached. Here, the most appropriate input among those already browsed is released. Partition inputs are browsed exhaustively, which results from storing the last consulted address of the partition after each release.

The invention provides a searching and presenting software design method and system, and belongs to the field of search engine design and software systems. The method includes the steps that a request of a user is transferred to a search engine providing services through an application during the visiting or inquiring process of the user, and the application renders data fed back by the search engine again and represents a result to the user; when the user carries out deletion, updating or insertion operations, the request of the user is transferred to the search engine through corresponding operations forwarded by the application, and the search engine finishes the corresponding operations.

The invention discloses a hardware design structure of an overtime timer in a communication protocol processor, and relates to the technical field of protocol processor design. The hardware design structure mainly aims to solve the problems that the performance of the protocol processor is influenced due to the not-high precision and low working speed of the overtime timer in the conventional communication protocol processor. The hardware design structure of the invention comprises a control logic module, a timer module, a multi-path selector, a comparator module, or a logic module, an overtime table module and a filter. In the hardware design structure, software is replaced by a hardware structure to perform the searching, deleting and inserting operation of overtime table items, so that the performance of the overtime timer is greatly improved; and at the same time, the precision of the hardware timer is not limited by the highest frequency of an embedded processor by setting the timers with different precisions, so that higher precision can be achieved.

The invention provides a method for constructing side to side overlapping ring which includes steps as follows: processing joint operation to a polygon in two polygon groups and processing dispatch operation to a polygon in two polygon groups; wherein, the joint operation includes: searching a polygon ring to the polygon ring generated a crossing point through the crossing point in-out attribute; confirming whether inserting the polygon ring having no crossing point into the result ring aggregate according with relationship of a representation point and another polygon group; the dispatch operation includes: classifying the polygon; processing insert operation to the polygon existing a same color crossing point only and existing no any crossing point for obtaining an inner ring aggregate, an outer ring aggregate of the dispatch result and an inner ring aggregate waited split; requesting dispatch operation according with the crossing point and the waited dispatched inner ring aggregate and inserting the result in the outside ring aggregate of the dispatch result. The method had advantages of high efficiency and full construction process.

The invention discloses a collaborative editing consistency maintenance method for operating a bounding box. The collaborative editing consistency maintenance method comprises the following steps: firstly, on the basis of transfer semantics, defining a dependency relationship, and then, carrying out local operation processing and remote operation processing; and in the processes of the local operation processing and the remote operation processing, organizing inserting operations which have the dependency relationship into the bounding box, and controlling the volume of the bounding box, wherein the local operation comprises the inserting operation and deletion operations, and the deletion operations are subjected to descending sort according to an acting position relationship. The collaborative editing consistency maintenance method can support multiple users to collaboratively edit the same document in real time under a peer-to-peer network environment, can guarantee that the synergy results of multiple users are consistent, and can improve operation responsiveness.