E. Omiecinski. Incremental file reorganization schemes. In International Conference on Very Large Data Bases, pages 346--357, 1985. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Dynamic Hierarchical Data Clustering And Efficient On-Line Database .. - Zou (1996) (1 citation) (Correct)
....keeping the database available Clustering is not the only reason to migrate from one structure to another. Changes of database schema and changes of user query patterns, etc. can all lead to database reorganization. Although there has been a lot of research on on line database reorganization [37, 28, 29, 30, 31, 34], the results have some unsatisfactory or incomplete aspects. For example, it is shown in [34] how to do the conversion between two physical storage structures correctly by encapsulating all the reference changes in one transaction, but it is still not clear how to do it efficiently. On line ....
....a portion of the database as possible at one time to avoid interfering user transactions. In addition, an important contribution of the thesis is to integrate on line reorganization with standard concurrency and recovery algorithms used in large modern DBMSs. Much of the research in the past [29, 30, 31] does not take this into account, making it unusable for practitioners. The reorganization algorithms in this thesis are carefully designed, and can be easily integrated into existing database systems. Efficient Reference Updating Algorithm The reference updating algorithm makes the updates ....
E. Omiecinski. Incremental file reorganization schemes. In International Conference on Very Large Data Bases, pages 346--357, 1985.
Two Techniques for On-Line Index Modification in Shared.. - Kiran Achyutuni (1996) (6 citations) Self-citation (Omiecinski) (Correct)
....conducted the experiments. In section 6, we make a performance evaluation of BULK and OAT. In section 7, we make a qualitative comparison of BULK and OAT, and state our conclusions in section 8. 2 Related Work Though there has been much work in the area of on line reorganization in recent years [20, 9, 16, 6, 11, 12, 7, 8], there has hardly been any work that considers index modification overhead during on line reorganization. Perhaps [11] is the only paper that discusses a solution for on line index modification. However, the techniques in the paper are limited to centralized databases and requires the use of ....
E. Omiecinski. Incremental file reorganization schemes. In Proc. 11th Intl. Conf. Very Large Data Bases, pages pp. 346--357, San Mateo, CA, Aug. 1985. Morgan Kaufmann Publishers.
On-line Dynamic Clustering of Individual Objects - Pinkston (1994) (Correct)
No context found.
Omiecinski, E., "Incremental File Reorganization Schemes," Proceedings of the 11th International Conference on Very Large Data Bases, 1985. Proves that the optimal file reorganization problem is NP-complete. Static and dynamic reoganization algorithms are given.
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