ACM Home Page
Please provide us with feedback. Feedback
On-line reorganization in object databases
Full text PdfPdf (284 KB)
Source International Conference on Management of Data archive
Proceedings of the 2000 ACM SIGMOD international conference on Management of data table of contents
Dallas, Texas, United States
Pages: 58 - 69  
Year of Publication: 2000
ISBN:1-58113-217-4
Also published in ...
Authors
Mohana K. Lakhamraju  University of California, Berkeley CA
Rajeev Rastogi  Bell Labs, Murray Hill, NJ
S. Seshadri  Bell Labs, Murray Hill, NJ
S. Sudarshan  Indian Institute of Technology, Bombay, India
Sponsor
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 33,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/342009.335381
What is a DOI?

ABSTRACT

Reorganization of objects in an object databases is an important component of several operations like compaction, clustering, and schema evolution. The high availability requirements (24 × 7 operation) of certain application domains requires reorganization to be performed on-line with minimal interference to concurrently executing transactions.

In this paper, we address the problem of on-line reorganization in object databases, where a set of objects have to be migrated from one location to another. Specifically, we consider the case where objects in the database may contain physical references to other objects. Relocating an object in this case involves finding the set of objects (parents) that refer to it, and modifying the references in each parent. We propose an algorithm called the Incremental Reorganization Algorithm (IRA) that achieves the above task with minimal interference to concurrently executing transactions. The IRA algorithm holds locks on at most two distinct objects at any point of time. We have implemented IRA on Brahma, a storage manager developed at IIT Bombay, and conducted an extensive performance study. Our experiments reveal that IRA makes on-line reorganization feasible, with very little impact on the response times of concurrently executing transactions and on overall system throughput. We also describe how the IRA algorithm can handle system failures.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
AFG95
AON96
 
ARS+97
BKKK87
 
BLR+97
CWZ94
 
Edi96
B. Salzberg (Special Issue Editor). Special issue on online reorganization. IEEE Data Engineering Bulletin, 19(2), June 1996.
 
EGK95
 
JLR+94
KW93
 
LRSS99
M.K. Lakhamraju, R. Rastogi, S. Seshadri, and S. Sudarshan. On-line reorganization of objects. In Technical Report, Bell-labs, February 1999.
MN92
 
NOPH92
 
Omi96
E. Omiecinski. Concurrent file reorganization: Clustering, conversion and maintenance. IEEE Data Engineering Bulletin, 19(2), 1996.
SC92a
 
SC92b
 
SD92
TN91
WMK94
 
YNY94
ZS96a
 
ZS96b
C. Zou and B. Salzberg. Towards efficient online database reorganization. IEEE Data Engineering Bulletin, 19(2):33-40, June 1996.
 
ZS98


Collaborative Colleagues:
Mohana K. Lakhamraju: colleagues
Rajeev Rastogi: colleagues
S. Seshadri: colleagues
S. Sudarshan: colleagues

Peer to Peer - Readers of this Article have also read: