Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

COMPSAC
2006
IEEE

favoriteEmaildiscussreport

122views Software Engineering» more COMPSAC 2006»

Distributed Processes on Tree Hash

13 years 8 months ago

Distributed Processes on Tree Hash

Download www.ieice.org

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

Kyosuke Yasuda, Takao Miura, Isamu Shioya

Real-time Traffic

COMPSAC 2006 | Concurrency Control | Software Engineering | Tree Hash | Tree Hash Mechanism |

claim paper

Related Content

» Implementing aggregation and broadcast over Distributed Hash Tables

» Implementing Range Queries with a Decentralized Balanced Tree over Distributed Hash Tables

» Balanced binary trees for ID management and load balance in distributed hash tables

» HashBased Structural Join Algorithms

» Fast hash table lookup using extended bloom filter an aid to network processing

» ScalParC A New Scalable and Efficient Parallel Classification Algorithm for Mining Large D...

» Blooming Trees for Minimal Perfect Hashing

» Ditherbased secure image hashing using distributed coding

» cPerfect Hashing Schemes for Binary Trees with Applications to Parallel Memories

Post Info
More Details (n/a)

Added	20 Aug 2010
Updated	20 Aug 2010
Type	Conference
Year	2006
Where	COMPSAC
Authors	Kyosuke Yasuda, Takao Miura, Isamu Shioya

Comments (0)