 Method, system, program, and data structure for cleaning a database table |
| OF THE PREFERRED EMBODIMENTS In the following description, reference is made to the accompanying ... |
|
| Hosting a network service on a cluster of servers using a single-address image |
| The present invention provides methods and apparatus for hosting a network service on a cluster of ... |
|
| Computer system for creating semantic object models from existing relational database schemas |
| The present invention is a computer system programmed to automatically create a semantic object ... |
|
| Integrated customer interface for web based data management |
| The present invention is directed to a Web-based, integrated customer interface system for data ... |
|
| Graphical user interface for relational database |
| Referring now to FIG. 1, there is illustrated a block diagram describing an exemplary computer ... |
|
| Selection and storage of policies in network management |
| The present invention is directed to the user interface and policy loading aspects of a policy-... |
|
| Intelligent agent with negotiation capability and method of negotiation therewith |
| OF THE ILLUSTRATED EMBODIMENTS Turning to the Drawing, wherein like parts are denoted by like ... |
|
|
Method for accessing a memory unit in which sequences of notes are stored, corresponding memory unit and corresponding program
| Details |
Inventors: Rabaioli, Giovanni;
Assignee: Siemens Aktiengesellschaft (Munich, DE)
Primary Examiner: Vo; Tim
Assistant Examiner: Ly; Cheyne
Attorney, Agent or Firm: Staas & Halsey LLP
A method employs a bit sequence having a plurality of successive bits is stored in a write mode in a memory unit for a data value of a datum. The bit positions are each allocated to a data set which contains a data field for storing the datum. This measure enables logic operations to be carried out very rapidly. |
|
DETAILED DESCRIPTION According to an aspect of the present invention, there is provided a simple method for accessing a memory unit in which a sequence of notes is stored, which method makes it possible, in particular, to process the sequence of notes rapidly.
A corresponding memory unit and a corresponding program are also to be specified.
The invention is based on the recognition that it is possible to note a data set with just a single bit.
Each data set must be allocated precisely one bit position in a bit sequence for this purpose.
A procedure of this type first of all yields immediate advantages when linking two sequences of notes or when processing a sequence of notes with a logic operation.
It is indeed possible to link or process 32 notes with a logic operation or processing operation given a data word width of 32 bits.
This is 32 times the current usual linking speed with the same processor.
The invention is also based on the recognition that the allocation of each data set to a different bit position, especially if there are a large number of data sets, only appears to be associated with significantly higher memory complexity.
It could be assumed, for example, that given one million data sets, a sequence of notes of one million bits would have to be stored if only the last data set was to be noted.
This can be avoided, however, with a compression method for the bit sequence.
Memory space can be saved in any case in comparison with known sequences of notes even without compression if a very large number, relative to the total number of data sets, of data sets in the sequence of notes are noted.
If, for example, a data word of 32 bits is required in a known method for noting a data set used here for the purposes of comparison, less memory space will be required for the bit sequence in accordance with the method according to the invention if more than 1/32 of the total number of data sets in the sequence of notes have to be noted.
A known method could also be used in such cases with sequences of notes having very few entries
|
| Related patents |
|
|
Development system with application browser user interface
The present invention is embodied in a component-based, rapid application development (RAD) Java environment. The system's user interface is structured to increase one's ...
|
|
|
Multi-processor JAVA subsystem
OF THE INVENTION Reference will now be made in detail to the preferred embodiments of the invention, examples of which are illustrated in the accompanying drawings. W...
|
|
|
Context programming in object-oriented environments
The present invention is directed to control of time structured or other context related data by adding a context in object-oriented programming environments. In ...
|
|
|
Method, system, and program for mapping standard application program interfaces (APIs) to user interface APIs
OF THE PREFERRED EMBODIMENTS In the following description, reference is made to the accompanying drawings which form a part hereof, and which illustrate several ...
|
|
|
Method and apparatus for centralized management of a storage virtualization engine and data services
In accordance with the principles of the invention, an SVE control system uses management software at a central service processor to control data services and a storage ...
|
|
|
Prime implicates and query optimization in relational databases
The improved normalization methodology of the present invention is based on Socher's minimization methodology (see Socher, R., above). Socher's minimization method uses ...
|
|
|
Method for transmitting and displaying an interchannel interval image in a cable system
A system and method is provided for displaying an image in a cable system including a cable headend having a plurality of cable channels and a subscriber unit with a ...
|
|
|
Method and apparatus for implementing a shared message queue using a list structure
In general, the present invention contemplates a method and apparatus for implementing a shared message queue using a list structure. A put list is defined comprising a ...
|
|
|
Method and apparatus for erasing data after tampering
According to one aspect of the invention, a method is provided for storing data on a storage unit in a manner that allows modification of the data only if a tamper ...
|
|
|
Data structure and storage and retrieval method supporting ordinality based searching and data retrieval
The present invention is a data structure and related data storage and retrieval method that rapidly provides a count of elements stored or referenced by a hierarchical ...
|
|
|
Databases 
