W. Litwin, M. Neimat, and D. Schneider. LH* - a scalable, distributed data structure. ACM Transactions on Database Systems, 21(4):480--525, 1996. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents
The Quest for Balancing Peer Load in Structured.. - Aberer, Datta, Hauswirth (2003) (3 citations) (Correct)
....on replication nor on search efficiency. The authors mention that there might be negative effects on search efficiency with their approach. Substantial work on distributed data access structures has also performed in the area of distributed databases on scalable data access structures, such as [16, 17]. This work is apparently relevant, but the existing approaches apply to a different physical and application environment. Databases are distributed over a moderate number of fairly stable database servers and workstation clusters. Thus reliability is assumed to be high and replication is used ....
W. Litwin, M. Neimat, and D. A. Schneider. LH* -- A Scalable, Distributed Data Structure. ACM Transactions on Database Systems, 21(4):480--525, 1996.
An Optimal Algorithm for Online Reorganization of Replicated.. - Honicky, Miller (2003) (Correct)
....for each server. In a system with thousands of clients, a small, simple distribution mechanism is a big advantage. 2 Related Work Litwin, et al. describe a class of data structures and algorithms on those data structures which the authors dubbed Scalable Distributed Data Structures (SDDS) [18]. There are three main properties which a data structure must meet in order to be considered a SDDS. 1. A file expands to new servers gracefully, and only when servers already used are efficiently loaded. 2. There is no master site that object address computations must go through, e.g. to ....
W. Litwin, M.-A. Neimat, and D. A. Schneider. LH*---a scalable, distributed data structure. ACM Transactions on Database Systems, 21(4):480--525, 1996.
A Fast Algorithm for Online Placement and Reorganization of.. - Honicky, Miller (2003) (3 citations) (Correct)
....for each server. In a system with thousands of clients, a small, simple distribution mechanism is a big advantage. 2 Related Work Litwin, et al. describe a class of data structures and algorithms on those data structures which the authors dubbed Scalable Distributed Data Structures (SDDS) [20]. There are three main properties which a data structure must meet in order to be considered a SDDS. 1. A file expands to new servers gracefully, and only when servers already used are efficiently loaded. This paper will appear at the 17th International Parallel and Distributed Processing ....
W. Litwin, M.-A. Neimat, and D. A. Schneider. LH*---a scalable, distributed data structure. ACM Transactions on Database Systems, 21(4):480--525, 1996.
Cluster-based Optimizations for Distributed Hash Tables - Considine (2002) (Correct)
....other load balancing schemes. 1 Introduction Distributed hash tables (DHTs) have seen a recent surge in interest as a key building block in completely decentralized and distributed applications. Distributed data structures bearing the name distributed hash table have been known for many years [5]. However, it has been the new wave of DHTs (Tapestry [10] Chord [9] CAN [7] etc) which has been the focus of new interest in the research community. These DHTs (and their derivatives) are desirable since they all have decentralization, scalability, robustness and short overlay level paths. In ....
LITWIN,W.,NEIMAT, M.-A., AND SCHNEIDER, D. A. LH* a scalable, distributed data structure. ACM Transactions on Database Systems (TODS) 21, 4 (1996), 480--525.
Cluster-based Optimizations for Distributed Hash Tables - Considine (2002) (Correct)
....other load balancing schemes. 1 Introduction Distributed hash tables (DHTs) have seen a recent surge in interest as a key building block in completely decentralized and distributed applications. Distributed data structures bearing the name distributed hash table have been known for many years [5]. However, it has been the new wave of DHTs (Tapestry [10] Chord [9] CAN [7] etc) which has been the focus of new interest in the research community. These DHTs (and their derivatives) are desirable since they all have decentralization, scalability, robustness and short overlay level paths. In ....
LITWIN, W., NEIMAT, M.-A., AND SCHNEIDER, D. A. LH* a scalable, distributed data structure. ACM Transactions on Database Systems (TODS) 21, 4 (1996), 480--525.
Viceroy: A Scalable and Dynamic Emulation of the Butterfly - Malkhi, Naor, Ratajczak (2002) (97 citations) (Correct)
.... linkage cost data structures are competitive with our scheme in every way except for congestion [9, 14] Proposals for distributed data structures typically address the problem of join and leave complexity and state partitioning, but either require centralized control, or do not address congestion [4, 12]. There are other works that have looked at the problem of dynamic network construction with di erent emphases than ours. Pandurangan et al. address in [15] the problem of dynamically constructing a low degree, logarithmic diameter network under a probabilistic model of arrival and departure; ....
W. Litwin, M.A. Neimat, D. A. Schneider. \LH*-A scalable, distributed data structure". ACM Transactions on Database Systems, Vol. 21(4), 1996, pp. 480-525.
A Cooperative File System - Dabek (2001) (Correct)
....come at a price: complexity. For example, OceanStore uses a Byzantine agreement protocol for con ict resolution, and a complex protocol based on Plaxton trees [27] to implement the location service [39] OceanStore assumes that the core system will be maintained by commercial providers. LH [17] is a distributed data structure based on linear hashing which supports constant time insertion and lookup of objects. Data stored in LH is distributed to nodes via a split operation which occurs when a node reaches its capacity; splitting allows LH to maintain a high utilization (a property not ....
Witold Litwin, Marie-Anna Neimat, and Donovan A. Schneider. LH* | a scalable, distributed data structure. ACM Transactions on Database Systems, 21(4):480-525, 1996.
Centre for Advanced Information System - Applied (Correct)
....as threads and multithreads. As a future work, we would like to do the performance evaluation of our algorithm to examine our claim of increase in concurrency and to measure the overheads associated with our system. Another direction of research is to study the model in a distributed environment [18] where a linear hash structure can be spread over a number of machines. ....
Litwin, W., Neimat, M., Schneider, D., LH* - A Scalable, distributed Data Structure, ACM Transactions on Database Systems, Vol. 21, No. 4, pp. 480-525, December 1996.
Evaluation of LH*LH for a Multicomputer Architecture - Pimentel, Hertzberger (1999) (Correct)
.... the number of stored data elements) and it should grow and shrink incrementally rather than reorganising itself totally on a regular basis (e.g. rehashing of all distributed records) For distributed memory multicomputers, a number of Scalable Distributed Data Structures (SDDSs) have been proposed [7]. In these distributed storage methods, the processors are divided into clients and servers. A client manipulates the data by inserting data elements, searching for them or removing them. A server stores a part of the data, called a bucket, and receives data access requests from clients. ....
....request to the correct server and for updating the client s image. For an efficient SDDS, it is essential that the communication needed for data operations (retrieval, insertion, etc. is minimised while the amount of data residing at the server nodes (i.e. the load factor) is well balanced. In [7], Litwin et al. propose an SDDS, called LH , which addresses the issue of low communication overhead and balanced server utilisation. This SDDS is a generalisation of Linear Hashing (LH) 6] which will be elaborated upon in the next section. For LH , insertions usually require one message (from ....
[Article contains additional citation context not shown here]
W. Litwin, M-A. Neimat, and D. Schneider. LH*: A scalable, distributed data structure. ACM Transactions on Database Systems, 21(4):480--526, Dec. 1996.
Semantic Concurrency Control In Linear Hash Structure Using.. - Sanjay Kumar (Correct)
....Split write delete write TD6 TC6 TC6 L1 L0 level = 1 next = 20 performance evaluation of our algorithm to examine our claim of increase in concurrency and to measure the overheads associated with our system. Another direction of research is to study the model in a distributed environment [10] where a linear hash structure can be spread over a number of machines. ....
Litwin, W., Neimat, N. Schneider, LH* - A Scalable, distributed Data Structure, ACM Transactions on Database Systems, 21(4), pp. 480-525, Dec. 1996.
An Overview of Semantic Concurrency Control in Linear Hash.. - Madria, Tubaishat (Correct)
....it has not been reported here. As a future work, we would like to do the performance evaluation of our algorithm to examine our claim of increase in concurrency and to measure the overheads associated with our system. Another direction of research is to study the model in a distributed environment [10] where a linear hash structure can be spread over a number of machines. ....
Litwin, W., Neimat, N. Schneider, LH* - A Scalable, distributed Data Structure, ACM Transactions on Database Systems, 21(4), pp. 480-525, Dec., 1996.
Viceroy: Scalable Emulation of Butterfly Networks for.. - Malkhi, Naor, Ratajzcak (2003) Self-citation (Scalable) (Correct)
No context found.
W. Litwin, M.A. Neimat, and D. A. Schneider. LH* - a scalable, distributed data structure. ACM Transactions on Database Systems, 21(4):480--525, 1996.
Symphony: Distributed Hashing in a Small World - Manku, Bawa, Raghavan (2003) (32 citations) Self-citation (Distributed) (Correct)
....ring and one connection with a node in the ring above. Routing requires O(log n) hops on average. DHT s over clusters have been extensively studied by the SDDS (Scalable Distributed Data Structures) community in the 90 s. The term was coined by Litwin, Niemat and Shneider in their seminal paper [12]. Gribble et al. 7] implemented a highly scalable, fault tolerant and available SDDS on a cluster for Internet services. The requirements for a DHT over wide area networks are very different. 2.2 Small World Networks Milgram conducted a celebrated experiment [14] that demonstrated the Small ....
W. Litwin, M. Neimat, and D. A. Schneider. Lh*-a scalable, distributed data structure. ACM Transactions on Database Systems, 21(4):480--525, 1996.
Performance Evaluation of the LH*lh Scalable, Distributed.. - Gupta, Modi, Pimentel (2001) Self-citation (Scalable Structure) (Correct)
....client s image. For an efficient SDDS, it is essential that the network communication needed for data operations (retrieval, insertion, etc. is minimized while the amount of data residing at the servers (i.e. the load factor) is well balanced. An example of an SDDS addressing these issues is LH [5]. This SDDS is a distributed variant of Linear Hashing (LH) 4] which will be elaborated upon in the next section. For LH , insertions usually require one message (from client to server) and three messages in the worst case. Data retrieval requires one extra message as the requested data has to ....
....modulo) should be incremented. The process of shrinking is similar to the growing of the LH data structure. In this study, we limit our discussion to the splitting within SDDSs. 3. THE LH LH SDDS The LH SDDS is a generalization of Linear Hashing (LH) to a distributed memory parallel system [5]. In this paper, we focus on a particular variant of LH , called LH LH [2, 3] The LH LH data is stored over a number of server processes and can be accessed through dedicated client processes. These clients form the interface between an application and LH LH. For this study, we assume that each ....
[Article contains additional citation context not shown here]
W. Litwin, M.-A. Neimat, and D. Schneider. LH*: A scalable, distributed data structure. ACM Transactions on Database Systems, 21(4):480--526, Dec. 1996.
D1HT: A Distributed One Hop Hash Table - And (Correct)
No context found.
W. Litwin, M. Neimat, and D. Schneider. LH* - a scalable, distributed data structure. ACM Transactions on Database Systems, 21(4):480--525, 1996.
D1HT: A Distributed One Hop Hash Table - Monnerat, Amorim (2005) (Correct)
No context found.
W. Litwin, M. Neimat, and D. Schneider. LH* - a scalable, distributed data structure. ACM Transactions on Database Systems, 21(4):480--525, 1996.
OverCite: A Cooperative Digital Research Library - Jeremy Stribling Isaac (2005) (3 citations) (Correct)
No context found.
LITWIN,W.,NEIMAT, M.-A., AND SCHNEIDER, D. A. LH* --- a scalable, distributed data structure. ACM Transactions on Database Systems 21, 4 (1996), 480--525.
OverCite: A Cooperative Digital Research Library - Stribling, Councill, Li.. (2005) (3 citations) (Correct)
No context found.
LITWIN,W.,NEIMAT, M.-A., AND SCHNEIDER, D. A. LH* --- a scalable, distributed data structure. ACM Transactions on Database Systems 21, 4 (1996), 480--525.
Handling Heterogeneity in Shared-Disk File Systems - Changxun Wu And (2003) (1 citation) (Correct)
No context found.
W. Litwin, M. Neimat, and D. A. Schneider. LH* --- a scalable, distributed data structure. ACM Transactions on Database Systems, 21(4), 1996.
Achieving Performance Consistency in Heterogeneous Clusters - Changxun Wu And (Correct)
No context found.
W. Litwin, M. Neimat, and D. A. Schneider. LH* --- a scalable, distributed data structure. ACM Transactions on Database Systems, 21(4), 1996.
Online Balancing of Range-Partitioned Data with.. - Ganesan, Bawa.. (2004) (9 citations) (Correct)
No context found.
W. Litwin, M.-A. Neimat, and D. A. Schneider. LH* -- A scalable, distributed data structure. ACM Transactions on Database Systems, 21(4):480--525, 1996.
Replication under Scalable Hashing: A Family of Algorithms.. - Honicky, Miller (2004) (1 citation) (Correct)
No context found.
W. Litwin, M.-A. Neimat, and D. A. Schneider. LH*---a scalable, distributed data structure. ACM Transactions on Database Systems, 21(4):480--525, 1996.
Multifaceted Simultaneous Load Balancing in DHT-based.. - Aberer, Datta, Hauswirth (2004) (1 citation) (Correct)
No context found.
W. Litwin, M. Neimat, and D. A. Schneider. LH* -- A Scalable, Distributed Data Structure. ACM Transactions on Database Systems, 21(4):480--525, 1996.
Routing Networks for Distributed Hash Tables - Manku (2003) (16 citations) (Correct)
No context found.
W. Litwin, M. Neimat, and D. A. Schneider. LH* - A scalable, distributed data structure. ACM Transactions on Database Systems, 21(4):480--525, 1996.
Relieving Hot Spots on the World Wide Web - Panigrahy (1997) (4 citations) (Correct)
No context found.
Witold Litwin, Marie-Anne Neimat and Donovan A. Schneider. LH -A Scalable, Distributed Data Structure. ACM Transactions on Database Systems, Dec. 1996
First 50 documents
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC