Achyutuni, K. J., Omiecinski, E., Navathe, S. B.: Two techniques for On-line Index Modification in Shared Nothing Parallel Databases. Procs ACM SIGMOD (1996)  Home/Search   Document Details and Download   Summary   Related Articles   Check

....such situations, and such reorganizations should be performed online without requiring the system to be quiescent [8] As the data is moving from hotspot PEs to cold PEs, the corresponding indexes have to be modified too. Thus, data reorganization should also deal with the index modification [1]. In this paper, we propose a new technique to facilitate more efficient data reorganization. It is based on index modification minimization, where the amount of data to be migrated (migration unit) corresponds to the entirety of one or more index branches at a source PE. In this case, it would ....

....outlines the issues involved in changing all references to a record when its primary identifier is changed due to a record move. The techniques of [7, 12] are proposed for centralized DBMS and require the use of locks, where using locks during reorganization can degrade performance significantly [1]. 1] presents two alternatives for performing the necessary index modifications, called one at a time OAT page movement and BULK page movement. However, both techniques depend on the conventional Btree algorithms that can lead to considerable index modification cost [5] 11] suggests using the ....

[Article contains additional citation context not shown here]

Achyutuni, K. J., Omiecinski, E., Navathe, S. B.: Two techniques for On-line Index Modification in Shared Nothing Parallel Databases. Procs ACM SIGMOD (1996)

....serious drawback during reorganization and database updates. Any changes and underflow overflow in a B tree has to be propagated to all copies of the B tree. 4, 3, 5, 6] proposed various techniques aimed at reducing the cost of maintaining replicated search structures and increasing concurrency. [1] studied two methods to maintain indexes during online reorganization: OAT (One At a Time page movement) moves one data page at a time from the source PE to the destination PE and modifies the indexes for records in that page, while BULK (bulk page movement) copies all the data to be moved at the ....

K.J. Achyutuni, E. Omiecinski, and S.B. Navathe. Two techniques for on-line index modification in shared nothing parallel databases. In Proc. ACM SIGMOD International Conference on Management of Data, 1996.

....the system to be quiescent [WZS91 SWZ93] Additionally, to achieve efficient query and transaction evaluation, data at each PE are indexed. Therefore, data reorganization should satisfactorily deal with the index modification as moving data from hot spot PEs to cold PEs (infrequently accessed) [AON96]. In [FK99] they propose an online heat balancing strategy for parallel indexed database, in which the data migration process is based on distributing the given heat as evenly as possible across the system PEs. In the paper, we extend their work by increasing the alternatives during the heat ....

....the issues involved in changing of all references to a record when its primary identifier is changed due to a record move. The techniques in the [SD92, ZS96] are limited to centralized DBMS and require the use of locks, where using locks during reorganization can degrade performance significantly [AON96]. In [AON96] they examined the problem of online index reorganization. They present two alternatives for performing the necessary index modifications, called one at a time OAT page movement and BULK page movement. While these alternatives are extremes on the spectrum of the granularity of data ....

[Article contains additional citation context not shown here]

K.J. Achyutuni, E. Omiecinski, and S. B. Navathe. Two techniques for On-line Index Modification in Shared Nothing Parallel Databases. Procs ACM SIGMOD 1996.

....should be performed online without requiring the system to be quiescent [WZS91 SWZ93] Additionally, as the data moving from hot spot PEs to cold PEs, the corresponding indexes have to be modified too. Therefore, data reorganization should also satisfactorily deal with the index modification [AON96]. In [FK99 1 FK99 2] they propose online heat balancing strategies for parallel indexed database, in which the data migration process is based on distributing the given heat as evenly as possible across the system PEs. However, it has been observed that the migration cost produced by their ....

....the issues involved in changing of all references to a record when its primary identifier is changed due to a record move. The techniques in the [SD92, ZS96] are limited to centralized DBMS and require the use of locks, where using locks during reorganization can degrade performance significantly [AON96]. In [AON96] they examined the problem of online index reorganization. They present two alternatives for performing the necessary index modifications, called one at a time OAT page movement and BULK page movement. While these alternatives are extremes on the spectrum of the granularity of data ....

[Article contains additional citation context not shown here]

K.J. Achyutuni, E. Omiecinski, and S. B. Navathe. "Two techniques for On-line Index Modification in Shared Nothing Parallel Databases". Procs ACM SIGMOD 1996.

....the system to be quiescent [WZS91 SWZ93] Additionally, to achieve efficient query and transaction evaluation, data at each PE are indexed. Therefore, data reorganization should satisfactorily deal with the index modification as moving data from hot spot PEs to cold PEs (infrequently accessed) [AON96]. In this paper, we propose an online heat balancing strategy for parallel indexed database on shared nothing system, in which the data migration process itself is based on the heat statistics generated by the access pattern that may be directed to the distributed index structure of the system. ....

....the issues involved in changing of all references to a record when its primary identifier is changed due to a record move. The techniques in the [SD92, ZS96] are limited to centralized DBMS and require the use of locks, where using locks during reorganization can degrade performance significantly [AON96]. In [AON96] they examined the problem of online index reorganization. They present two alternatives for performing the necessary index modifications, called oneat a time OAT page movement and BULK page movement. The OAT moves one data page at a time, and modify the indexes for records in that ....

[Article contains additional citation context not shown here]

K.J. Achyutuni, E. Omiecinski, and S. B. Navathe. Two techniques for On-line Index Modification in Shared Nothing Parallel Databases. Proceedings ACM SIGMOD 1996.

.... of records can be found in [OLS92] OLS94] Resequencing (compacting) of primary B trees is dealt with in [ZS96b] Smi90] Repartitioning distributed data in Tandem s NON STOP SQL is described in [Tro96] Moving an RID organization to another site in a parallel database is discussed in [AON96] Reclustering an RID organization, the problem treated in this paper, is discussed in [SI96] In [SI96] a new utility for reclustering an RID organization which will soon be available in IBM s DB2 is described. This algorithm constructs a copy of the relation in another area, noting the LSN of ....

Kiran J. Achyutuni, Edward Omiecinski, and Shamkant B. Navathe. Two techniques for on-line index modification in shared nothing parallel databases. In Proceedings of ACM/SIGMOD Annual Conference on Management of Data, pages 125-- 136, Montreal, 1996.

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