Online reorganization of databases

ACM Computing Surveys

Volumn 41, Issue 3, 2009, Pages

  Sockut, Gary H ^a   Iyer, Balakrishna R ^b  

^a MIT LINCOLN LABORATORY   (United States)

^b IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

Clustering; Concurrent reorganization; Indexes; Log structured file systems; Maintenance; Online reorganization; Redefinition; Reorganization; Restructuring; Schema evolution; Very large databases

Indexed keywords

CLUSTERING; CONCURRENT REORGANIZATION; INDEXES; LOG-STRUCTURED FILE SYSTEMS; ONLINE REORGANIZATION; REDEFINITION; REORGANIZATION; RESTRUCTURING; SCHEMA EVOLUTION; VERY LARGE DATABASES;

ECONOMIC ANALYSIS; ELECTRONIC COMMERCE; MAINTENANCE; MANAGEMENT INFORMATION SYSTEMS; ONLINE SYSTEMS; REFUSE COLLECTION; SURVEYS; WASTE DISPOSAL;

DATABASE SYSTEMS;

EID: 70349668770     PISSN: 03600300     EISSN: 15577341     Source Type: Journal    
DOI: 10.1145/1541880.1541881     Document Type: Article

References (373)

1. ABDULLAHI, S. E. AND RINGWOOD,G. A. 1998. Garbage collecting the Internet: A survey of distributed garbage collection. ACM Comput. Surv. 30, 3, 330-373.
2. ACHYUTUNI, K. J., OMIECINSKI, E., AND NAVATHE, S. B. 1992. HISET: A generalized technique for efficient concurrent reorganization. Tech. rep. GIT-CC-92/57, College of Computing, Georgia Institute of Technology, Atlanta.
3. ACHYUTUNI, K. J., OMIECINSKI, E., AND NAVATHE, S. B. 1993. The impact of data placement strategies on reorganization costs in parallel disk systems. Tech. rep. GIT-CC-93/58, College of Computing, Georgia Institute of Technology, Atlanta.
4. ACHYUTUNI, K. J., OMIECINSKI, E., AND NAVATHE, S. B. 1996. Two techniques for on-line index modification in shared nothing parallel databases. In Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data. ACM, New York, 125-136. (SIGMOD Record 25, 2).
5. AHLŚEN, M., BJöRNERSTEDT, A., BRITTS, S., HULT́EN, C., AND SöDERLUND, L. 1983. Making type changes transparent. In Proceedings of the IEEE Workshop on Languages for Automation. 110-117.
6. AHLŚEN, M., BJöRNERSTEDT, A., BRITTS, S., HULT́EN, C., AND SöDERLUND, L. 1984. An architecture for object management in OIS. ACM Trans. Office Info. Syst. 2, 3, 173-196. (This includes a summary of the work of Ahlśen et al. [1983]).
7. ALMES, G. T. 1980. Garbage collection in an object-oriented system. Ph.D. dissertation, Department of Computer Science, Carnegie Mellon University, Pittsburgh. (Also Tech. rep. CMU-CS-80-128.) Amer. Natl. Standards Institute. 1992. Database Language SQL. Amer. National Standards Institute, New York. X3.135-1992.
8. AMMANN, P., JAJODIA, S., ANDMAVULURI, P. 1995. On-the-fly reading of entire databases. IEEE Trans. Knowl. Data Engin. 7, 5, 834-838.
9. AMSALEG, L., FRANKLIN,M. J., AND GRUBER, O. 1995. Efficient incremental garbage collection for client-server object database systems. In Proceedings of the 21st International Conference on Very Large Data Bases. Morgan Kaufmann Publishers, San Francisco, 42-53. (For a revision with more details, see Amsaleg et al. [1999
10. AMSALEG, L., FRANKLIN, M. J., AND GRUBER, O. 1999. Garbage collection for a client-server persistent object store. ACM Trans. Computer Syst. 17, 3, 153-201.
11. APPEL, A. W., ELLIS, J. R., AND LI, K. 1988. Real-time concurrent collection on stock multiprocessors. In Proceedings of the SIGPLAN '88 Conference on Programming Language Design and Implementation. ACM, New York, 11-20. (SIGPLAN Notices 23, 7, ACM).
12. ASHWIN, S., ROY, P., SESHADRI, S., SILBERSCHATZ, A., AND SUDARSHAN, S. 1997. Garbage collection in objectoriented databases using transactional cyclic reference counting. In Proceedings of the 23rd International Conference on Very Large Data Bases. Morgan Kaufmann, San Francisco, 366-375. (For a revision with more details, see Roy et al. [1998
13. AZATCHI, H., LEVANONI, Y., PAZ, H., AND PETRANK, E. 2003. An on-the-fly mark and sweep garbage collector based on sliding views. In Proceedings of the ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA 2003). ACM, New York, 269-281. (SIGPLAN Notices 38, 11).
14. BACON, D. F. 2007. Real-time garbage collection. Queue 5, 1, 40-49. ACM, New York.
15. BACON, D. F., CHENG, P., AND RAJAN, V. T. 2004. A unified theory of garbage collection. In Proceedings of the 19th Annual ACMSIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA 2004). ACM, New York, 50-68. (SIGPLAN Notices 39, 10).
16. BAHAA-EL-DIN, W. H., BASTANI, F. B., AND TENG, J.-E. 1989. Performance analysis of periodic and concurrent data structure maintenance strategies for network servers. IEEE Trans. Soft. Engin. 15, 12, 1526-1536.
17. BAKER, JR., H. G. 1978. List processing in real-time on a serial computer. Comm. ACM 21, 4, 280-294.
18. BANERJEE, J.,KIM,W.,KIM, H.-J., ANDKORTH,H. F. 1987. Semantics and implementation of schema evolution in object-oriented databases. In Proceedings of the ACM SIGMOD 1987 Annual Conference. ACM, New York, 311-322. (SIGMOD Record 16, 3).
19. BANZON,A. T., FRISKE,C. A.,GARTH, J. M.,NG,K. C.,RUDDY, J. A., ANDVIZCONDE,B.B. 2006. Method, apparatus and program storage device for managing buffers during online reorganization. U. S. patent application 2006/0173922.
20. BARABASH, K., BEN-YITZHAK, O., GOFT, I., KOLODNER, E. K., LEIKEHMAN, V., OSSIA, Y., OWSHANKO, A., AND PETRANK, E. 2005. A parallel, incremental, mostly concurrent garbage collector for servers. ACM Trans. Prog. Lang. Syst. 27, 6, 1097-1146.
21. BARABASH, K., OSSIA, Y., AND PETRANK, E. 2003. Mostly concurrent garbage collection revisited. In Proceedings of the ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA 2003). ACM, New York, 255-268. (SIGPLAN Notices 38, 11). (For a revision, see Barabash et al. [2005
22. BARTLETT, J. F. 1988. Compacting garbage collection with ambiguous roots. Tech. rep. 88/2, Western Research Lab., Digital Equipment Corp., Palo Alto.
23. BARU, C. AND ZILIO, D. C. 1993. Data reorganization in parallel database systems. In Proceedings of the IEEE Workshop on Advances in Parallel and Distributed Systems IEEE-CS. IEEE Computer Society Press, Los Alamitos, 102-107. (For later, more extensive analysis, see Zilio [1998].
24. BASTANI, F. B., CHEN, I.-R., AND HILAL, W. 1991. A model for the stability analysis of maintenance stragies for linear list. Comput. J. 34, 1, 80-87. Oxford University Press, Oxford, UK.
25. BASTANI, F. B., HILAL, W., AND CHEN, I.-R. 1986. Performance analysis of concurrent maintenance policies for servers in a distributed environment. In Proceedings of the Fall Joint Computer Conference. ACM and IEEE-CS, New York, 611-619.
26. BASTANI, F. B., IYENGAR, S. S., AND YEN, I.-L. 1988. Concurrent maintenance of data structures in a distributed environment. Comput. J. 31, 2, 165-174. Oxford University Press, Oxford, UK.
27. BATORY, D. S. 1982. Optimal file designs and reorganization points. ACM Trans. Datab. Syst. 7, 1, 60-81.
28. BATRA, D. P. 1989. Response time analysis for computer database reorganisation with concurrent usage and changeover state. Defence Sci. J. 39, 1, 33-41. Defence Scientific Info. and Documentation Centre, Ministry of Defence, Delhi, India.
29. BAYER, R. AND MCCREIGHT, E. 1970. Organization and maintenance of large ordered indices. In Proceedings of the ACM SICFIDET Workshop on Data Description and Access. ACM, New York, 107-141. (For a revision, see Bayer and McCreight [1972].
30. BAYER, R. AND MCCREIGHT, E. 1972. Organization and maintenance of large ordered indexes. Acta Inf. 1, 3, 173-189.
31. BELLAHSENE, Z. 1996. View mechanism for schema evolution in object-oriented DBMS. In Advances In Databases, R. Morrison and J. Kennedy, Eds. Lecture Notes in Computer Science, vol.1094. Springer- Verlag, New York, 18-35. (Proceedings 14th British National Conference on Databases, BNCOD 14.)
32. BENNETT, B. T. AND FRANASZEK, P. A. 1977. Permutation clustering: An approach to on-line storage reorganization. IBM J. Res. Develop. 21, 6, 528-533.
33. BERNSTEIN, P. A. AND GOODMAN, N. 1981. Concurrency control in distributed database systems. ACM Comput. Surv. 13, 2, 185-221.
34. BERTINO, E. 1992. A view mechanism for object-oriented databases. In Advances in Database Technology - EDBT '92, A. Pirotte, C. Delobel, and G. Gottlob, Eds. Lecture Notes in Computer Science, vol.580. Springer-Verlag, New York, 136-151. (Proceedings 3rd International Conference on Extending Database Technology.)
35. BIRRELL, A. D. AND NEEDHAM, R. M. 1978. An asynchronous garbage collector for the CAP filing system. Oper. Syst. Rev. 12, 2, 31-33. (ACM SIGOPS.)
36. BLACKBURN, S. M., CHENG, P., AND MCKINLEY, K. S. 2004. Myths and realities: The performance impact of garbage collection. In Proceedings of the International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS 2004). ACM, New York, 25-36. (Perform. Evalu. Rev. 32, 1, SIGMETRICS).
37. BLACKBURN, S. M. AND MCKINLEY, K. S. 2003. Ulterior reference counting: Fast garbage collection without a long wait. In Proceedings of the 2003 ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA 2003). ACM, New York, 344-358. (SIGPLAN Notices 38, 11).
38. BLACKWELL, T., HARRIS, J., AND SELTZER, M. 1995. Heuristic cleaning algorithms in log-structured file systems. In Proceedings of the 1995 USENIX Technical Conference USENIX Association, Berkeley, 277-288.
39. BMC Software. 1997. REORG PLUS for DB2: General Information, Version 5.1. BMC Software.
40. BMC Software. 1998. CONCURRENT REORG and the Extended Performance Utilities: General Information, Version 1.3. BMC Software.
41. BOLLELLA, G., LIZZI, C., AND DAYNES, L. P. 2009. System and method for ensuring non-interfering garbage collection in a real-time multi-threaded environment. U.S. patent 7,484,067.
42. BRACHT, C. J.,MALKEMUS, T. R., AND VERSTEEG, A. 1991. Table reorganization identification. IBM Tech. Disclosure Bull. 34, 1, 163-165.
43. BRATSBERG, S. E. 1992. Unified class evolution by object-oriented views. In Proceedings of the 11th International Conference on the Entity-Relationship Approach - ER '92, G. Pernul and A. M. Tjoa, Eds. Lecture Notes in Computer Science, vol.645. Springer-Verlag, New York, 423-439. (For more details, see Bratsberg [1993].
44. BRATSBERG, S. E. 1993. Evolution and integration of classes in object-oriented databases. Dr.Ing. thesis, Division of Computer Systems and Telematics, Norwegian Institute of Technology, Trondheim, Norway.
45. BRATSBERG, S. E. AND HUMBORSTAD, R. 2001. Online scaling in a highly available database. In Proceedings of the 27th International Conference on Very Large Data Bases.Morgan Kaufmann, San Francisco, 451-460.
46. BRATSBERG, S. E. HVASSHOVD, S.-O., AND Torbjørnsen ø 1997. Parallel solutions in ClustRa. Data Engin. 20, 2, 13-20.
47. BRATSBERG, S. E. AND Torbjørnsen ø 2000. Tutorial: Designing an ultra highly available DBMS. In Proceedings of the 2000 ACMSIGMOD International Conference on Management of Data. (SIGMOD Record 29, 2).
48. BREITBART, Y., VINGRALEK, R., AND WEIKUM, G. 1996. Load control in scalable distributed file structures. Distrib. Paral. Datab. 4, 4, 319-354.
49. BROWN, K. P., CAREY, M. J., AND LIVNY, M. 1993. Managing memory to meet multi-class workload response time goals. In Proceedings of the 19th International Conference on Very Large Data Bases. Morgan- Kaufmann, San Francisco, 328-341.
50. BROWN, K. P.,CAREY, M. J., AND LIVNY, M. 1996. Goal-oriented buffer management revisited. In Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data. ACM, New York, 353-364. (SIGMOD Record 25, 2).
51. BROWNBRIDGE, D. R. 1985. Cyclic reference counting for combinator machines. In Functional Programming Languages and Computer Architecture, J.-P. Jouannaud, Ed. Lecture Notes in Computer Science, vol.201. Springer-Verlag, New York, 273-288. (Proceedings IFIP Conference).
52. BUTLER,M. H. 1986. Storage reclamation for object oriented database systems: A summary of the expected costs. In Proceedings of the 1986 International Workshop on Object-Oriented Database Systems. IEEE Computer Society Press, Los Alamitos, 210-211. (For more details, see Butler [1987].
53. BUTLER, M. H. 1987. Storage reclamation in object oriented database systems. In Proceedings of the ACM SIGMOD 1987 Annual Conference. ACM, New York, 410-425. (SIGMOD Record 16, 3.)
54. CHAMBERLIN, D. D., GRAY, J. N., AND TRAIGER, I. L. 1975. Views, authorization, and locking in a relational data base system. In Proceedings of the National Computer Conference. vol.44. AFIPS Press, Reston, 425-430.
55. CHAMBERLIN, D. D. AND SCHMUCK, F. B. 1992a. Dynamic data distribution (D3) in a shared-nothing multiprocessor data store. In Proceedings of the 18th International Conference on Very Large Data Bases. Morgan-Kaufmann, San Francisco, 163-174. (For more details, see Chamberlin and Schmuck [1992b].
56. CHAMBERLIN, D. D. AND SCHMUCK, F. B. 1992b. Dynamic data distribution in a shared-nothing multiprocessor data store. Resear. rep. RJ 8730, IBM T. J. Watson Research Center, Yorktown Heights.
57. CHANG, E. E. AND KATZ, R. H. 1989. Exploiting inheritance and structure semantics for effective clustering and buffering in an object-oriented DBMS. In Proceedings of the 1989 ACM SIGMOD International Conference on Management of Data. ACM, New York, 348-357. (SIGMOD Record 18, 2).
58. CHEE,C.-L., LU, H., TANG, H., ANDRAMAMOORTHY,C.V. 1998. Adaptive prefetching and storage reorganization in a log-structured storage system. IEEE Trans. Knowl. Data Engin. 10, 5, 824-838.
59. CHEN, I.-R. 1995. A degradable Blink-tree with periodic data reorganization. Comput. J. 38, 3, 245-252.
60. CHEN, I.-R. AND BANAWAN, S. A. 1993. Modeling and analysis of concurrent maintenance policies for data structures using pointers. IEEE Trans. Soft. Engin. 19, 9, 902-911.
61. CHEN, I.-R. AND BANAWAN, S. A. 1999. Performance and stability analysis of multi-level data structures with deferred reorganization. IEEE Trans. Soft. Engin. 25, 5, 690-700.
62. CHEN, I.-R. AND HASSAN, S. 1995. Performance analysis of a periodic data reorganization algorithm for concurrent Blink-trees in database systems. In Proceedings of the 1995 ACM Symposium on Applied Computing. ACM, New York, 40-45.
63. CHEN, P. M., LEE, E. K., GIBSON, G. A., KATZ, R. H., AND PATTERSON, D. A. 1994. RAID: High-performance, reliable secondary storage. ACM Comput. Surv. 26, 2, 145-185.
64. CHENEY, C. J. 1970. A nonrecursive list compacting algorithm. Comm. ACM 13, 11, 677-678.
65. CHENG, J. R. AND HURSON, A. R. 1991. Effective clustering of complex objects in object-oriented databases. In Proceedings of the 1991 ACM SIGMOD International Conference on Management of Data. ACM, New York, 22-31. (SIGMOD Record 20, 2).
66. CHIANG, M.-L. AND HUANG, J.-S. 2007. Improving the performance of log-structured file systems with adaptive block rearrangement. In Proceedings of the 2007 ACM Symposium on Applied Computing (SAC). 1136-1140.
67. CLAMEN, S. M. 1994. Schema evolution and integration. Distrib. Paral. Datab. 2, 1, 101-126. Kluwer Academic Publishers, Hingham.
68. COHEN, J. 1981. Garbage collection of linked data structures. ACM Comput. Surv. 13, 3 (Sept.), 341-367.
69. COLLINS, G. E. 1960. A method for overlapping and erasure of lists. Comm. ACM 3, 12, 655-657.
70. COMER, D. 1979. The ubiquitous B-tree. ACM Comput. Surv. 11, 2, 121-137.
71. COOK, J. E., KLAUSER, A. W., WOLF, A. L., AND ZORN, B. G. 1996. Semi-automatic, self-adaptive control of garbage collection rates in object databases. In Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data. ACM, New York, 377-388. (SIGMOD Record 25, 2).
72. COOK, J. E., WOLF, A. L., AND ZORN, B. G. 1994. Partition selection policies in object database garbage collection. In Proceedings of the 1994 ACM SIGMOD International Conference on Management of Data. ACM, New York, 371-382. (SIGMOD Record 23, 2). (For a revision with more details and policies, see Cook et al. [1998].
73. COOK, J. E.,WOLF, A. L., AND ZORN, B.G. 1998. A highly effective partition selection policy for object database garbage collection. IEEE Trans. Knowl. Data Engin. 10, 1, 153-172.
74. COPELAND, G., ALEXANDER,W., BOUGHTER, E., AND KELLER, T. 1988. Data placement in Bubba. In Proceedings of the SIGMOD International Conference on Management of Data. ACM, New York, 99-108. (SIGMOD Record 17, 3, ACM).
75. COPELAND, G., FRANKLIN, M., AND WEIKUM, G. 1990. Uniform object management. In Advances in Database Technology - EDBT '90, F. Bancilhon, C. Thanos, and D. Tsichritzis, Eds. Lecture Notes in Computer Science, vol.416. Springer-Verlag, New York, 253-268. (Proceedings of the International Conference on Extending Database Technology.)
76. CRUS, R. A. 1984. Data recovery in IBM Database 2. IBM Syst. J. 23, 2, 178-188.
77. DETLEFS, D. L. 1990. Concurrent, atomic garbage collection. Ph.D. dissertation, Department of Computer Science, Carnegie Mellon University, Pittsburgh. (Also Tech. rep. CMU-CS-90-177).
78. DETLEFS, D. L. 2004. A hard look at hard real-time garbage collection. In Proceedings of the 7th IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC 2004). IEEE Computer Society Press, Los Alamitos, 23-32.
79. DETLEFS,D. L., FLOOD,C.,HELLER, S., AND PRINTEZIS, T. 2004. Garbage-first garbage collection. In Proceedings of the 4th International Symposium on Memory Management (ISMM 2004). ACM, 37-48.
80. DEUTSCH, L. P. AND BOBROW, D. G. 1976. An efficient, incremental, automatic garbage collector. Comm. ACM 19, 9, 522-526.
81. DEWITT, D. J. AND GRAY, J. 1992. Parallel database systems: The future of high-performance database systems. Comm. ACM 35, 6, 85-98.
82. DIJKSTRA, E. W., LAMPORT, L., MARTIN, A. J., SCHOLTEN, C. S., AND STEFFENS, E. F. M. 1978. On-the-fly garbage collection: An exercise in cooperation. Comm. ACM 21, 11, 966-975.
83. DOMANI, T., KOLODNER, E. K., LEWIS, E., SALANT, E. E., BARABASH, K., LAHAN, I., LEVANONI, Y., PETRANK, E., AND YANOVER, I. 2000a. Implementing an on-the-fly garbage collector for Java. In Proceedings of the ISMM 2000, International Symposium on Memory Management. ACM, New York, 155-166. (SIGPLAN Notices 36, 1, 2001).
84. DOMANI, T., KOLODNER, E. K., AND PETRANK, E. 2000b. A generational on-the-fly garbage collector for Java. In Proceedings of the 2000 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI). ACM, New York, 274-284. (SIGPLAN Notices 35, 5).
85. EGGERT, L. AND TOUCH, J. D. 2005. Ideltime scheduling with preemption intervals. In Proceedings of the 20th ACM Symposium on Operating Systems Principles. ACM, New York, 249-262. (Operat. Syst. Rev. 39, 5, SIGOPS).
86. ENGLERT, S. 1994. NonStop SQL: Scalability and availability for decision support. In Proceedings of the 1994 ACM SIGMOD International Conference on Management of Data. 491. (SIGMOD Record 23, 2).
87. FANG, M. T., LEE, R. C. T., AND CHANG, C. C. 1986. The idea of de-clustering and its applications. In Proceedings of the 12th International Conference on Very Large Data Bases. Morgan-Kaufmann, San Francisco, 181-188.
88. FEELIFL, H. AND KITSUREGAWA, M. 2001. RING: A strategy for minimizing the cost of online data placement reorganization for Btree indexed database over shared-nothing parallel machines. In Proceedings of the 7th International Conference on Database Systems for Advanced Applications. IEEE Computer Society Press, Los Alamitos, 190-199.
89. FEELIFL, H., KITSUREGAWA, M., AND OOI, B.-C. 2000. A fast convergence technique for online heat-balancing of Btree indexed database over shared-nothing parallel systems. In Proceedings of the 11th International Conference on Database and Expert Systems Applications, M. T. Ibrahim, J. Küng, and N. Revell, Eds. Lecture Notes in Computer Science, vol.1873. Springer-Verlag, New York, 846-858.
90. FERRANDINA, F., MEYER, T., AND ZICARI, R. 1994. Correctness of lazy database updates for object database systems. In Proceedings of the 6th International Workshop on Persistent Object Systems, M. P. Atkinson, D. Maier, and V. Benzaken, Eds. Springer-Verlag, New York, 284-301. (For a revision, see Ferrndina et al. [1995
91. FERRANDINA, F., MEYER, T., ZICARI, R., FERRAN, G., AND MADEC, J. 1995. Schema and database evolution in the O2 object database System. In Proceedings of the 21st International Conference on Very Large Data Bases. Morgan-Kaufmann, San Francisco, 170-181.
92. FERREIRA, P. AND SHAPIRO, M. 1994a. Garbage collection and DSM consistency. In Proceedings of the 1st USENIX Symposium on Operating Systems Design and Implementation (OSDI). USENIX Association, Berkeley, 229-241. (Also Operat. Syst. Rev., ACM SIGOPS.)
93. FERREIRA, P. AND SHAPIRO, M. 1994b. Garbage collection of persistent objects in distributed shared memory. In Proceedings of the 6th International Workshop on Persistent Object Systems, M. P. Atkinson, D. Maier, and V. Benzaken, Eds. Springer-Verlag, New York, 184-199.
94. FONTANA, E. AND DENNEBOUY, Y. 1995. Time-stamped versions for lazy propagation of schema changes. Tech. rep. 95/100, Department of Informatics, Swiss Federal Institute of Technology, Lausanne, Switzerland.
95. FORD, D. A. AND MYLLYMAKI, J. 1996. A log-structured organization for tertiary storage. In Proceedings of the 12th International Conference on Data Engineering. IEEE Computer Society Press, Los Alamitos, 20-27.
96. FRANASZEK, P. A. AND CONSIDINE, J. P. 1979. Reduction of storage fragmentation on direct access devices. IBM J. Res. Devel. 23, 2, 140-148.
97. FRANASZEK, P. A., ROBINSON, J. T., AND THOMASIAN, A. 1994. Reorganizing data in log-structured file systems. IBM Tech. Disclos. Bull. 37, 6A, 623-624.
98. FRANKLIN, M., COPELAND, G., AND WEIKUM, G. 1989. What's different about garbage collection for persistent programming languages? Tech. rep. ACA-ST-062-89, MCC, Austin.
99. FRISKE, C. A. 2004a. DB2 managing large partitioned tables in Version 8. Proc. SHARE 102. SHARE, Chicago.
100. FRISKE,C.A. 2004b. DB2 online schema changes - what's new in DB2Version 8. Proc.SHARE102. SHARE, Chicago.
101. FRISKE, C. A., GARTH, J. M., LEE, C. M., AND RUDDY, J. A. 2007. Method and apparatus for building one or more indexes on data concurrent with manipulation of data. U.S. patent 7,308,456.
102. FRISKE, C. A., GARTH, J. M., AND RUDDY, J. A. 2003a. Method of estimating an amount of changed data over plurality of intervals of time measurements. U.S. patent 6,535,870.
103. FRISKE, C. A. AND RUDDY, J. A. 1998. Online reorganization. DB2 Mag. 3, 3. (Online Ed. http://www.db2mag.com.) CMP Media.
104. FRISKE, C. A., RUDDY, J. A., AND SHIBAMIYA, A. 2003b. Method for estimating the elapsed-time required for a log apply process. U.S. patent 6,535,893.
105. GALANTE, R. D. M., DOS SANTOS, C. S., EDELWEISS, N., ANDMOREIRA, A. F. 2005. Temporal and versioning model for schema evolution in object-oriented databases. Data Knowl. Engin. 53, 2, 99-128.
106. North-Holland, Amsterdam, Neth.
107. GANESAN, P., BAWA, M., AND GARCIA-MOLINA, H. 2004. Online balancing of range-partitioned data with applications to peer-to-peer systems. In Proceedings of the 30th International Conference on Very Large Data Bases. Morgan-Kaufmann, San Francisco, 444-455.
108. GARNETT, N.H. ANDNEEDHAM, R.M. 1980. An asynchronous garbage collector for the Cambridge File Server. Operat. Syst. Rev. 14, 4, 36-40.
109. GARTHWAITE, A. T. 2008. Concurrent incremental garbage collector with a card table summarizing modified reference locations. U.S. patent 7,412,580.
110. GERRITSEN, R. 1994. Private communication.
111. GERRITSEN, R. AND MORGAN, H. L. 1976. Dynamic restructuring of databases with generation data structures. In Proceedings of the ACM Annual Conference. ACM, New York, 281-286.
112. GHANDEHARIZADEH, S. AND DEWITT, D. J. 1990. A multiuser performance analysis of alternative declustering strategies. In Proceedings of the 6th International Conference on Data Engineering. IEEE Computer Society Press, Los Alamitos, 466-475.
113. GHANDEHARIZADEH, S., GAO, S., GAHAGAN, C., AND KRAUSS, R. 2006. An on-line reorganization framework for SAN file systems. In Proceedings of the 10th East European Conference on Advances in Databases and Information Systems, Y. Manolopoulos, J. Pokorń y, and T. K. Sellis, Eds. Lecture Notes in Computer Science, vol.4152. Springer-Verlag, New York, 399-414.
114. GHANDEHARIZADEH, S. AND KIM, D. 1996. Online reorganization of data in scalable continuous media servers. In Proceedings of the 7th International Conference on Database and Expert Systems Applications, R.Wagner and H. Thoma, Eds. Lecture Notes in Computer Science, vol.1134. Springer-Verlag, New York, 751-768.
115. GOLDING, R., BOSCH, P., STAELIN, C., SULLIVAN, T., AND WILKES, J. 1995. Idleness is not sloth. In Proceedings of the 1995 USENIX Technical Conference. USENIX Assoc., Berkeley, 201-212.
116. GOODMAN, N. AND SHASHA, D. 1985. Semantically-based concurrency control for search structures. In Proceedings of the 4th ACM SIGACT-SIGMOD Symposium on Principles of Database Systems. ACM, New York, 8-19. (For a revision, see Shasha and Goodman [1988].
117. GORALWALLA, I. A., SZAFRON, D., öZSU,M. T., AND PETERS,R. J. 1998. Atemporal approach tomanaging schema evolution in object database systems. Data Knowl. Engin. 28, 1, 73-105. North-Holland, Amsterdam, Netherlands.
118. GOYAL, B., HARITSA, J. R., SESHADRI, S., AND SRINIVASAN, V. 1995. Index concurrency control in firm real-time DBMS. In Proceedings of the 21st International Conference onVery Large Data Bases.Morgan-Kaufmann, San Francisco, 146-157.
119. GRAEFE, G. 1993. Query evaluation techniques for large databases. ACM Comput. Surv. 25, 2, 73-170.
120. GRAY, J. 1978. Notes on data base operating systems. In Operating Systems-An Advanced Course, R. Bayer, R. M. Graham, and G. Seegmüller, Eds. Springer-Verlag, New York, 393-481.
121. GRAY, J. AND REUTER, A. 1993. Transaction Processing: Concepts and Techniques. Morgan-Kaufmann, San Francisco.
122. GUIBAS, L. J. AND SEDGEWICK, R. 1978. A dichromatic framework for balanced trees. In Proceedings of the 19th Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, 8-21.
123. GUPTA, A. AND FUCHS, W. K. 1993. Garbage collection in a distributed object-oriented system. IEEE Trans. Knowl. Data Engin. 5, 2, 257-265.
124. HAERDER, T. AND REUTER, A. 1983. Principles of transaction-oriented database recovery. ACM Comput. Surv. 15, 4, 287-317.
125. HAMADA, Y., ISHIHARA, K., MASUMOTO, T., FUJITA, T., MASATOMI, K., TAKEDA, Y., AND KAWASHIMA, M. 2000. Online database duplication with incorporation of concurrent database updates. U.S. patent 6,023,707.
126. HARTMAN, J. H. AND OUSTERHOUT, J. K. 1995. The Zebra striped network file system. ACM Trans. Comput. Syst. 13, 3, 274-310.
127. HELAL, A., YUAN, D., AND EL-REWINI, H. 1997. Dynamic data reallocation for skew management in sharednothing parallel databases. Distrib. Paral. Datab. 5, 3, 271-288.
128. HEYMAN, D. P. 1982. Mathematical models of database degradation. ACMTrans. Datab. Syst. 7, 4, 615-631.
129. HO, F., JAIN, R., AND TROISI, J. 1994. An overview of NonStop SQL/MP. Tandem Syst. Rev. 10, 3, 6-17. Hewlett-Packard.
130. HURAS, M. A., HING, N. H., GOSS, J. J., AND LINDSAY, B. G. 2005. Online database table reorganization. U.S. patent 6,950,834.
131. IBM. 1986. IMS/VS Version 1 Utilities Reference Manual. IBM. SH20-9029-9039
132. IBM. 1993a. Implementing Concurrent Copy. IBM. GG24-3990-4000
133. IBM. 1993b. An Introduction to Data Propagator Relational Release 1. IBM. GC26-3398-3401
134. IBM. 1997. DB2 for OS/390 Version 5 Utility Guide and Reference. IBM. SC26-8967-9000
135. IBM. 2001. DB2 Universal Database for OS/390 and z/OS Utility Guide and Reference, Version 7. IBM. SC26-9945-10000
136. IBM. 2005. IMS Administration Guide: Database Manager, Version 9. IBM. SC18-7806-7901
137. IBM and Integrated Systems Solutions. 1994. Replidata/MVS User's Guide. IBM and Integrated Systems Solutions. BLD-REP-UG-00.
138. ISIP, JR., A. B. 2007. System and method for reorganizing stored data. U.S. patent 7,225,206.
139. Itasca Systems. 1993. ITASCA Distributed Object Database Management System: Technical Summary for Release 2.2. Itasca Systems.
140. IYER, B. R. AND SOCKUT, G. H. 2002. Methods for in-place online reorganization of a database. U.S. patent 6,411,964.
141. IYER, B. R. AND WILHITE, D. 1994. Data compression support in databases. In Proceedings of the 20th International Conference on Very Large Data Bases. Morgan-Kaufmann, San Francisco, 695-704.
142. JAMBOR, M., HRUBY, T., TAUS, J., KRCHAK, K., AND HOLUB, V. 2007. Implementation of a Linux log-structured file system with a garbage collector. Operat. Syst. Rev. 41, 1, 24-32.
143. JOHNSON, T. AND SHASHA, D. 1990. A framework for the performance analysis of concurrent B-tree algorithms. In Proceedings of the 9th ACMSIGACT-SIGMOD- SIGART Symposium on Principles of Database Systems. ACM, New York, 273-287. (For more details, see Johnson and Shasha [1993].
144. JOHNSON, T. AND SHASHA, D. 1993. The performance of concurrent B-tree algorithms. ACM Trans. Datab. Syst. 18, 1, 51-101.
145. JOISHA, P. G. 2007. Overlooking roots: A framework for making nondeferred reference-counting garbage collection fast. In Proceedings of the 6th International Symposium on Memory Management (ISMM 2007). ACM, New York, 141-157.
146. JOISHA, P. G. 2008. A principled approach to nondeferred reference-counting garbage collection. In Proceedings of the 4th ACM SIGPLAN/SIGOPS International Conference on Virtual Execution Environments. ACM, New York, 131-140.
147. JONES, R. AND LINS, R. 1996. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. Wiley, New York.
148. DE JONGE, W., KAASHOEK, M. F., AND HSIEH, W. C. 1993. The logical disk: A new approach to improving file systems. In Proceedings of the 14th ACM Symposium on Operating Systems Principles. ACM, New York, 15-28. (Operat. Syst. Rev. 27, 5, SIGOPS).
149. KATABAMI, N., ITOH, T., AND TAKAHASHI, Y. 1997. Method and apparatus for reorganizing an on-line database system in accordance with an access time increase. U.S. patent 5,596,747.
150. KERMANY, H. AND PETRANK, E. 2006. The Compressor: Concurrent, incremental, and parallel compaction. In Proceedings of the 2006 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI '06). ACM, New York, 354-363. (SIGPLAN Notices 41, 6).
151. KERO, M., NORDLANDER, J., AND LINDGREN, P. 2007. A correct and useful incremental copying garbage collector. In Proceedings of the 6th International Symposium on Memory Management (ISMM 2007). ACM, New York, 129-140.
152. KESSELS, J. L. W. 1983. On-the-fly optimization of data structures. Comm. ACM 26, 11, 895-901.
153. KEYES, J. 1992. DBAs face challenge of 24 by 7 availability. Software Mag. 12, 11, 58-63.
154. KIM, M. Y. 1986. Synchronized disk inter-leaving. IEEE Trans. Comput. C-35, 11, 978-988.
155. KITSUREGAWA, M., GODA, K., AND KAWAMURA, N. 2008. Method and system for data processing with database reorganization for the same. U.S. patent 7,421,456.
156. KITSUREGAWA, M. AND MOGI, K. 1993. Virtual striping: A RAID5 storage management scheme with robustness for the peak access traffic. In Proceedings of the International Symposium on Next Generation Database Systems and Their Applications. ACM, New York, 280-287.
157. KOHL, J. T., STAELIN, C., AND STONEBRAKER,M. 1993. HighLight: Using a log-structured file system for tertiary storage management. In Proceedings of the Winter 1993 USENIX Conference. USENIX Assoc., Berkeley, 435-447.
158. KOLODNER, E. K. 1990. Atomic incremental garbage collection and recovery for a large stable heap. In Proceedings of the 4th International Workshop on Persistent Object Systems, A. Dearle, G. M. Shaw, and S. B. Zdonik, Eds. Morgan-Kaufmann, San Francisco, 185-198. (see Kolodner [1992].
159. KOLODNER, E. K. 1992. Atomic incremental garbage collection and recovery for a large stable heap. Ph.D. dissertation, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge. (Also Tech. rep. MIT/LCS/TR-534, Laboratory for Computer Science.)
160. KOLODNER, E. K., LEWIS, E., AND PETRANK, E. 2005. Trace termination for on-the-fly garbage collection for weakly-consistent computer architecture. U.S. patent 6,920,541.
161. KOLODNER, E. K. AND PETRANK, E. 2002. On-the-fly garbage collector. U.S. patent 6,490,599.
162. KOLODNER, E. K. AND WEIHL, W. E. 1993. Atomic incremental garbage collection and recovery for a large stable heap. In Proceedings of the 1993 ACMSIGMOD International Conference on Management of Data. 177-186. (SIGMOD Record 22, 2). For more details, see Kolodner [1992
163. KUNG, H. T. AND LEHMAN, P. L. 1980. Concurrent manipulation of binary search trees. ACM Trans. Datab. Syst. 5, 3, 354-382.
164. KUO, T.-W., WEI, C.-H., AND LAM, K.-Y. 1999. Real-time data access control on B-tree index structures. In Proceedings of the 15th International Conference on Data Engineering. IEEE Computer Society Press, Los Alamitos, 458-467.
165. LAKHAMRAJU, M. K., RASTOGI, R., SESHADRI, S., AND SUDARSHAN, S. 2000. On-line reorganization in object databases. In Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data. ACM, New York, 58-69. (SIGMOD Record 29, 2). (This is similar to Lakhamraju et al. [2002
166. LAKHAMRAJU, M. K., RASTOGI, R., SESHADRI, S., AND SUDARSHAN, S. 2002. On-line reorganization in objectoriented databases. U.S. patent 6,343,296. (This is similar to Lakhamraju et al. [2000
167. LAM, K.-W. AND LEE, V. C. S. 2006. On consistent reading of entire databases. IEEE Trans. Knowl. Data Engin. 18, 4, 569-572.
168. LAMPSON, B. W. 1984. Hints for computer system design. Software 1, 1, 11-28. IEEE-CS.
169. LANGLEY, J. T. AND MOORE, D. W. 2008. Non-disruptive backup copy in a database online reorganization environment. U.S. patent 7,433,902.
170. LEE, M.-L., KITSUREGAWA, M., OOI, B. C., TAN, K.-L., AND MONDAL, A. 2000. Towards self-tuning data placement in parallel database systems. In Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data. ACM, New York, 225-236. May (SIGMOD Record 29, 2). (For more details, see Mondal [2002].
171. LITWIN, W. 1980. Linear hashing: A new tool for file and table addressing. In Proceedings of the 6th International Conference on Very Large Data Bases. IEEE Computer Society Press, Los Alamitos, 212-223.
172. LIU, C.-T., CHRYSANTHIS, P. K., AND CHANG, S.-K. 1994a. Database schema evolution through the specification and maintenance of changes on entities and relationships. In Proceedings of the 13th International Conference on the Entity-Relationship Approach, ER '94, P. Loucopoulos, Ed. Lecture Notes in Computer Science, vol.881. Springer-Verlag, New York, 132-151.
173. LIU, L., ZICARI, R.,ḦURSCH,W., AND LIEBERHERR,K. 1994b. Polymorphic reuse mechanisms for object-oriented database specifications. In Proceedings of the 10th International Conference on Data Engineering. IEEE Computer Society Press, Los Alamitos, 180-189.
174. LOHMAN, G. M. 1977. Optimal data storage and organization in computerized information processing systems subject to failures. Ph.D. dissertation. School of Operations Research and Industrial Engineering, Cornell University, Ithaca.
175. LOHMAN, G. M. AND MUCKSTADT, J. A. 1977. Optimal policy for batch operations: Backup, checkpointing, reorganization, and updating. ACM Trans. Datab. Syst. 2, 3, 209-222.
176. L∅LAND, J. AND HVASSHOVD, S.-O. 2006. Online, non-blocking relational schema changes. In Proceedings of the 10th International Conference on Extending Database Technology. Advances in Database Technology-EDBT 2006, Y. E. Ioannidis, M. H. Scholl, J. W. Schmidt, F. Matthes, M. Hatzopoulos, K. Böhm, A.Kemper, T. Grust, and C. Böhm, Eds. Lecture Notes in Computer Science, vol.3896. Springer- Verlag, New York, 405-422.
177. LOMET, D. B. 2000. High-speed on-line backup when using logical log operations. In Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data. ACM, New York, 34-45. (SIGMOD Record 29, 2).
178. LOMET, D. B. AND SALZBERG, B. 1992. Access method concurrency with recovery. In Proceedings of the 1992 ACM SIGMOD International Conference on Management of Data. ACM, New York, 351-360. (SIGMOD Record 21, 2). (For more details, see Lomet and Salzberg [1997].
179. LOMET, D. B. AND SALZBERG, B. 1997. Concurrency and recovery for index trees. VLDB J. 6, 3, 224-240.
180. LUMB,C. R., SCHINDLER, J.,GANGER,G. R., ANDNAGLE,D. 2000. Towards higher disk head utilization: Extracting free bandwidth from busy disk drives. In Proceedings of the 4th Symposium on Operating Systems Design and Implementation (OSDI 2000). USENIX Association, Berkeley, 87-102.
181. MAHESHWARI, U. AND LISKOV, B. 1997. Partitioned garbage collection of a large object store. In Proceedings of the 1997 ACM SIGMOD International Conference on Management of Data. 313-323. (SIGMOD Record 26, 2).
182. MAIER, D. S., MARTON, R. S., TROISI, J. H., AND CELIS, P. 1997. Relational database system and method with high data availability during table data restructuring. U.S. patent 5,625,815.
183. MALHOTRA, A. AND MUNROE, S. J. 1997. Schema evolution in persistent object systems. In Proceedings of the 7th International Workshop on Persistent Object Systems, R. Connor and S. Nettles, Eds. Morgan- Kaufmann, San Francisco, 194-204.
184. MANBER, U. 1984. Concurrent maintenance of binary search trees. IEEE Trans. Softw. Engin. SE-10, 6, 777-784.
185. MANBER, U. AND LADNER, R. E. 1982. Concurrency control in a dynamic search structure. In Proceedings of the ACM Symposium on Principles of Database Systems. ACM, New York, 268-282. (For a revision, see Manber and Ladner [1984].
186. MANBER, U. AND LADNER, R. E. 1984. Concurrency control in a dynamic search structure. ACMTrans. Datab. Syst. 9, 3, 439-455.
187. MARSHALL, B. J., HENDERSON, M. D., BAILEY, M. I., BRUCE, T. R., ROGALA, R. J.,WEBSTER, W. A., METZNER, D. F., AND DRES, P. J. 2006. Method and system for online reorganization of databases. U.S. patent 7,117,229.
188. MARTIN, J. 1975. Computer Data-Base Organization. Prentice-Hall, Englewood Cliffs, NJ.
189. MARTIN, JR., J. L. AND CROWN, JR., G. N. 2003a. IMS on-line reorganization utility. U.S. patent 6,606,631.
190. MARTIN, JR., J. L. AND CROWN, JR., G. N. 2003b. System and method for analyzing a database for on-line reorganization. U.S. patent 6,633,884.
191. MARUYAMA, K. AND SMITH, S. E. 1976. Optimal reorganization of distributed space disk files. Comm. ACM 19, 11, 634-642.
192. MATTHEWS, J. N., ROSELLI, D., COSTELLO, A. M.,WANG, R. Y., AND ANDERSON, T. E. 1997. Improving the performance of log-structured file systems with adaptive methods. In Proceedings of the 16th ACMSymposium on Operating Systems Principles. ACM, New York, 238-251. (Operat. Syst. Rev. 31, 5, SIGOPS).
193. MCAULIFFE,M. L.,CAREY,M. J., AND SOLOMON,M.H. 1998. Vclusters:Aflexible, fine-grained object clustering mechanism. In Proceedings of the 1998 ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA). ACM, New York, 230-243. (SIGPLAN Notices 33, 10).
194. MCCARTHY, J. 1960. Recursive functions of symbolic expressions and their computation by machine, Part I. Comm. ACM 3, 4, 184-195.
195. MCCREIGHT, A., SHAO, Z., LIN, C., AND LI, L. 2007. A general framework for certifying garbage collectors and their mutators. In Proceedings of the 2007 ACM SIGPLAN Conference on Programming Language Design and Implementation. ACM, New York, 468-479. (SIGPLAN Notices 42, 6).
196. MCIVER, JR., W. J. 1994. An approach to self-adaptive, on-line reclustering of complex object data. Ph.D. dessertation. Department of Computer Science, University of Colorado, Boulder.
197. MCIVER, JR., W. J. AND KING, R. 1994. Self-adaptive, on-line reclustering of complex object data. In Proceedings of the 1994 ACM SIGMOD International Conference on Management of Data. ACM, New York, 407-418. (SIGMOD Record 23, 2). (For more details, see McIver [1994].
198. MCNUTT, B. 1994. Background data movement in a log-structured disk subsystem. IBM J. Resear. Develop. 38, 1, 47-58.
199. MELTZER,H. S. 1975. An overview of the administration of data bases. In Proceedings of the 2nd USA-Japan Computer Conference. AFIPS Press, Reston, 365-370.
200. MELTZER, H. S. 1976. Structure and redundancy in the conceptual schema in the administration of very large data bases. In Proceedings of the 2nd International Conference on Very Large Data Bases, P. C. Lockemann and E. J. Neuhold, Eds. North-Holland, Amsterdam, The Netherlands, 13-25.
201. MENDELSON, H. AND YECHIALI, U. 1981. Optimal policies for data base reorganization. Oper. Resear. 29, 1, 23-36.
202. MENON, J. AND STOCKMEYER, L. 1998. An age-threshold algorithm for garbage collection in log-structured arrays and file systems. In Proceedings of the 12th Annual International Symposium on High-Performance Computing Systems and Application, J. Schaefer, Ed. Kluwer Academic Publishers, Hingham, 119-132. (More details appear in Resear. Rep. RJ 10120, IBM T. J. Watson Research Center, Yorktown Heights.)
203. MIX, F. 1992. DB2Reorg and continuous select access. In Proceedings of the Summer 1992 Meeting/SHARE 79. SHARE, Chicago, 2577-2614. Vol.II (microfiche). (Mix [1994] describes a revision.)
204. MIX, F. 1994. DB2 Reorg and continuous select. In Proceedings of the 6th Annual North American Conference of the International DB2 Users Group. IDUG, Chicago, 545-563.
205. MIZOGUCHI, M. AND NISHIYAMA, K. 1994. Database management system. Japan patent 06-67944.
206. MOGI, K. AND KITSUREGAWA, M. 1994. Dynamic parity stripe reorganizations for RAID5 disk arrays. In Proceedings of the 3rd International Conference on Parallel and Distributed Information Systems (PDIS 94). IEEE Computer Society Press, Los Alamitos, 17-26.
207. MOGI, K. AND KITSUREGAWA, M. 1995. Hot block clustering for disk arrays with dynamic striping: Exploitation of accesses locality and its performance analysis. In Proceedings of the 21st International Conference on Very Large Data Bases. Morgan-Kaufmann, San Francisco, 90-99.
208. MOHAN, C. 1993a. IBM's relational DBMS products: Features and technologies. In Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data. ACM, New York, 445-448. (SIGMOD Record 22, 2).
209. MOHAN, C. 1993b. A survey of DBMS research issues in supporting very large tables. In Proceedings of the 4th International Conference on Foundations of Data Organization and Algorithms, D. B. Lomet, Ed. Lecture Notes in Computer Science, vol.730. Springer-Verlag, New York, 279-300.
210. MOHAN, C., HADERLE, D., LINDSAY, B., PIRAHESH, H., AND SCHWARZ, P. 1992. ARIES: A transaction recovery method supporting fine-granularity locking and partial rollbacks using write-ahead logging. ACMTrans. Datab. Syst. 17, 1, 94-162.
211. MOHAN, C. AND NARANG, I. 1992. Algorithms for creating indexes for very large tables without quiescing updates. In Proceedings of the 1992 ACM SIGMOD International Conference on Management of Data. ACM, New York, 361-370. (SIGMOD Record 21, 2).
212. MOHAN, C. AND NARANG, I. 1993. An efficient and flexible method for archiving a data base. In Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data. ACM, New York, 139-146. (SIGMOD Record 22, 2).
213. MOITRA, A., IYENGAR, S. S., BASTANI, F. B., AND YEN, I.-L. 1988. Multi-level data structures: Models and performance. IEEE Trans. Softw. Engin. 14, 6, 858-867.
214. MONDAL, A. 2002. Query-centric online reorganization of indexed data in shared-nothing architectures. Ph.D. dissertation, School of Computing, National University of Singapore.
215. MONDAL, A., KITSUREGAWA, M., OOI, B. C., AND TAN, K.-L. 2001. R-tree-based data migration and self-tuning strategies in shared-nothing spatial databases. In Proceedings of the 9th ACMInternational Symposium on Advances in Geographic Information Systems. ACM, New York, 28-33. (For more details, see Mondal [2002].
216. MORSI, M. M. A. 1992. Extensible object-oriented databases with dynamic schemas. Ph.D. dissertation, College of Computing, Georgia Institute of Technology, Atlanta.
217. MORSI, M. M. A., NAVATHE, S. B., AND KIM, H.-J. 1991. A schema management and prototyping interface for an object-oriented database environment. In Proceedings of the IFIP Working Conference on Object- Oriented Approach in Information Systems, F. Van Assche, B. Moulin, and C. Rolland, Eds. North- Holland, Amsterdam, The Netherlands, 157-180. (For more details, see Morsi [1992].
218. MORSI, M. M. A., NAVATHE, S. B., AND KIM, H.-J. 1992. An extensible object-oriented database testbed. In Proceedings of the 8th International Conference on Data Engineering. IEEE Computer Society Press, Los Alamitos, 150-157. (For more details, see Morsi [1992].
219. MOSS, J. E. B.,MUNRO, D. S., AND HUDSON, R. L. 1997. PMOS: A complete and coarse-grained incremental garbage collector for persistent object stores. In Proceedings of the 7th International Workshop on Persistent Object Systems, R. Connor and S. Nettles, Eds. Morgan Kaufmann Publishers, San Francisco, 140-150. (Munro et al. [1999] describe an implementation.)
220. MUNRO, D. S., BROWN, A. L., MORRISON, R., AND MOSS, J. E. B. 1999. Incremental garbage collection of a persistent object store using PMOS. In Advances in Persistent Object Systems, Proceedings of the 8th International Workshop on Persistent Object Systems (POS8) and Proceedings of the 3rd International Workshop on Persistence and Java (PJW3), 1998, R. Morrison, M. J. Jordan, and M. P. Atkinson, Eds. Morgan-Kaufmann, San Francisco, 78-91.
221. NETTLES, S. AND O'TOOLE, J. 1993. Real-time replication garbage collection. In Proceedings of the ACM SIGPLAN '93 Conference on Programming Language Design and Implementation. ACM, New York, 217-226. (SIGPLAN Notices 28, 6).
222. NILSEN, K. D. AND SCHMIDT, W. J. 1992. Cost-effective object space management for hardware-assisted realtime garbage collection. ACM Lett. Prog. Lang. Syst. 1, 4, 338-354.
223. NURMI, O., SOISALON-SOININEN, E., AND WOOD, D. 1987. Concurrency control in database structures with relaxed balance. In Proceedings of the 6th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. ACM, New York, 170-176.
224. ODBERG, E. 1994. A global perspective of schema modification management for object-oriented data bases. In Proceedings of the 6th International Workshop on Persistent Object Systems, M. P. Atkinson, D. Maier, and V. Benzaken, Eds. Springer-Verlag, New York, 479-502.
225. OLSON, N. E. 1993. Partial indexing in POSTGRES. M.S. dissertation. Department of Electrical Engineering and Computer Science, University of California, Berkeley.
226. OMIECINSKI, E. 1985a. Concurrency during the reorganization of indexed files. In Proceedings of the 9th International Conference on Computer Software and Applications (COMPSAC 85). IEEE Computer Society Press, Los Alamitos, 482-488.
227. OMIECINSKI, E. 1985b. Incremental file reorganization schemes. In Proceedings of the 11th International Conference on Very Large Data Bases. Morgan-Kaufmann, San Francisco, 346-357.
228. OMIECINSKI, E. 1988. Concurrent storage structure conversion: from B+ tree to linear hash file. In Proceedings of the 4th International Conference on Data Engineering. IEEE Computer Society Press, Los Alamitos, 589-596. (For an extended revision, see Omiecinski [1989].
229. OMIECINSKI, E. 1989. Concurrent file conversion between B+-tree and linear hash files. Inf. Syst. 14, 5, 371-383.
230. OMIECINSKI, E. 1996. Concurrent file reorganization: Clustering, conversion and maintenance. Data Engin. 19, 2, 25-32.
231. IEEE-CS TC DE. OMIECINSKI, E., LEE, L., AND SCHEUERMANN, P. 1992. Concurrent file reorganization for record clustering: A performance study. In Proceedings of the 8th International Conference on Data Engineering. IEEE Computer Society Press, Los Alamitos, 265-272. (For more details, see Omiecinski et al. [1994
232. OMIECINSKI, E., LEE, L., AND SCHEUERMANN, P. 1994. Performance analysis of a concurrent file reorganization algorithm for record clustering. IEEE Trans. Knowl. Data Engin. 6, 2, 248-257.
233. OMIECINSKI, E. AND SCHEUERMANN, P. 1984. A global approach to record clustering and file reorganization. In Proceedings of the 3rd Joint BCS and ACM Symposium on Research and Development in Information Retrieval, C. J. van Rijsbergen, Ed. Cambridge Univ. Press, Cambridge, 201-219. (For later work, see Omiecinski [1985b].
234. ORACLE. 2005. Oracle Database 10g Release 2 online data reorganization & redefinition. Oracle White Paper.
235. OSBORN, S. L. 1989. The role of polymorphism in schema evolution in an object-oriented database. IEEE Trans. Knowl. Data Engin. 1, 3, 310-317.
236. OSSIA, Y., BEN-YITZHAK, O., GOFT, I., KOLODNER, E. K., LEIKEHMAN, V., AND OWSHANKO, A. 2002. A parallel, incremental and concurrent GC for servers. In Proceedings of the 2002 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI). ACM, New York, 129-140. (SIGPLAN Notices 37, 5). (For a revision, see Barabash et al. [2005
237. O'TOOLE, J., NETTLES, S., AND GIFFORD, D. 1993. Concurrent compacting garbage collection of a persistent heap. In Proceedings of the 14th ACM Symposium on Operating Systems Principles. ACM, New York, 161-174. (Operat. Syst. Rev. 27, 5, SIGOPS.)
238. OUSTERHOUT, J. AND DOUGLIS, F. 1989. Beating the I/O bottleneck: A case for log-structured file systems. Operat. Syst. Rev. 23, 1, 11-28. (For a revised, more detailed description, see Rosenblum and Ousterhout [1992].
239. PARK, J. S., BARTOSZYNSKI, R., DE, P., AND PIRKUL, H. 1990. Optimal reorganization policies for stationary and evolutionary databases. Manag. Sci. 36, 5, 613-631.
240. PARK, J. S., BARTOSZYNSKI, R., AND PIRKUL, H. 1989. Optimal database reorganization policies: A stochastic control approach. In Proceedings of the 22nd Annual Hawaii International Conference on System Sciences. Vol.3. IEEE Computer Society Press, Los Alamitos, 752-761. (For a revision, see Park et al. [1990].
241. PARK, J. S. AND SRIDHAR, V. 1997. Probabilistic model and optimal reorganization of B+-tree with physical clustering. IEEE Trans. Knowl. Data Engin. 9, 5, 826-832.
242. PAZ, H., BACON, D. F., KOLODNER, E. K., PETRANK, E., AND RAJAN, V. T. 2007. An efficient on-the-fly cycle collection. ACM Trans. Prog. Lang. Syst. 29, 4. Article 20.
243. PAZ, H., PETRANK, E., BACON, D. F., KOLODNER, E. K., AND RAJAN, V. T. 2005. An efficient on-the-fly cycle collection. In Compiler Construction: 14th International Conference, CC 2005, Held as Part of Joint European Conferences on Theory and Practice of Software, ETAPS 2005, R. Bodik, Ed. Lecture Notes in Computer Science, vol.3443. Springer-Verlag, New York, 156-171. (For a revision, see Paz et al. [2007
244. PEREIRA, H. M. 2000. Method and apparatus for reorganizing an active DBMS table. U.S. patent 6,122, 640.
245. PETERS, R. J. AND öZSU, M. T. 1995. Axiomatization of dynamic schema evolution in objectbases. In Proceedings of the 11th International Conference on Data Engineering. IEEE Computer Society Press, Los Alamitos, 156-164. (For a revision with more details, see Peters and özsu [1997].
246. PETERS, R. J. AND öZSU,M. T. 1997. An axiomatic model of dynamic schema evolution in objectbase systems. ACM Trans. Datab. Syst. 22, 1, 75-114.
247. PIZLO, F., FRAMPTON, D., PETRANK, E., AND STEENSGAARD, B. 2007. Stopless: a real-time garbage collector for multiprocessors. In Proceedings of the 6th International Symposium on Memory Management (ISMM 2007). ACM, New York, 159-172.
248. PIZLO, F., PETRANK, E., AND STEENSGAARD, B. 2008. A study of concurrent real-time garbage collectors. In Proceedings of the 2008 ACMSIGPLAN Conference on Programming Language Design and Implementation. ACM, New York, 33-44. (SIGPLAN Notices 43, 6).
249. PLOW, G. M., POURMIRZAIE, F. E., AND SHIOMI, T. 2008. Method for reorganizing a set of database partitions. U.S. patent 7,454,449.
250. POLLARI-MALMI, K., SOISALON-SOININEN, E., AND YLöNEN, T. 1996. Concurrency control in B-trees with batch updates. IEEE Trans. Knowl. Data Engin. 8, 6, 975-984.
251. PONG, M. 1990. An overview of NonStop SQL Release 2. Tandem Syst. Rev. 6, 2, 4-11.
252. PONNEKANTI, N. AND KODAVALLA, H. 2000. Online index rebuild. In Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data. ACM, New York, 529-538. May (SIGMOD Record 29, 2).
253. PRINTEZIS, T. AND DETLEFS, D. L. 2000. A generational mostly-concurrent garbage collector. In Proceedings of the International Symposium on Memory Management (ISMM 2000). ACM, New York, 143-154. (SIGPLAN Notices 36, 1, ACM 2001).
254. PU, C. 1985. On-the-fly, incremental, consistent reading of entire databases. In Proceedings of the 11th International Conference on Very Large Data Bases. Morgan-Kaufmann, San Francisco, 369-375. (For a revision, see Pu [1986].
255. PU, C. 1986. On-the-fly, incremental, consistent reading of entire databases. Algorithmica 1, 3, 271-287.
256. PU, C., HONG, C. H., AND WHA, J. M. 1988. Performance evaluation of global reading of entire databases. In Proceedings of the International Symposium on Databases in Parallel and Distributed Systems. IEEE Computer Society Press, Los Alamitos, 167-176.
257. PUFFITSCH,W. AND SCHOEBERL,M. 2008. Non-blocking root scanning for real-time garbage collection. In Proceedings of the 6th International Workshop on Java Technologies for Real-Time and Embedded Systems. ACM, 68-76.
258. RA, Y.-G. AND RUNDENSTEINER, E. A. 1995. A transparent object-oriented schema change approach using view evolution. In Proceedings of the 11th International Conference on Data Engineering. IEEE Computer Society Press, Los Alamitos, 165-172. (For a revision with more details, see Ra and Rundensteiner [1997
259. RA, Y.-G. AND RUNDENSTEINER, E. A. 1997. A transparent schema-evolution system based on object-oriented view technology. IEEE Trans. Knowl. Data Engin. 9, 4, 600-624.
260. RADOSEVICH, L. 1993. Hotel cans mainframes. Computerworld 27, 8, 1 and 16.
261. RAGHURAM, S., RANGANATH, S., OLSON, S., AND NANDI, S. 2000. Taming the down-time: High availability in SybaseASE12. In Proceedings of the 16th International Conference on Data Engineering. IEEE Computer Society Press, Los Alamitos, 111-120. (For more details of index reorganization, see Ponnekanti and Kodavalla [2000
262. RAHM, E. AND BERNSTEIN, P. A. 2006. An online bibliography on schema evolution. SIGMOD Record 35, 4, 30-31. (For the current bibliography, see http://se-pubs.dbs.uni-leipzig.de.)
263. RAM, S. AND SHANKARANARAYANAN, G. 2003. Research issues in database schema evolution: The road not taken.Working Paper 2003-2015, Information Systems Department, Boston University School of Management.
264. RAMíREZ, R. J., TOMPA, F. W., AND MUNRO, J. I. 1982. Optimum reorganization points for arbitrary database costs. Acta Informatica 18, 1, 17-30.
265. RENGARAJAN, T. K., DIMINO, L., AND CHUNG, D. 1996. Sybase System 11 online capabilities. Data Engin. 19, 2, 19-24.
266. ROBINSON, J. T. AND FRANASZEK, P. A. 1994. Analysis of reorganization overhead in log-structured file systems. In Proceedings of the 10th International Conference on Data Engineering. IEEE Computer Society Press, Los Alamitos, 102-110.
267. RODDICK, J. F. 1991. Dynamically changing schemas within database models. Austral. Comput. J. 23, 3, 105-109.
268. RODDICK, J. F. 1992. Schema evolution in database systems-An annotated bibliography. SIGMOD Record 21, 4, 35-40. (For a revision, see Roddick [1994
269. RODDICK, J. F. 1994. Schema evolution in database systems-An updated bibliography. Tech. rep. CIS- 94-1012, School of Computer and Information Science, University of South Australia, The Levels, S. Australia.
270. RODDICK, J. F. 1995. A survey of schema versioning issues for database systems. Inf. Softw. Tech. 37, 7, 383-393.
271. RONSTRöM,M. 2000. On-line schema update for a telecom database. In Proceedings of the 16th International Conference on Data Engineering. IEEE Computer Society Press, Los Alamitos, 329-338.
272. ROSENBLUM, M. AND OUSTERHOUT, J. K. 1992. The design and implementation of a log-structured file system. ACM Trans. Computer Syst. 10, 1, 26-52.
273. ROSENKRANTZ, D. J. 1978. Dynamic database dumping. In Proceedings of the ACM SIGMOD International Conference on Management of Data. ACM, New York, 3-8.
274. ROY, P., SESHADRI, S., SILBERSCHATZ, A., AND SUDARSHAN, S. 2002. Garbage collection in object-oriented databases using transactional cyclic reference counting. U.S. patent 6,363,403.
275. ROY, P., SESHADRI, S., SILBERSCHATZ, A., SUDARSHAN, S., AND ASHWIN, S. 1998. Garbage collection in objectoriented databases using transactional cyclic reference counting. VLDB J. 7, 3, 179-193.
276. RUDDY, J. A., SHYAM, K., SOCKUT, G. H., AND WATTS, J. A. 1999. Application of log records to data compressed with different encoding scheme. U.S. patent 5,897,641.
277. SAGIV, Y. 1985. Concurrent operations on B-trees with overtaking. In Proceedings of the 4th ACMSIGACTSIGMOD Symposium on Principles of Database Systems. ACM, New York, 28-37. (For a revision, see Sagiv [1986
278. SAGIV, Y. 1986. Concurrent operations on B*-trees with overtaking. J. Comput. Syst. Sci. 33, 2, 275-296.
279. SALANT, E. E. AND KOLODNER, E. K. 2002. Data structure for keeping track of objects remaining to be traced by concurrent garbage collector. U.S. patent 6,393,440.
280. SALEM, K. AND GARCIA-MOLINA, H. 1986. Disk striping. In Proceedings of the International Conference on Data Engineering. IEEE Computer Society Press, Los Alamitos, 336-342.
281. SALZBERG, B. 1985. Restructuring the Lehman-Yao tree. Tech. rep. BS-85-121, College of Computer Science, Northeastern University, Boston.
282. SALZBERG, B. AND DIMOCK, A. 1992. Principles of transaction-based on-line reorganization. In Proceedings of the 18th International Conference on Very Large Data Bases. Morgan-Kaufmann, San Francisco, 511-520.
283. SCHEUERMANN, P., PARK, Y. C., AND OMIECINSKI, E. 1989. A heuristic file reorganization algorithm based on record clustering. BIT 29, 3, 428-447.
284. SCHEUERMANN, P.,WEIKUM, G., AND ZABBACK, P. 1993. Adaptive load balancing in disk arrays. In Proceedings of the 4th International Conference on Foundations of Data Organization and Algorithms, D. B. Lomet, Ed. Lecture Notes in Computer Science, vol.730. Springer-Verlag, New York, 345-360. Foundations of Data Organization and Algorithms.
285. SCHEUERMANN, P., WEIKUM, G., AND ZABBACK, P. 1994. "Disk cooling" in parallel disk systems. Bull. Tech. Committee Data Engin. 17, 3, 29-40.
286. SCHEUERMANN, P., WEIKUM, G., AND ZABBACK, P. 1998. Data partitioning and load balancing in parallel disk systems. VLDB J. 7, 1, 48-66.
287. SCHMIDT, W. J. AND NILSEN, K. D. 1994. Performance of a hardware-assisted real-time garbage collector. In Proceedings of the 6th International Conference on Architectural Support for Programming Languages and Operating Systems. ACM, New York, 76-85. (Operat. Syst. Rev. 28, 5, ACM SIGOPS).
288. SCHOEBERL, M. AND PUFFITSCH, W. 2008. Non-blocking object copy for real-time garbage collection. In Proceedings of the 6th International Workshop on Java Technologies for Real-Time and Embedded Systems. ACM, New York, 77-84.
289. SCHUBERT, R. F. 1974. Directions in data base management technology. Datamation 20, 9 (Sept), 48-51.
290. SCHWARZ, P. AND SHOENS, K. 1994. Managing change in the Rufus system. In Proceedings of the 10th International Conference on Data Engineering. IEEE Computer Society Press, Los Alamitos, 170-179.
291. SEIDL,M. L.,WRIGHT, G. M., ANDWOLCZKO,M. I. 2008. Method and system for concurrent garbage collection and mutator execution. U.S. patent 7,421,539.
292. SELINGER, P. G. 1993. Predictions and challenges for database systems in the year 2000. In Proceedings of the 19th International Conference on Very Large Data Bases. Morgan-Kaufmann, San Francisco, 667-675.
293. SELTZER, M., BOSTIC, K., MCKUSICK, M. K., AND STAELIN, C. 1993. An implementation of a log-structured file system for UNIX. In Proceedings of the Winter 1993 USENIX Conference. USENIX Assoc., Berkeley, 307-326.
294. SEVERANCE, D. G. AND LOHMAN, G. M. 1976. Differential files: Their application to the maintenance of large databases. ACM Trans. Datab. Syst. 1, 3, 256-267. (For more details, see Lohman [1977].
295. SHASHA, D. AND GOODMAN, N. 1988. Concurrent search structure algorithms. ACMTrans. Datab. Syst. 13, 1, 53-90.
296. SHNEIDERMAN, B. 1973. Optimum data base reorganization points. Comm. ACM 16, 6, 362-365.
297. SIEBERT, F. 2008. Limits of parallel marking garbage collection. In Proceedings of the 7th International Symposium on Memory Management (ISMM '08). ACM, 21-29.
298. SILBERSCHATZ, A., STONEBRAKER, M., AND ULLMAN, J. 1991. Database systems: Achievements and opportunities. Comm. ACM 34, 10, 110-120.
299. SINGHAL, V., KAKKAD, S. V., ANDWILSON, P. R. 1992. Texas: An efficient, portable persistent store. In Proceedings of the 5th International Workshop on Persistent Object Systems, A. Albano and R. Morrison, Eds. Springer-Verlag, New York, 11-33.
300. SIWIEC, J. E. 1977. A high-performance DB/DC system. IBM Syst. J. 16, 2, 169-195.
301. SKUBISZEWSKI, M. AND VALDURIEZ, P. 1997. Concurrent garbage collection in O2. In Proceedings of the 23rd International Conference on Very Large Data Bases. Morgan-Kaufmann, San Francisco, 356-365.
302. SMITH, B. F. 1994. Understanding DB2 RUNSTATS statistics and version 3 enhancements. In Proceedings of the SHARE 82. Vol.II (CD-ROM). SHARE, Chicago.
303. SMITH, G. S. 1990. Online reorganization of key-sequenced tables and files. Tandem Syst. Rev. 6, 2, 52-59.
304. SOCKUT,G.H. 1974. Agraphics monitor for animation of dynamic processes.M.S. dissertation., Department of Electrical Engineering, Massachusetts Institute of Technology, Cambridge.
305. SOCKUT,G.H. 1977. Data base performance under concurrent reorganization and usage. Ph.D. dissertation, Division of Applied Sciences, Harvard University, Cambridge. (Also Tech. rep. 12-77, Center for Research in Computing Technology.)
306. SOCKUT, G. H. 1978. A performance model for computer data-base reorganization performed concurrently with usage. Oper. Res. 26, 5, 789-804. (For more details, see Sockut [1977].
307. SOCKUT, G. H. 1985. A framework for logical-level changes within data base systems. Computer 18, 5, 9-27.
308. SOCKUT, G. H. AND BEAVIN, T. A. 1998. Interaction between application of a log and maintenance of a table that maps record identifiers during online reorganization of a database. U.S. patent 5,721,915. (Also U.S. Patent 6,026,412, 2000.)
309. SOCKUT, G. H., BEAVIN, T. A., AND CHANG, C.-C. 1997. A method for on-line reorganization of a database. IBM Syst. J. 36, 3, 411-436. Erratum in 37, 1, 1998, p. 152.
310. SOCKUT, G. H. AND GOLDBERG, R. P. 1976. Motivation for data base reorganization performed concurrently with usage. Tech. rep. 16-76, Center for Research in Computing Technology, Harvard University, Cambridge, MA. (full article). (Also in Preprints, IEEE-CS Workshop on Operating and Data base Management Systems (Datab. Engin. 1, 1, 1977, IEEE-CS Technical Communication on Data Base Engineering), 18-19 (abstract). For more details, see Sockut [1977].
311. SOCKUT, G. H. AND GOLDBERG, R. P. 1979. Database reorganization- Principles and practice. ACM Comput. Surv. 11, 4, 371-395.
312. SOCKUT, G. H. AND IYER, B. R. 1996. A survey on online reorganization in IBM products and research. Data Engin. 19, 2, 4-11.
313. SöDERLUND, L. 1980. A study on concurrent data base reorganization. Ph.D. dissertation. Deparment of Information Processing and Computer Science, University of Stockholm, Sweden.
314. SöDERLUND, L. 1981a. Concurrent data base reorganization-Assessment of a powerful technique through modeling. In Proceedings of the 7th International Conference on Very Large Data Bases. ACM, New York, 499-509. (For more details, see Söderlund [1980].
315. SöDERLUND, L. 1981b. Evaluation of concurrent physical database reorganization through simulation modeling. In Proceedings of the ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems. ACM, New York, 19-32. (Perform. Eval. Rev. 10, 3, Fall, SIGMETRICS). (For more details, see Söderlund [1980].
316. SRINIVASAN, J., DAS, S., FREIWALD, C., CHONG, E. I., JAGANNATH, M., YALAMANCHI, A., KRISHNAN, R., TRAN, A.-T., DEFAZIO, S., AND BANERJEE, J. 2000. Oracle8i index-organized table and its application to new domains. In Proceedings of the 26th International Conference on Very Large Data Bases. Morgan-Kaufmann, San Francisco, 285-296.
317. SRINIVASAN, V. 1992. On-line processing in large-scale transaction systems. Ph.D. dissertation. Computer Sciences Department, University of Wisconsin, Madison. (Also Tech. rep. 1071.)
318. SRINIVASAN, V. AND CAREY, M. J. 1991a. On-line index construction algorithms. Tech. rep. 1008, Computer Sciences Department, University of Wisconsin, Madison. (Presented at 4th International Workshop on High-Performance Transaction Systems; For more details, see Srinivasan [1992]
319. SRINIVASAN, V. AND CAREY, M. J. 1991b. Performance of B-tree concurrency algorithms. In Proceedings of the 1991 ACM SIGMOD International Conference on Management of Data. ACM, New York, 416-425. (SIGMODRecord 20, 2). (For a revision, see Srinivasan and Carey [1993], For more details, see Srinivasan [1992].
320. SRINIVASAN, V. AND CAREY, M. J. 1992a. Compensation-based on-line query processing. In Proceedings of the 1992 ACM SIGMOD International Conference on Management of Data. ACM, New York, 331-340. (SIGMOD Record 21, 2). (For more details, see Srinivasan [1992].
321. SRINIVASAN, V. AND CAREY, M. J. 1992b. Performance of on-line index construction algorithms. In Proceedings of the 3rd International Conference on Extending Database Technology, A. Pirotte, C. Delobel, and G. Gottlob, Eds. Lecture Notes in Computer Science, vol.580. Springer-Verlag, New York, 293-309. (More details appear in Tech. rep. 1047, Computer Sciences Department, University of Wisconsin, Madison, 1991. (For even more details, see Srinivasan [1992].
322. SRINIVASAN, V. AND CAREY,M. J. 1993. Performance of B+-tree concurrency control algorithms. VLDB J. 2, 4, 361-406. (For more details, see Srinivasan [1992].
323. STANCHINA, S. AND MEYER, M. 2007. Mark-sweep or copying?: A "best of both worlds" algorithm and a hardware-supported real-time implementation. In Proceedings of the 6th International Symposium on Memory Management (ISMM 2007). ACM, New York, 173-182.
324. STONEBRAKER, M. 1981. Hypothetical data bases as views. In Proceedings of the ACM-SIGMOD 1981 International Conference on Management of Data. ACM, New York, 224-229.
325. STONEBRAKER, M. 1989. The case for partial indexes. SIGMOD Record 18, 4, 4-11.
326. STONEBRAKER, M., KATZ, R., PATTERSON, D., AND OUSTERHOUT, J. 1988. The design of XPRS. In Proceedings of the 14th International Conference on Very Large Data Bases. Morgan-Kaufmann, San Francisco, 318-330.
327. STRICKLAND, J. P.,UHROWCZIK, P. P., AND WATTS, V. L. 1982. IMS/VS: An evolving system. IBM Syst. J. 21, 4, 490-510.
328. SUBRAMANIAM, M. AND LOAIZA, J. 2005. Online reorganization and redefinition of relational database tables. U.S. patent 6,965,899.
329. SUN, X. 2005. Online reorganization in parallel database systems: Scalability, load balancing and high availability. Ph.D. dissertation, College of Computer Science, Northeastern University, Boston.
330. SUN, X., WANG, R., SALZBERG, B., AND ZOU, C. 2005. Online B-tree merging. In Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data. ACM, New York, 335-346.
331. TAKAHASHI, H. AND TAKAHASHI, J. 1990. Record-type change method by binary
332. TAKAHASHI, J. 1990. Hybrid relations for database schema evolution. In Proceedings of the 14th Annual International Computer Software and Applications Conference (COMPSAC 90). IEEE Computer Society Press, Los Alamitos, 465-470.
333. TAN, L. AND KATAYAMA, T. 1990. Meta operations for type management in object-oriented databases: A lazy mechanism for schema evolution. In Proceedings of the 1st International Conference on Deductive and Object-Oriented Databases, W. Kim, J.-M. Nicolas, and S. Nishio, Eds. North-Holland, Amsterdam, The Netherlands, 241-258.
334. TAYLOR, R. W. AND FRANK, R. L. 1976. CODASYL data-base management systems. ACMComput. Surv. 8, 1, 67-103.
335. TENE, G. AND WOLF, M. A. 2008. System and method for concurrent compacting self pacing garbage collection using loaded value and access barriers. U.S. patent 7,469,324.
336. TENG, J. Z. AND TODD, J. A. 2002. Method, system, and program for managing file names during the reorganization of a database object. U.S. patent 6,460,048.
337. TEOREY, T. J. AND FRY, J. P. 1982. Design of Database Structures. Prentice-Hall, Englewood Cliffs.
338. TRANĆON Y WIDEMANN, B. 2008. A reference-counting garbage collection algorithm for cyclical functional programming. In Proceedings of the 7th International Symposium on Memory Management (ISMM '08). ACM, New York, 71-80.
339. TRESCH, M. AND SCHOLL, M. H. 1993. Schema transformation without database reorganization. SIGMOD Record 22, 1, 21-27.
340. TROISI, J. 1994. Nonstop availability and database configuration operations. Tandem Syst. Rev. 10, 3, 18-23.
341. TROISI, J. 1996. Nonstop SQL/MP availability and database configuration operations. Data Engin. 19, 2, 12-18.
342. TUEL, J.W.G. 1978. Optimum reorganization points for linearly growing files. ACMTrans. Datab. Syst. 3, 1, 32-40.
343. VALDURIEZ, P. 1993. Parallel database systems: Open problems and new issues. Distrib. Paral. Datab. 1, 2, 137-165.
344. VECHEV, M. T., YAHAV, E., AND BACON, D. F. 2006. Correctness-preserving derivation of concurrent garbage collection algorithms. In Proceedings of the 2006 ACMSIGPLAN Conference on Programming Language Design and Implementation (PLDI '06). 341-353. (SIGPLAN Notices 41, 6).
345. VECHEV, M. T., YAHAV, E., BACON, D. F., AND RINETZKY, N. 2007. CGCExplorer: A semi-automated search procedure for provably correct concurrent collectors. In Proceedings of the 2007 ACM SIGPLAN Conference on Programming Language Design and Implementation. 456-467. (SIGPLAN Notices 42, 6).
346. Versant Object Technology. 1991. VERSANT System Reference Manual (for IBM RISC System/6000). Versant Object Technology.
347. VINGRALEK, R., BREITBART, Y., AND WEIKUM, G. 1994. Distributed file organization with scalable cost/performance. In Proceedings of the 1994 ACM SIGMOD International Conference on Management of Data. ACM, New York, 253-264. (SIGMOD Record 23, 2). (For a revision, see Breitbart et al. [1996]
348. VINGRALEK, R., BREITBART, Y., AND WEIKUM, G. 1998. SNOWBALL: Scalable storage on networks of workstations with balanced load. Distrib. Paral. Datab. 6, 2, 117-156.
349. WANG, J. ANDHU, Y. 2001. PROFS - Performance-oriented data reorganization for log-structured file system on multi-zone disks. In Proceedings of the 9th International Symposium on Modeling, Analysis, and Simulation of Computers and Telecommunication Systems (MASCOTS 2001). IEEE Computer Society Press, Los Alamitos, 285-292.
350. WANG, J. AND HU, Y. 2002. WOLF - A novel reordering write buffer to boost the performance of logstructured file systems. In Proceedings of the FAST '02 Conference on File and Storage Technologies. USENIX Association, Berkeley, 47-60. (For a revision, see Wang and Hu [2003].
351. WANG, J. AND HU, Y. 2003. A novel reordering write buffer to improve write performance of log-structured file systems. IEEE Trans. Comput. 52, 12, 1559-1572.
352. WANG, R. Y., ANDERSON, T. E., AND PATTERSON, D. A. 1999. Virtual log based file systems for a programmable disk. In Proceedings of the 3rd Symposium on Operating Systems Design and Implementation (OSDI '99). ACM, New York, 29-43. (Operat. Syst. Rev., ACM SIGOPS (For more details, see Tech. rep. UCB/CSD 98/1031, Computer Science Department, University of California, Berkeley, 1998.)
353. WEGIEL, M. AND KRINTZ, C. 2008. The mapping collector: Virtual memory support for generational, parallel, and concurrent compaction. In Proceedings of the 13th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS XIII). ACM, New York, 91-102. (Operat. Syst. Rev. 42, 2, ACM SIGOPS).
354. WEIKUM, G. 1989. Clustering vs. concurrency: A framework and a case study. Tech. rep. ACA-ST-096-189, MCC, Austin.
355. WEIKUM, G., ZABBACK, P., AND SCHEUERMANN, P. 1991. Dynamic file allocation in disk arrays. In Proceedings of the 1991 ACM SIGMOD International Conference on Management of Data. ACM, New York, 406-415. (SIGMOD Record 20, 2).
356. WIEDERHOLD, G. 1983. Database Design. McGraw-Hill, New York. 2nd Ed.
357. WILKES, J., GOLDING, R., STAELIN, C., AND SULLIVAN, T. 1996. The HP AutoRAID hierarchical storage system. ACM Trans. Comput. Syst. 14, 1, 108-136.
358. WILSON, P. R. 1992. Uniprocessor garbage collection techniques. In Proceedings of the International Workshop on Memory Management, Y. Bekkers and J. Cohen, Eds. Lecture Notes in Computer Science, vol.637. Springer-Verlag, New York, 1-42.
359. WILSON, T. B. 1979. Data base restructuring: Options and obstacles. In Proceedings of the European Conference on Applied Information Technology (EURO IFIP 79), P. A. Samet, Ed. North-Holland, Amsterdam, The Netherlands, 567-573.
360. WILSON, T. B. 1980. The description and usage of evolving schemas. In Proceedings of the 4th International Computer Software and Application Conference (COMPSAC '80). IEEE Computer Society Press, Los Alamitos, 546-551.
361. WINSLOW, L. E. AND LEE, J. C. 1975. Optimal choice of data restructuring points. In Proceedings of the International Conference on Very Large Data Bases. ACM, New York, 353-363.
362. WINTER. 2005. TopTen program winners. On the web site (http://www.wintercorp.com), search the press releases for the most recent TopTen Program Winners.
363. WOLCZKO, M. AND WILLIAMS, I. 1992. Multi-level garbage collection in a high-performance persistent object system. In Proceedings of the 5th International Workshop on Persistent Object Systems, A. Albano and R. Morrison, Eds. Springer-Verlag, New York, 396-418.
364. YAO, S. B., DAS, K. S., AND TEOREY, T. J. 1976. A dynamic database reorganization algorithm. ACM Trans. Datab. Syst. 1, 2, 159-174.
365. YONG, V.-F., NAUGHTON, J. F., AND YU, J.-B. 1994. Storage reclamation and reorganization in client-server persistent object stores. In Proceedings of the 10th International Conference on Data Engineering. IEEE Computer Society Press, Los Alamitos, 120-131.
366. ZABBACK, P., ONYUKSEL, I., SCHEUERMANN, P., AND WEIKUM, G. 1998. Database reorganization in parallel disk arrays with I/O service stealing. IEEE Trans. Knowl. Data Engin. 10, 5, 855-858.
367. ZDONIK, S. B. 1986. Maintaining consistency in a database with changing types. SIGPLAN Notices 21, 10, 120-127.
368. ZILIO, D. C. 1996. Modeling on-line rebalancing with priorities and executing on parallel database systems. In Proceedings of the CASCON '96. IBM Centre for Advanced Studies, Toronto, Ontario, Canada. CDROM, (For later, more extensive analysis, see Zilio [1998].
369. ZILIO, D. C. 1998. Physical database design decision algorithms and concurrent reorganization for parallel database systems. Ph.D. dissertation, Department of Computer Science, University of Toronto, Toronto, Ontario, Canada.
370. ZOU, C. AND SALZBERG, B. 1996a. Efficiently updating during on-line reorganization. Tech. rep. NU-CCS-96-108, College of Computer Science, Northeastern University, Boston.
371. ZOU, C. AND SALZBERG, B. 1996b. On-line reorganization of sparsely-populated B+-trees. In Proceedings of the 1996 ACM SIGMOD Intl. Conf. Management of Data. 115-124. (SIGMOD Record 25, 2).
372. ZOU, C. AND SALZBERG, B. 1996c. Towards efficient online database reorganization. Data Engin. 19, 2, 33-40.
373. ZOU, C. AND SALZBERG, B. 1998. Safely and efficiently updating during on-line reorganization. In Proceedings of the 24th Annual International Conference on Very Large Data Bases. Morgan-Kaufmann, San Francisco, 512-522. (For more details, see Zou and Salzberg [1996a].