DOUBLE HASHING WITH MULTIPLE PASSBITS

2003 ◽  
Vol 14 (06) ◽  
pp. 1165-1182 ◽  
Author(s):  
PAUL M. MARTINI ◽  
WALTER A. BURKHARD
Keyword(s):  
Collision Resolution ◽  
Storage Space ◽  
Analytical Results ◽  
Successful Search ◽  
Open Addressing ◽  
Runtime Performance ◽  
Search Length

We present a novel extension to passbits providing significant reduction to unsuccessful search lengths for open addressing collision resolution hashing. Both the experimental and analytical results presented demonstrate the dramatic reductions possible. This method does not restrict the hashing table configuration parameters and utilizes very little additional storage space per bucket. The runtime performance for insertion is essentially the same as for ordinary open addressing with passbits; the successful search lengths remain the same as for open addressing without passbits. For any given loading factor, the unsuccessful search length can be made to be arbitrarily close to one bucket access.

Indirect measurements in micro-space with the EM

1995 ◽  
Vol 53 ◽  
pp. 598-599
Author(s):  
Sterling P. Newberry
Keyword(s):  
Electron Microscope ◽  
Standard Model ◽  
Particle Physics ◽  
Information Storage ◽  
Storage Space ◽  
Indirect Measurements ◽  
Storage And Retrieval ◽  
Adequate Information ◽  
Compelling Reason ◽  
The Standard Model

At the 1958 meeting of our society, then known as EMSA, the author introduced the concept of microspace and suggested its use to provide adequate information storage space and the use of electron microscope techniques to provide storage and retrieval access. At this current meeting of MSA, he wishes to suggest an additional use of the power of the electron microscope.The author has been contemplating this new use for some time and would have suggested it in the EMSA fiftieth year commemorative volume, but for page limitations. There is compelling reason to put forth this suggestion today because problems have arisen in the “Standard Model” of particle physics and funds are being greatly reduced just as we need higher energy machines to resolve these problems. Therefore, any techniques which complement or augment what we can accomplish during this austerity period with the machines at hand is worth exploring.

PERANCANGAN DAN IMPLEMENTASI ALGORITMA ELIAS GAMMA CODE UNTUK MENGKOMPRESI RECORD DATABASE PADA APLIKASI RANGKUMAN PENGETAHUAN UMUM LENGKAP

2019 ◽  
Vol 3 (1) ◽  
Author(s):  
Hikka Sartika ◽  
Taronisokhi Zebua
Keyword(s):  
Compression Ratio ◽  
General Public ◽  
Storage Capacity ◽  
Storage Space ◽  
File Size ◽  
Compression Technique ◽  
Code Algorithm ◽  
Database File ◽  
Large File

Storage space required by an application is one of the problems on smartphones. This problem can result in a waste of storage space because not all smartphones have a very large storage capacity. One application that has a large file size is the RPUL application and this application is widely accessed by students and the general public. Large file size is what often causes this application can not run effectively on smartphones. One solution that can be used to solve this problem is to compress the application file, so that the size of the storage space needed in the smartphone is much smaller. This study describes how the application of the elias gamma code algorithm as one of the compression technique algorithms to compress the RPUL application database file. This is done so that the RPUL application can run effectively on a smartphone after it is installed. Based on trials conducted on 64 bit of text as samples in this research it was found that compression based on the elias gamma code algorithm is able to compress text from a database file with a ratio of compression is 2 bits, compression ratio is 50% with a redundancy is 50%. Keywords: Compression, RPUL, Smartphone, Elias Gamma Code

IMPLEMENTASI ALGORITMA LEVENSTEIN DALAM MENGKOMPRESI TEKS PADA APLIKASI RANGKUMAN PENGETAHUAN ALAM LENGKAP

2019 ◽  
Vol 3 (1) ◽  
Author(s):  
Winda Winda ◽  
Taronisokhi Zebua
Keyword(s):  
Compression Ratio ◽  
Mobile Application ◽  
Storage Space ◽  
Compression Technique ◽  
The Public ◽  
Natural Knowledge ◽  
Database Size ◽  
Text Database

The size of the data that is owned by an application today is very influential on the amount of space in the memory needed one of which is a mobile-based application. One mobile application that is widely used by students and the public at this time is the Complete Natural Knowledge Summary (Rangkuman Pengetahuan Alam Lengkap or RPAL) application. The RPAL application requires a large amount of material storage space in the mobile memory after it has been installed, so it can cause this application to be ineffective (slow). Compression of data can be used as a solution to reduce the size of the data so as to minimize the need for space in memory. The levestein algorithm is a compression technique algorithm that can be used to compress material stored in the RPAL application database, so that the database size is small. This study describes how to compress the RPAL application database records, so as to minimize the space needed on memory. Based on tests conducted on 128 characters of data (200 bits), the compression results obtained of 136 bits (17 characters) with a compression ratio is 68% and redundancy is 32%.Keywords: compression, levestein, aplication, RPAL, text, database, mobile

Preliminary analytical results for a new U.S. Geological Survey Devonian Ohio Shale Standard SDO-1

1978 ◽  
Author(s):  
Joel S. Leventhal ◽  
J.G. Crock ◽  
W. Mountjoy ◽  
J.A. Thomas ◽  
V.E. Shale ◽  
...  
Keyword(s):  
Geological Survey ◽  
Analytical Results
Sign in / Sign up

Export Citation Format

Share Document