Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 4 of 4 for “"LINEAR HASHING"”.
-
Performance Study of Concurrent Search Trees and Hash Algorithms on Multiprocessors Systems
… of concurrent algorithms for B-trees and linear hashing. B-trees are widely used as an access method for large, single key, database files, stored in lexicographic order on secondary storage devices. Linear hashing is a fast and reliable hash algorithm, suitable for accessing records …
-
Bit-Flip Aware Data Structures for Phase Change Memory
… to build hash based dictionary structures for Linear Hashing and Spiral Storage. Finally, the thesis presents Gray counters, close to bit-flip optimal counters that even enable age- based wear leveling with counters managed by the Non-Volatile Random Access Memories themselves instead of by the …
-
Workload-aware network processors : improving performance while minimizing power consumption
… promising improvements over the previous work. Hashing based schedulers have very low overhead and are very suitable for data rates of 100 Gbps and even beyond.
-
ΒΑΣΙΚΕΣ ΔΟΜΕΣ ΔΕΔΟΜΕΝΩΝ ΚΑΙ Η ΕΦΑΡΜΟΓΗ ΤΟΥΣ ΣΤΗΝ ΥΠΟΛΟΓΙΣΤΙΚΗ ΓΕΩΜΕΤΡΙΑ ΚΑΙ ΣΤΗΝ ΑΝΑΚΤΗΣΗ ΠΛΗΡΟΦΟΡΙΑΣ
THE DATA STRUCTURING PROBLEM IS THE SELECTION OF A CONCRETE IMPLEMENTATION OF AN ABSTRACT DATA TYPE, IN ORDER TO DEAL EFFICIENTLY WITH ALGORITHMIC PROBLEMS.AN ABSTRACT DATA TYPE IS A SET OF OBJECTS TOGETHER WITH A SET OF ADMISSIBLE OPERATIONS ON IT. THE PRESENT WORK IS A STUDY OF ELEMENTARY DATA …