Article

Free access

On-line reorganization in object databases

Authors:

Mohana K. Lakhamraju,

Rajeev Rastogi,

S. SudarshanAuthors Info & Claims

SIGMOD '00: Proceedings of the 2000 ACM SIGMOD international conference on Management of data

Pages 58 - 69

https://doi.org/10.1145/342009.335381

Published: 16 May 2000 Publication History

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

[1]

L. Amsaleg, M. Franklin, and O. Gruber. Efficient incremental garbage collection for client-server object database systems. In Proceedings of the 21st VLDB Conference, September 1995.

Digital Library

[2]

K. Achyutuni, E. Omiecinski, and S. Navathe. Two techniques for on-line index modification in shared nothing parallel databases. In Proceedings of A CM SIGMOD Conference, pages 125-136, Montreal, June 1996.

Digital Library

[3]

S. Ashwin, P. Roy, S. Seshadri, A. Silberschatz, and S. Sudarshan. Garbage collection in object oriented databases using transactional cyclic reference counting. In Proceedings of the 23rd VLDB Conference, Athens, Greece, August 1997.

Digital Library

[4]

J. Banerjee, W. Kim, H. Kim, and H. F. Korth. Semantics and implementation of schema evolution in object-oriented databases. In Proceedings of A CM SIGMOD Conference, pages 311-322, 1987.

Digital Library

[5]

P. Bohannon, D. Lieuwen, R. Rastogi, S. Seshadri, A. Silberschatz, and S. Sudarshan. The architecture of the dali storage manager. Journal of Multi-Media Tools and Applications, 4(2), March 1997.

Digital Library

[6]

J.E. Cook, A.L. Wolf, and B.G. Zorn. Partition selection policies in object database garbage collection. In Proceedings of ACM SIGMOD Conference, pages 371-382, Minneapolis, USA, May 1994.

Digital Library

[7]

B. Salzberg (Special Issue Editor). Special issue on online reorganization. IEEE Data Engineering Bulletin, 19(2), June 1996.

[8]

A. Eickler, C. A. Gerlhof, and D. Kossman. A performance evaluation of oid mapping techniques. In Proceedings of the 21st VLDB Conference, September 1995.

Digital Library

[9]

H.V. Jagadish, D. Lieuwen, R. Rastogi, A. Silberschatz, and S. Sudarshan. Dali: A high performance mainmemory storage manager. In Proceedings of the 20th VLDB Conference, 1994.

Digital Library

[10]

E.K. Kolodner and W. E. Weihl. Atomic incremental garbage collection and recovery of a large stable heap. In Proceedings of ACM SIGMOD Conference, pages 177- 186, Washington, DC, May 1993.

Digital Library

[11]

M.K. Lakhamraju, R. Rastogi, S. Seshadri, and S. Sudarshan. On-line reorganization of objects. In Technical Report, Bell-labs, February 1999.

[12]

C. Mohan and I. Narang. Algorithms for creating very large tables without quiescing updates. In Proceedings of ACM SIGMOD Conference, pages 361-370, San Diego, USA, May 1992.

Digital Library

[13]

S. Nettles, J. O'Toole, D. Pierce, and N. Haines. Replication-based incremental copying collection. In International Workshop on Memory Management, pages 357-364, St. Malo, France, September 1992.

Digital Library

[14]

E. Omiecinski. Concurrent file reorganization: Clustering, conversion and maintenance. IEEE Data Engineering Bulletin, 19(2), 1996.

[15]

V. Srinivasan and M. Carey. Compensation based online query processing. In Proceedings of A CM SIGMOD Conference, San Diego, CA, 1992.

Digital Library

[16]

V. Srinivasan and M. Carey. Performance of on-line index construction algorithms. In 3rd International Conferance on Extending Database Technology, pages 292-309, Vienna, Austria, March 1992.

Digital Library

[17]

B. Salzberg and A. Dimock. Principles of transactionbased on-line reorganization. In Proceedings of 18th VLDB Conference, pages 511-520, 1992.

Digital Library

[18]

M.M. Tsangaris and J. F. Naughton. A stochastic approach for clustering in object bases. In Proceedings of the A CM SIGMOD Conference, Denver, Colorado, May 1991.

Digital Library

[19]

Jr W.J. Mciver and R. King. Self-adaptive, on-line reclustering of complex object data. In Proceedings of A CM SIGMOD Conference, pages 407-418, Minneapolis, USA, May 1994.

Digital Library

[20]

V. Yong, J. Naughton, and J. Yu. Storage reclamation and reorganization in client-server persistent object stores. In Proceedings of the Data Engineering International Conference, pages 120-133, February 1994.

Digital Library

[21]

C. Zou and B. Salzberg. On-line reorganization of sparesely-populated B+-trees. In Proceedings of A CM SIGMOD Conference, pages 115-124, Montreal, June 1996.

Digital Library

[22]

C. Zou and B. Salzberg. Towards efficient online database reorganization. IEEE Data Engineering Bulletin, 19(2):33-40, June 1996.

[23]

C. Zou and B. Salzberg. Safely and efficiently updating references during on-line reorganization. In Internation Conference on Very Large Databases, New York, USA, August 1998.

Digital Library

Cited By

Miyamoto NHiguchi KTsuji T(2014)Incremental Data Migration for Multi-database Systems Based on MySQL with Spider Storage Engine2014 IIAI 3rd International Conference on Advanced Applied Informatics10.1109/IIAI-AAI.2014.151(745-750)Online publication date: Aug-2014
https://doi.org/10.1109/IIAI-AAI.2014.151
Higuchi KWang WTsuji T(2012)Incremental Data Migration for Multi-database SystemsProceedings of the 2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing10.1109/SNPD.2012.51(716-720)Online publication date: 8-Aug-2012
https://dl.acm.org/doi/10.1109/SNPD.2012.51
Sockut GIyer B(2009)Online reorganization of databasesACM Computing Surveys10.1145/1541880.154188141:3(1-136)Online publication date: 30-Jul-2009
https://dl.acm.org/doi/10.1145/1541880.1541881
Show More Cited By

Index Terms

On-line reorganization in object databases
1. Information systems
  1. Data management systems
    1. Database design and models
      1. Physical data models

Recommendations

On-line reorganization in object databases

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 ...
Deputy Mechanisms for Object-Oriented Databases
ICDE '95: Proceedings of the Eleventh International Conference on Data Engineering

Concepts of deputy objects and deputy classes for object-oriented databases (OODBs) are introduced. They can be used for unified realization of object views, roles and migration. The previous researches on these concepts were carried out separately, ...
Dynamic Reorganization of Object Databases
IDEAS '99: Proceedings of the 1999 International Symposium on Database Engineering & Applications

We consider the problem of optimizing the number of I/O operations by means of an effective clustering with the objective to overcome defficiencies of existing solutions. Our objective is to dynamically adapt physical database organizations, on-line, ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGMOD '00: Proceedings of the 2000 ACM SIGMOD international conference on Management of data

May 2000

604 pages

ISBN:1581132174

DOI:10.1145/342009

Chairmen:
Maggie Dunham
Southern Methodist Univ.
,
Jeffrey F. Naughton
Univ. of Wisconsin-Madison
,
Weidong Chen
Southern Methodist Univ.
,
Nick Koudas
AT &T Labs

ACM SIGMOD Record Volume 29, Issue 2
June 2000
609 pages
ISSN:0163-5808
DOI:10.1145/335191
Editors:
Weidong Chen
Southern Methodist Univ., Dallas, TX
,
Jeffrey Naughton
Univ. of Wisconsin-Madison, Madison
,
Philip A. Bernstein
Microsoft
Issue’s Table of Contents

Copyright © 2000 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGMOD: ACM Special Interest Group on Management of Data

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 16 May 2000

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SIGMOD/PODS00

Sponsor:

SIGMOD

SIGMOD/PODS00: ACM International Conference on Management of Data and Symposium on Principles of Database Systems

May 15 - 18, 2000

Texas, Dallas, USA

Acceptance Rates

SIGMOD '00 Paper Acceptance Rate 42 of 248 submissions, 17%;

Overall Acceptance Rate 785 of 4,003 submissions, 20%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

11
Total Citations
View Citations
1,407
Total Downloads

Downloads (Last 12 months)1,278
Downloads (Last 6 weeks)52

Reflects downloads up to 14 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Miyamoto NHiguchi KTsuji T(2014)Incremental Data Migration for Multi-database Systems Based on MySQL with Spider Storage Engine2014 IIAI 3rd International Conference on Advanced Applied Informatics10.1109/IIAI-AAI.2014.151(745-750)Online publication date: Aug-2014
https://doi.org/10.1109/IIAI-AAI.2014.151
Higuchi KWang WTsuji T(2012)Incremental Data Migration for Multi-database SystemsProceedings of the 2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing10.1109/SNPD.2012.51(716-720)Online publication date: 8-Aug-2012
https://dl.acm.org/doi/10.1109/SNPD.2012.51
Sockut GIyer B(2009)Online reorganization of databasesACM Computing Surveys10.1145/1541880.154188141:3(1-136)Online publication date: 30-Jul-2009
https://dl.acm.org/doi/10.1145/1541880.1541881
Higuchi KNomura HTsuji T(2007)Incremental Reorganization for Distributed Index SystemSystems Modeling and Simulation10.1007/978-4-431-49022-7_45(223-227)Online publication date: 2007
https://doi.org/10.1007/978-4-431-49022-7_45
Ghandeharizadeh SGao SGahagan CKrauss R(2006)An on-line reorganization framework for SAN file systemsProceedings of the 10th East European conference on Advances in Databases and Information Systems10.1007/11827252_30(399-414)Online publication date: 3-Sep-2006
https://dl.acm.org/doi/10.1007/11827252_30
Dasgupta KGhosal SJain RSharma UVerma A(2005)QoSMigProceedings of the 21st International Conference on Data Engineering10.1109/ICDE.2005.116(816-827)Online publication date: 5-Apr-2005
https://dl.acm.org/doi/10.1109/ICDE.2005.116
(2002) Online Reorganization of B + tree in a Scalable and Highly Available Database Cluster The KIPS Transactions:PartD10.3745/KIPSTD.2002.9D.5.8019D:5(801-812)Online publication date: 1-Oct-2002
https://doi.org/10.3745/KIPSTD.2002.9D.5.801
Bratsberg SHumborstad R(2001)Online Scaling in a Highly Available DatabaseProceedings of the 27th International Conference on Very Large Data Bases10.5555/645927.672348(451-460)Online publication date: 11-Sep-2001
https://dl.acm.org/doi/10.5555/645927.672348
Zigman JBlackburn SMoss J(2001)TMOS: A Transactional Garbage CollectorPersistent Object Systems: Design, Implementation, and Use10.1007/3-540-45498-5_12(138-156)Online publication date: 10-Oct-2001
https://doi.org/10.1007/3-540-45498-5_12
He ZMárquez ABlackburn S(2001)Opportunistic Prioritised Clustering Framework (OPCF)Objects and Databases10.1007/3-540-44677-X_6(86-100)Online publication date: 29-Mar-2001
https://doi.org/10.1007/3-540-44677-X_6
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents