Fast LH

Linear Hashing is a widely used and efficient version of extensible hashing. A distributed version of Linear Hashing is LHast that stores key-indexed records on up to hundreds of thousands of sites in a distributed system. LHast implements the dictionary data structure efficiently since it does not...

Full description

Saved in:
Bibliographic Details
Main Authors: Chabkinian, Juan, Schwarz, Thomas
Format: Conference Proceeding
Language:English
Subjects:
Algorithm design and analysis
Cloud Computing
Data structures
Linear Hashing
Merging
Niobium
Quality of service
Radiation detectors
Scalable Distributed Data Structure
Servers
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Linear Hashing is a widely used and efficient version of extensible hashing. A distributed version of Linear Hashing is LHast that stores key-indexed records on up to hundreds of thousands of sites in a distributed system. LHast implements the dictionary data structure efficiently since it does not use a central component for the key-based operations of insertion, deletion, actualization, and retrieval and for the scan operation. LHast allows a client or a server to commit an addressing error by sending a request to the wrong server. In this case, the server forwards to the correct server directly or in one more forward operation. We discuss here methods to avoid the double forward, which is rare but might breach quality of service guarantees. We compare our methods with LHast P2P that pushes information about changes in the file structure to clients, whether they are active or not.
ISSN:1550-6533
2643-3001
DOI:10.1109/SBAC-PAD.2013.15