Distributed Processes on Tree Hash

We propose Tree Hash to reduce bucket overflow, which is one of the inherent problems in dynamic hash techniques. In this investigation, we dicuss how to improve efficien cy of Tree Hash mechanism, i.e., we assume multiple users under concurrency control over distributed multiple servers. Then we discuss how to obtain efficiency while avoiding overhead caused by concurrency control. Key words Tree Hash, Linear Hash, transaction, concurrency control, distributed process

• Type: Conference
• Year: 2006
• Where: COMPSAC
• Authors: Kyosuke Yasuda, Takao Miura, Isamu Shioya
• Keywords: COMPSAC 2006, Concurrency Control, Software Engineering, Tree Hash, Tree Hash Mechanism