{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:33:45Z","timestamp":1725492825853},"publisher-location":"Berlin, Heidelberg","reference-count":61,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540661566"},{"type":"electronic","value":"9783540487432"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48743-3_11","type":"book-chapter","created":{"date-parts":[[2007,10,20]],"date-time":"2007-10-20T14:39:50Z","timestamp":1192891190000},"page":"230-257","source":"Crossref","is-referenced-by-count":21,"title":["Providing Persistent Objects in Distributed Systems"],"prefix":"10.1007","author":[{"given":"Barbara","family":"Liskov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miguel","family":"Castro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liuba","family":"Shrira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Atul","family":"Adya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,11,19]]},"reference":[{"key":"11_CR1","unstructured":"A. Adya. Transaction Management for Mobile Objects Using Optimistic Concurrency Control. Master\u2019s thesis, Massachusetts Institute of Technology, Jan. 1994. Also available as MIT Laboratory for Computer Science Technical Report MIT\/LCS\/TR-626."},{"key":"11_CR2","volume-title":"PhD thesis","author":"A. Adya","year":"1999","unstructured":"A. Adya. Weak Consistency: A Generalized Theory and Optimistic Implementations for Distributed Transactions. PhD thesis, Massachusetts Institute of Technology, Cambridge, MA, Mar. 1999."},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"A. Adya, R. Gruber, B. Liskov, and U. Maheshwari. Efficient Optimistic Concurrency Control using Loosely Synchronized Clocks. In Proc. of ACM SIGMOD International Conference on Management of Data, pages 23\u201334, San Jose, CA, May 1995.","DOI":"10.1145\/223784.223787"},{"key":"11_CR4","volume-title":"Technical Report MIT\/LCS\/TR-178","author":"P. B. Bishop","year":"1977","unstructured":"P. B._ Bishop. Computer Systems with a Very Large Address Space and Garbage Collection. Technical Report MIT\/LCS\/TR-178, Laboratory for Computer Science, MIT, Cambridge, MA, May 1977."},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"P. Bogle and B. Liskov. Reducing Cross-Domain Call Overhead Using Batched Futures. In Proc. OOPSLA\u2019 94, pages 341\u2013359.ACM Press, 1994.","DOI":"10.1145\/191080.191133"},{"key":"11_CR6","unstructured":"M. Blaze. Caching in Large-Scale Distributed File Systems. Technical Report TR-397-92, Princeton University, January 1993."},{"key":"11_CR7","unstructured":"C. Boyapati. JPS: A Distributed Persistent Java System. Master\u2019s thesis, Massachusetts Institute of Technology, Sept. 1998."},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"M.J. Carey et al. Shoring Up Persistent Applications. In Proc. of ACM SIGMOD International Conference on Management of Data, pages 383\u2013394, Minneapolis, MN, May 1994. ACM Press.","DOI":"10.1145\/191839.191915"},{"key":"11_CR9","unstructured":"M. Castro, A. Adya, and B. Liskov. Lazy Reference Counting for TransactionalStorage Systems. Technical Report MIT-LCS-TM-567, MIT Lab for Computer Science, June 1997."},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"M. Castro, A. Adya, B. Liskov, and A. Myers. HAC: Hybrid Adaptive Caching for Distributed Storage Systems. In Proc. 17th ACM Symp. on Operating System Principles (SOSP), pages 102\u2013115, St. Malo, France, Oct. 1997.","DOI":"10.1145\/268998.266666"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"M. J. Carey, D. J. DeWitt, and J. F. Naughton. The OO7 Benchmark. In Proc. of ACM SIGMOD International Conference on Management of Data, pages 12\u201321, Washington D.C., May 1993.","DOI":"10.1145\/170036.170041"},{"key":"11_CR12","unstructured":"M. J. Carey, D. J. DeWitt, and J. F. Naughton. The OO7 benchmark. Technical Report; Revised Version dated 7\/21\/1994 1140, University of Wisconsin-Madison, 1994. At ftp:\/\/ftp.cs.wisc.edu\/OO7 ."},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"M. Carey, M. Franklin, and M. Zaharioudakis. Fine-Grained Sharing in a Page Server OODBMS. In Proc. of ACM SIGMOD International Conference on Management of Data, pages 359\u2013370, Minneapolis,MN, June 1994.","DOI":"10.1145\/191839.191911"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"J. S. Chase, H. M. Levy, M. J. Feeley, and E. D. Lazowska. Sharing and Protection in a Single-Address-Space Operating System. In ACM Transactions on Computer Systems, volume 12, Feb. 1994.","DOI":"10.1145\/195792.195795"},{"key":"11_CR15","unstructured":"F. J. Corbato. A Paging Experimentwith the Multics System, in Festschrift: In Honor of P. M. Morse, pages 217\u2013228. MIT Press, 1969."},{"key":"11_CR16","unstructured":"W.W. Chang and H. J. Schek. A Signature AccessMethod for the Starburst Database System. In Proceedings of the Fifteenth International Conference on Very Large Data Bases, pages 145\u2013153, Amsterdam, Netherlands, August 1989."},{"issue":"1","key":"11_CR17","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1109\/69.50908","volume":"2","author":"O. Deux","year":"1990","unstructured":"O. Deux et al. The Story of O2. IEEE Transactions on Knowledge and Data Engineering, 2(1):91\u2013108, March 1990.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"11_CR18","unstructured":"M. Day. Client Cache Management in a Distributed Object Database. PhD thesis, Massachusetts Institute of Technology, 1995. Also available as MIT Laboratory for Computer Science Technical Report MIT\/LCS\/TR-652."},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"M. Day, R. Gruber, B. Liskov, and A. C. Myers. Subtypes vs.Where Clauses: Constraining Parametric Polymorphism. In Proc. OOPSLA\u2019 95, pages 156\u2013168, Austin TX, Oct. 1995. ACM SIGPLAN Notices 30(10).","DOI":"10.1145\/217839.217852"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"M. Day, B. Liskov, U. Maheshwari, and A. C. Myers. References to Remote Mobile Objects in Thor. ACM Letters on Programming Languages and Systems, Mar. 1994.","DOI":"10.1145\/176454.176500"},{"key":"11_CR21","unstructured":"S. Ghemawat. The Modified Object Buffer: a Storage Management Technique for Object-Oriented Databases. PhD thesis, Massachusetts Institute of Technology, 1995. Also available as MIT Laboratory for Computer Science Technical Report MIT\/LCS\/TR-656."},{"key":"11_CR22","unstructured":"D. Gifford. Information Storage in a Decentralized Computer System. Technical Report CSL-81-8, Xerox Corporation, March 1983."},{"issue":"3","key":"11_CR23","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1145\/234889.234893","volume":"25","author":"C. Gerlhof","year":"1996","unstructured":"C. Gerlhof, A. Kemper, and G. Moerkotte. On the Cost of Monitoring and Reorganization of Object Bases for Clustering. SIGMOD Record, 25(3):22\u201327, September 1996.","journal-title":"SIGMOD Record"},{"key":"11_CR24","unstructured":"J. N. Gray and A. Reuter. Transaction Processing: Concepts and Techniques. Morgan Kaufmann Publishers Inc., 1993."},{"key":"11_CR25","volume-title":"PhD thesis","author":"R. Gruber","year":"1997","unstructured":"R. Gruber. Optimism vs. Locking: A Study of ConcurrencyControl for Client-Server Object-Oriented Databases. PhD thesis, M.I.T., Cambridge, MA, 1997."},{"issue":"2","key":"11_CR26","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0306-4379(84)90020-6","volume":"9","author":"T. Haerder","year":"1984","unstructured":"T. Haerder. Observations on Optimistic Concurrency Control Schemes. Information Systems, 9(2):111\u2013120, June 1984.","journal-title":"Information Systems"},{"key":"11_CR27","unstructured":"T. Johnson and D. Shasha. A Low Overhead High Performance Buffer Replacement Algorithm. In Proceedings of International Conference on Very Large Databases, pages 439\u2013450, 1994."},{"issue":"1","key":"11_CR28","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/69.50909","volume":"2","author":"W. Kim","year":"1989","unstructured":"W. Kim et al. Architecture of the ORION Next-Generation Database System. IEEE Transactions on Knowledge and Data Engineering, 2(1):109\u2013124, June 1989.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"11_CR29","unstructured":"D. Kossmann. Efficient Main-Memory Management of Persistent Objects. Shaker-Verlag, 1995. Dissertation, RWTH Aachen."},{"key":"11_CR30","doi-asserted-by":"crossref","unstructured":"B. Liskov, A. Adya, M. Castro, M. Day, S. Ghemawat, R. Gruber, U. Maheshwari, A. Myers, and L. Shrira. Safe and Efficient Sharing of Persistent Objects in Thor. In Proc. of ACM SIGMOD International Conference on Management of Data, pages 318\u2013329, Montreal, Canada, June 1996.","DOI":"10.1145\/233269.233346"},{"key":"11_CR31","unstructured":"B. Liskov, A. Adya, M. Castro, and Q. Zondervan. Type-safe Heterogenous Sharing Can Be Fast. In Proceedings of the 7th InternationalWorkshop on PersistentObject Systems, Cape May, NJ, May 1996."},{"key":"11_CR32","volume-title":"Programming Methodology Group Memo","author":"B. Liskov","year":"1994","unstructured":"B. Liskov, D. Curtis, M. Day, S. Ghemawat, R. Gruber, P. Johnson, and A. C. Myers. Theta Reference Manual. Programming Methodology Group Memo 88, MIT Laboratory for Computer Science, Cambridge, MA, Feb. 1994. Available at http:\/\/www.pmg.lcs.mit.edu\/papers\/thetaref\/ ."},{"key":"11_CR33","doi-asserted-by":"crossref","unstructured":"B. Liskov, S. Ghemawat, R. Gruber, P. Johnson, L. Shrira, and M. Williams. Replication in the Harp File System. In Proc. 13th ACM Symp. on Operating System Principles (SOSP), pages 226\u2013238. ACM Press, 1991.","DOI":"10.1145\/121132.121169"},{"issue":"10","key":"11_CR34","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1145\/125223.125244","volume":"34","author":"C. Lamb","year":"1991","unstructured":"C. Lamb, G. Landis, J. Orenstein, and D. Weinreb. The ObjectStore Database System. Comm. of the ACM, 34(10):50\u201363, October 1991.","journal-title":"Comm. of the ACM"},{"key":"11_CR35","doi-asserted-by":"crossref","unstructured":"G. Morrisett et al. TALx86: A Realistic Typed Assembly Language. Submitted for publication, 1999.","DOI":"10.21236\/ADA358572"},{"key":"11_CR36","unstructured":"J. C. Mogul, J. F. Barlett, R. N. Mayo, and A. Srivastava. Performance Implications of Multiple Pointer Sizes. In USENIX 1995 Tech. Conf. on UNIX and Advanced Computing Systems, pages 187\u2013200, New Orleans, LA, 1995."},{"key":"11_CR37","unstructured":"D. Muntz and P. Honeyman. Multi-level Caching in Distributed File Systems or Your Cache ain\u2019t nothin\u2019 but trash. In Winter Usenix Technical Conference, 1992."},{"key":"11_CR38","doi-asserted-by":"crossref","unstructured":"D. L. Mills. Network Time Protocol (Version 3) Specification, Implementation and Analysis. Network Working Report RFC 1305, March 1992.","DOI":"10.17487\/rfc1305"},{"key":"11_CR39","doi-asserted-by":"crossref","unstructured":"W. J. McIver and R. King. Self Adaptive, On-Line Reclustering of Complex Object Data. In Proc. of ACM SIGMOD International Conference on Management of Data, pages 407\u2013418, Minneapolis, MN, May 1994.","DOI":"10.1145\/191839.191924"},{"key":"11_CR40","doi-asserted-by":"crossref","unstructured":"U. Maheshwari and B. Liskov. Fault-Tolerant Distributed Garbage Collection in a Client-Server Object-Oriented Database. In Third International Conference on Parallel and Distributed Information Systems, Austin, Sept. 1994.","DOI":"10.1109\/PDIS.1994.331710"},{"key":"11_CR41","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s004460050026","volume":"102","author":"U. Maheshwari","year":"1997","unstructured":"U. Maheshwari and B. Liskov. Collecting Cyclic Distributed Garbage by Controlled Migration. Distributed Computing, 10(2):79\u201386, 1997.","journal-title":"Distributed Computing"},{"key":"11_CR42","doi-asserted-by":"crossref","unstructured":"U. Maheshwari and B. Liskov. Partitioned Collection of a Large Object Store. In Proc. of SIGMOD International Conference on Management of Data, pages 313\u2013323, Tucson, Arizona, May 1997. ACM Press.","DOI":"10.1145\/253260.253338"},{"key":"11_CR43","doi-asserted-by":"crossref","unstructured":"U. Maheswari and B. Liskov. Collecting Cyclic Distributed Garbage using Back Tracing. In Proc. of the ACM Symposium on Principles of Distributed Computing, Santa Barbara, California, Aug. 1997.","DOI":"10.1145\/259380.259444"},{"issue":"2","key":"11_CR44","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/96105.96109","volume":"8","author":"J. E","year":"1990","unstructured":"J. E. B. Moss. Design of the Mneme Persistent Object Store. ACM Transactions on Office Information Systems, 8(2):103\u2013139, March 1990.","journal-title":"ACM Transactions on Office Information Systems"},{"key":"11_CR45","doi-asserted-by":"crossref","unstructured":"J. E. B. Moss. Working with Persistent Objects: To Swizzle or Not to Swizzle. IEEE Transactions on Software Engineering, 18(3), August 1992.","DOI":"10.1109\/32.153378"},{"key":"11_CR46","doi-asserted-by":"crossref","unstructured":"M. McAuliffe and M. Solomon. A Trace-Based Simulation of Pointer Swizzling Techniques. In Proc. International Conf. on Data Engineering, Mar. 1995.","DOI":"10.1109\/ICDE.1995.380410"},{"key":"11_CR47","doi-asserted-by":"crossref","unstructured":"G. Morrisett, D. Walker, K. Crary, and N. Glew. From system F to typed assembly language. In Proc. 25th ACM Symp. on Principles of Programming Languages (POPL), San Diego, California, Jan. 1998.","DOI":"10.1145\/268946.268954"},{"key":"11_CR48","unstructured":"Ontos. Inc. Ontos reference manual, 1992."},{"key":"11_CR49","doi-asserted-by":"crossref","unstructured":"E. J. O\u2019Neil, P. E. O\u2019Neil, and G. Weikum. The LRU-KPage Replacement Algorithm For Database Disk Buffering. In Proc. of ACM SIGMOD International Conference on Management of Data, Washington, D.C., May 1993.","DOI":"10.1145\/170035.170081"},{"key":"11_CR50","unstructured":"J. O\u2019Toole and L. Shrira. Opportunistic Log: Efficient Reads in a Reliable Storage Server. In Proc. of First Usenix Symposium on Operating Systems Design and Implementation, pages 119\u2013128. ACM Press, 1994."},{"key":"11_CR51","unstructured":"J. O\u2019Toole and L. Shrira. Shared Data Management Needs Adaptive Methods. In In Proc. of IEEE Workshop on Hot Topics in Operating Systems, May 1995."},{"key":"11_CR52","unstructured":"A. Parthasarathi. The NetLog: An Efficient, Highly Available, Stable Storage Abstraction. Master\u2019s thesis, Massachusetts Institute of Technology, June 1998."},{"key":"11_CR53","doi-asserted-by":"crossref","unstructured":"J. Robinson and N. Devarakonda. Data Cache Management Using Frequency-Based Replacement. In Proceedings of ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, pages 134\u2013142, 1990.","DOI":"10.1145\/98457.98523"},{"key":"11_CR54","unstructured":"Seagate Technology, Inc. http:\/\/www.seagate.com\/ , 1997."},{"key":"11_CR55","doi-asserted-by":"crossref","unstructured":"V. Singhal, S. V. Kakkad, and P. R. Wilson. Texas: An Efficient, Portable Persistent Store. In 5th Int\u2019l Workshop on Persistent Object Systems, San Miniato, Italy, Sept. 1992.","DOI":"10.1007\/978-1-4471-3209-7_2"},{"key":"11_CR56","unstructured":"LOOM-Large Object-Oriented Memory for Smalltalk-80 Systems, pages 298\u2013307. Morgan Kaufmann Publishers, Inc., San Mateo, CA, 1990."},{"key":"11_CR57","doi-asserted-by":"crossref","unstructured":"M. Tsangaris and J. Naughton. A stochastic approach for clustering in object bases. In Proc. ACM SIGMOD International Conference on Management of Data, pages 12\u201321, Denver, CO, 1991. ACM.","DOI":"10.1145\/115790.115792"},{"key":"11_CR58","unstructured":"S. J. White and D. J. Dewitt. A performance study of alternative object faulting and pointer swizzling strategies. In Proceedings of the Eighteenth International Conference on Very Large Data Bases, pages 419\u2013431, Vancouver, BC, Canada, 1992."},{"key":"11_CR59","doi-asserted-by":"crossref","unstructured":"S. J. White and D. J. Dewitt. Quickstore: A high performance mapped object store. In SIGMOD\u2019 94, pages 187\u2013198, 1994.","DOI":"10.1145\/191839.191919"},{"key":"11_CR60","doi-asserted-by":"crossref","unstructured":"S. J. White and D. J. Dewitt. Implementing crash recovery in QuickStore: A performance study. In SIGMOD\u2019 95, pages 187\u2013198. ACM Press, 1995.","DOI":"10.1145\/223784.223814"},{"issue":"4","key":"11_CR61","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1145\/278245.278249","volume":"22","author":"M. Zaharioudakis","year":"1997","unstructured":"M. Zaharioudakis, M. J. Carey, and M. J. Franklin. Adaptive, Fine-Grained Sharing in a Client-Server OODBMS: A Callback-Based Approach. ACM Transactions on Database Systems, 22(4):570\u2013627, Dec. 1997.","journal-title":"ACM Transactions on Database Systems"}],"container-title":["Lecture Notes in Computer Science","ECOOP\u2019 99 \u2014 Object-Oriented Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48743-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,26]],"date-time":"2021-08-26T00:24:27Z","timestamp":1629937467000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48743-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540661566","9783540487432"],"references-count":61,"URL":"https:\/\/doi.org\/10.1007\/3-540-48743-3_11","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}