Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
FAST SEARCH IN MAIN MEMORY DATABASES Anastasia Analyti & Sakti Pramanik *
 

Summary: FAST SEARCH IN MAIN MEMORY DATABASES
ABSTRACT
Anastasia Analyti & Sakti Pramanik *
Computer Science Department
Michigan State University
East Lansing, Michigan 48824
The objective of this paper is to develop and analyze
high performance hash based search methods for main
memory databasea. We define optimal search in main
memory databases as the search that requires at most
one key comparison to locate a record. Existing hashing
techniques become impractical when they are adapted
to yield optimal search in main memory databases be-
cause of their large directory size. Multi-directory hash-
ing techniques can provide significantly improved direc-
tory utilization over single-directory hashing techniques.
A multi-directory hashing scheme, called fast search
multi-directory hashing, and its generalization, called
controlled search multi-directory hashing, are presented.
Both methods achieve linearly increasing expected di-

  

Source: Analyti, Anastasia - Institute of Computer Science, Foundation of Research and Technology, Hellas

 

Collections: Computer Technologies and Information Sciences