Hvasshovd et &. A continuously available and highly scalable transaction server. 4 th Intl. Workshop on High Perf. Trans. Systems, 1991.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....intrinsically more efficient for a distributed environment [T95a] Up till now, such schemes are used mainly for parallel or distributed database systems. The LH g schema is a logical scheme. When a node failure is detected, some existing schemes redistribute data over available nodes (e.g. [HST91], see also [T95a] for more references) In contrast, others replace the unavailable node with a spare node where the unavailable data are reconstructed. The latter principle seems more efficient for high availability, T95] One reason is that chances for a 2 node failure are typically greatly ....

Hvasshovd et &. A continuously available and highly scalable transaction server. 4 th Intl. Workshop on High Perf. Trans. Systems, 1991.

....LH g. Unlike grouping, striping schemes basically deteriorate the search performance, W96] ABC97] Insert performance is also affected. No other scheme using the concept of record grouping is known. When a node failure is detected, some existing schemes redistribute data over available nodes, [HST91], T95a] Others replace the unavailable node with a spare node where the unavailable data are reconstructed. The latter principle seems more efficient for high availability, T95] and the best approach when distributed data need to scale [LN96a] LH g falls into this class of schemes. Among ....

Hvasshovd et &. A continuously available and highly scalable transaction server. 4 th Intl. Workshop on High Perf. Trans. Systems, 1991.

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