Abbott, R. J. “Resourceful Systems for Fault Tolerance, Reliability, and Safety.”. ACM Computing Surveys.. 1990; 22(1):35–68.
Adams, E. “Optimizing Preventative Service of Software Products.”. IBM Journal of Research and Development.. 1984; 28(1):2–14.
Agha, G.A.Actors: A Model of Concurrent Computation in Distributed Systems. Cambridge: MIT Press, 1987.
Aho, A. V., Ulman, J., Hopcroft, J. Data Structures and Algorithms. In: Computer Science and Information Processing.. Reading, MA: Addison-Wesley; 1987.
Alsberg, P. A., and J. D. Day. (1976). A Principle for Resilient Sharing of Distributed Resources. 2nd International Conference on Software Engineering. 562-570.
Anderson T., ed. Resilient Computing Systems. 2 vols. New York: John Wiley and Sons, 1985.
Anderson, T., Lee, P.A.Fault-Tolerance Principles and Practice. Englewood Cliffs, NJ: Prentice Hall, 1981.
Anderson, T., Randell, B.Computing Systems Reliability. Cambridge: Cambridge University Press, 1979.
Andrade, J.M., Carges, M.T., Kovach, K.R.Building a Transaction Processing System on UNIX Systems. UniForum, San Francisco, 1989.
Anon-Et-Al. “A Measure of Transaction Processing Power.”. Datamation.. 1985; 31(7):112–118.
Astrahan, M. M., Blasgen, M. W., Chamberlin, D. D., Eswaran, K. P., Gray, J., Griffiths, P. P., King, W. F., Lorie, R. A., McJones, P. R., Mehl, J. W., Putzolu, G. R., Traiger, I. L., Watson, V. “System R: A Relational Approach to Database Management.”. ACM TODS.. 1976; 1(2):97–137.
Astrahan, M. M., Blasgen, M. W., Chamberlin, D. D., Gray, J., Griffiths, P. P., King, W. F., Lorie, R. A., McJones, P. R., Mehl, J. W., Putzolu, G. F., Slutz, D. R., Strong, H. R., Tiberio, P., Traiger, I. L., Yost, B. “An Overview of System R: A Relational Database System.”. IEEE Computer.. 1979; 13(4):43–55.
Astrahan, M. M., Blasgen, M. W., Chamberlin, D. D., Gray, J., King, W. F., Lindsay, B. G., Lorie, R. A., Mehl, J. W., Price, T. G., Putzolu, G. R., Schkolnick, M., Selinger, P. G., Slutz, D. R., Strong, H. R., Traiger, I. L., Wade, W. B., Yost, R. A. “System R: An Architectural Overview.”. IBM Systems Journal.. 1981; 20(1):41–62.
Avizienis, A. Software Fault Tolerance. IFIP 11th World Computer Congress, 1989; 491–498.
Avizienis, A., P. Gunningberg, J. P. J. Kelly, L. Stringini, K. S. Tso, and U. Voges. (1985). The UCLA Dedix System: A Distributed Testbed for Multi-Version Software. 15th FTCS. 126-134.
Avizienis, A., Kopetz, H., Laprie, J.C. Dependable Computing and Fault-Tolerant Systems. Springer-Verlag, New York, 1987.
Bancilhon, F., W. Kim, and H. F. Korth. (1985). A Model of CAD Transactions. 11th VLDB. 25-33.
Banneijee, J., Jordan, J., Batman, R. Precision Locks. ACM SIGMOD, 1981; 194–206.
Barghouti, Kaiser. “Concurrency Control in Advanced Database Systems.” ACM. Computing Surveys.. 1991; 23(3):269.
Bartlett, J. (1981). A NonStop™ Kernel. 8th ACM SIGOPS SOSP. 22-29.
Bayer, R., Elhardt, K. “A Database Cache for High Performance and Fast Restart in Database Systems.”. ACM TODS.. 1984; 9(4):503–525.
Bayer, R., McCreight, E. M. “Organization and Maintenance of Large Ordered Indexes.”. Acta Informatica.. 1972; 1(3):173–189.
Bayer, R., Schkolnick, M. “Concurrency of Operations on B-Trees.”. Acta Informatica.. 1977; 9(1):1–21.
Bayer, R., Unterauer, K. “Prefix B-Trees.”. ACM TODS.. 1977; 2(1):11–26.
Beeri, C., P. A. Bernstein, N. Goodman, M. Y. Lai, and D. E. Shasha. (1983). A Concurrency Control Theory for Nested Transactions. 2nd ACM SIGACT-SIGOPS PODS. 45-62.
Beeri, C., and R. Obermarck. (1981). A Resource Class Independent Deadlock Detection Algorithm. 7th VLDB. 166-178.
Bell, C.G., Newell, A.Computer Structures: Readings and Examples. New York: McGraw-Hill, 1971.
Bentley, J. L. “Multidimensional Binary Search Trees in Database Applications.”. IEEE SE.. 1979; 5(4):333–340.
Bernstein, P. A., Emberton, W. T., Trehan, V. “DECdta: Digital’s Distributed Transaction Processing Architecture.”. Digital Technical Journal.. 1991; 3(1):10–17.
Bernstein, P. A., Goodman, N. “An Algorithm for Concurrency Control and Recovery in Replicated Distributed Databases.”. ACM TODS.. 1984; 9(4):596–615.
Bernstein, P. A., Goodman, N., Wong, E., Reeve, C. L., Rothnie, J. B. “Query Processing in a System for Distributed Databases (SSD-1).”. ACM TODS.. 1981; 6(4):602–625.
Bernstein, P.A., Hadzilacos, V., Goodman, N.Concurrency Control and Recovery in Database Systems. Reading, MA: Addison-Wesley, 1987.
Bernstein, P.A., Hsu, M., Mann, B. Implementing Recoverable Requests Using Queues. ACM SIGMOD, 1990; 112–122.
Bernstein, P. A., Shipman, D. W., Rothnie, J. W. “Concurrency Control in a System for Distributed Databases (SDD-1).”. ACM TODS.. 1980; 5(1):18–51.
Bertino, E., Kim, W. “Indexing Techniques for Queries on Nested Objects.”. IEEE Transactions on Data and Knowledge Engineering.. 1989; 1(2):196–214.
Biliris, A. (1987). Operation Specific Locking in B-Trees. 6th ACM PODS. 159-169.
Birrell, A. D., Levin, R., Needham, R. M., Schroeder, M. D. “Grapevine: An Exercise in Distributed Computing.”. CACM.. 1982; 25(4):260–274.
Birrell, A. D., Nelson, B. J. “Implementing Remote Procedure Calls.”. ACM TOCS.. 1984; 2(1):39–59.
Bitton, D., D. J. DeWitt, and C. Turbyfill. (1983). Benchmarking Database Systems: A Systematic Approach. 9th VLDB. 8-19.
Bitton, D. and J. Gray. (1988). Disc Shadowing. 14th VLDB. 331-338.
Bjork, L.A. Recovery Scenarios for a DB/DC System. SJCC, 1973; 142–146.
Bjork, L. A., Davies, C. T. “The Semantics of the Preservation and Recovery of Integrity in a Data System.”. IBM General Products Division, TR. 1972; 02:540.
Blasgen, M. W., Casey, R. G., Eswaran, K. P. “An Encoding Method for Multifield Sorting and Indexing.”. CACM.. 1977; 20(11):874–877.
Blasgen, M. W., Eswaran, K. P. “Storage and Access in Relational Databases.”. IBM Systems Journal.. 1977; 4(8):363–374.
Blasgen, M. W., Gray, J., Mitoma, M. A., Price, T. G., “The Convoy Phenomenon.”. ACM Operating Systems Review. 1979;13(2):20–25
Bloom, B. H. “Space/Time Tradeoffs in Hash Coding with Allowable Errors.”. CACM.. 1970; 13(7):422–426.
Borr, A. (1981). Transaction Monitoring in Encompass [TM]: Reliable Distributed Transaction Processing. 7th VLDB. 155-165.
Borr, A. (1984). Robustness to Crash in a Distributed Database: A Non Shared-Memory Multi-Processor Approach. 10th VLDB. 445-453.
Brinch Hansen, P. “The Nucleus of a Multiprogramming System.”. CACM.. 1970; 13(4):238–250.
Brinch Hansen, P.Operating System Principles. Englewood Cliffs, NJ: Prentice Hall, 1973.
Burkes, D. L., and R. K. Treiber. (1990). Design Approaches for Real-Time Transaction Processing Remote Site Recovery. 35th IEEE Compcon 90. 568-572.
Carey, M. J., D. J. DeWitt, J. E. Richardson, and E. J. Shekita. (1986). Object and File Management in the EXODUS Extensible Database System. 12th VLDB. 91-100.
Ceri, S., Pelagatti, G.Distributed Databases: Principles and Systems. New York: McGraw-Hill, 1984.
Chamberlin, D., A. Gilbert, and R. Yost. (1981). A History of System R and the SQL/Data System. 7th VLDB. 456-464.
Chamberlin, D. D., Astrahan, M. M., Kung, W. F., Lorie, R. A., Mehl, J. W., Schkolnick, M., Sellinger, P. G., Slutz, D. R., Wade, W. B., Yost, R. A. “Support for Repetitive Transactions and Ad Hoc Queries in System R.”. ACM TODS.. 1981; 1(6):70–94.
Chamberlin, D. D., Astrahan, M. M., King, W. F., Lorie, R. A., Mehl, J. W., Price, T. G., Schkolnick, M., Selinger, P. G., Slutz, D. R., Wade, W. B., Yost, R. A. “SEQUEL 2: A Unified Approach to Data Definition, Manipulation, and Control.”. IBM Journal of Research and Development.. 1976; 20(6):560–575.
Chamberlin, D. D., J. Gray, and I. L. Traiger. (1975). Views, Authorization, and Locking. 1975 ACM National Computer Conference. 425-4130.
Chamberlin, D. D., Griffiths, P. P., Gray, J., Traiger, I. L., Wade, B. W. Database System Authorization. In: Foundations of Secure Computing.. Orlando, FL: Academic Press; 1978.
Chang, A., Mergen, M. F., Rader, R. K., Roberts, J. A., Porter, S. L. “Evolution of Storage Facilities in AIX Version 3 for RISC System/6000 Processors.”. IBM Journal of Research and Development.. 1990; 34(1):105–109.
Cheng, J. M., Loosley, C. R., Shibamiya, A., Worthington, P. S. “IBM Database 2 Performance: Design, Implementation, and Tuning.”. IBM Systems Journal.. 1984; 23(2):189–210.
Chou, H., and D. Dewitt. (1985). An Evaluation of Buffer Management Strategies for Relational Database Systems. 11th VLDB. 127-141.
Chrysanthis, P. K., Ramamritham, K. ACTA: The SAGA Continues. In: Transaction Models for Advanced Database Applications.. San Mateo, CA: Morgan Kaufmann; 1991.
Chrysanthis, P.K., Ramamritham, K. ACTA: A Framework for Specifying and Reasoning about Transaction Structure and Behavior. ACM SIGMOD, 1990; 194–203.
Clark, B. E., Corrigan, M. J. “Application System/400 Performance Characteristics.”. IBM Systems Journal.. 1989; 28(3):407–423.
CODASYL. “Report of the CODASYL Data Description Language Committee.”. Information Systems.. 1978; 3(4):247–320.
Codd, E. F. “A Relational Model of Data for Large Shared Databanks.”. CACM.. 1970; 13(6):377–387.
Codd, E. F. “Relational Database: A Practical Foundation for Productivity.”. CACM.. 1982; 25(2):109–118.
Comer, D., “The Ubiquitous B-Tree.”. ACM Computing Surveys. 1979;11(2):121–137
Cooper, E.C. Analysis of Distributed Commit Protocols. ACM SIGMOD, 1982; 175–183.
Cooper, T.IBM OS/2 Extended Edition Database Manager (API) and Query Manager Version 1.1. White Plains, NY: IBM, 1989. [GC24-3399-00.].
Copeland, G., Keller, T., Smith, M. Database Buffer and Disk Configurating and the Battle of the Bottlenecks. In: High Performance Transaction Processing Systems. Springer-Verlag Lecture Notes in Computer Science.. New York: Springer-Verlag; 1992.
Cristian, F. “Understanding Fault-Tolerant Distributed Systems.”. CACM.. 1991; 34(2):56–78.
Crus, R. A. “Data Recovery in IBM Database 2.”. IBM Systems Journal.. 1984; 23(2):178–188.
Daniels, D. S., Spector, A. Z., Thompson, D. S. “Distributed Logging for Transaction Processing.”. ACM SIGMOD Record.. 1987; 16(3):82–95.
Dash, J. R., Ojala, R. N. “IBM Database 2 in an Information Management System Environment.”. IBM Systems Journal.. 1984; 23(2):165–177.
Date, C.J. A Guide to the SQL Standard., 2nd ed. Reading, MA: Addison-Wesley, 1988.
Date, C.J., White, C.J.A Guide To DB2: A User’s Guide to the IBM Product IBM DATABASE 2 (a Relational Database Management System for the MVS Environment) and its Major Companion Products QMF, AS, CSP, etc. Reading, MA: Addison-Wesley, 1988.
Davies, C. T. “A Recovery/Integrity Architecture for a Data System.”. IBM General Products Division, TR. 1972; 02:528.
Davies, C.T. Recovery Semantics for a DB/DC System. SJCC, 1973; 136–141.
Davies, C. T. “Data Processing Spheres of Control.”. IBM Systems Journal.. 1978; 17(2):179–198.
Davis, S. H. “Design of VMS Volume Shadowing Phase II: Host-Based Shadowing.”. Digital Technical Journal.. 1991; 3(3):7–15.
Dayal, U., Hsu, M., Ladin, R. Organizing Long-Running Activities with Triggers and Transactions. ACM SIGMOD, 1990; 204–214.
Dayal, U., M. Hsu, and R. Ladin. (1991). A Transaction Model for Long-Running Activities. 17th VLDB. 113-122.
Installation Guide, AA-N686H-TE
Concepts and Design Guidelines, AA-PFVCA-TE
Writing Server Procedures, AA-N691F-TE
Managing Applications, AA-N689F-TE
Writing Applications, AA-LC14C-TE
Application Definition Utility, AA-U715F-TE
Systems Interface Programming, AA-EA12E-TE
TP System Case Study: Database and Application Development, AA-NF67A-TE
AVERTZ Application Overview, AA-PHG1A-TE
Littleton, MA: Digital Equipment Corporation.
Getting Started with Rdb/VMS, AA-PJC8A-TE
Glossary and Master Index, AA-PJC8A-TE
Guide to using SQL, AA-JM33E-TE
SQL Reference Manual, AA-JM32E-TE
Guide to Distributed Transactions, AA-PCU6B-TE
Guide to Database Design and Definition, AA-N034F-TE
Guide to Database Maintenance, AA-N035F-TE
Guide to Databse Performance and Tuning, AA-PJC7A-TE
Guide to Using SQL/Services, AA-ND79C-TE
SQL Reference Manual, AA-JM32E-TE
RMU (utilities) Reference Manual, AA-PJC5A-TE
Installation Guide, AA-N032K-TE
Nashua, NH: Digital Equipment Corporation.
DEC-RTR. (1991). DEC Reliable Transaction Router (RTR) for VMS
Application Programmer’s Reference Manual, AA-PWGA-TE
Installation Guide, AA-PHWJA-TE
System Manager’s Manual, AA-PHWHA-TE
Marlboro, MA: Digital Equipment Corporation.
DeWitt, D.J., Katz, R.H., Olken, F., Shapiro, L.D., Stonebraker, M., Wood, D. Implementation Techniques for Main Memory Database Systems. ACM SIGMOD:, 1984:1–8
Dijkstra, E. W. “Solution of a Problem in Concurrent Programming Control.”. CACM.. 1965; 8(9):569.
Dijkstra, E. W. “Co-Operating Sequential Processes.”. In: Programming Languages.. London: Academic Press; 1968.
Duquaine, W. V. What’s Right and What’s Wrong with Client Server Models. In: Proceedings of High Performance Transaction Processing Systems.. Monterey, CA: Monterey; 1992.
Effelsberg, W., Haeder, T. “Principles of Database Buffer Management.”. ACM TODS.. 1984; 9(4):560–595.
ElAbbadi, A., D. Skeen, and F. Cristian. (1985). An Efficient Fault-Tolerant Protocol for Replicated Databases. 4th AMC PODS. 215-229.
ElAbbadi, A., and S. Toueg. (1986). Maintaining Availability in Partitioned Replicated Databases. 5th ACM PODS. 240-251.
Ellis, C. “Concurrent Search and Inserts in 2-3 Trees.”. Acta Informatica.. 1980; 14(1):63–86.
Ellis, C. Extendible Hashing for Concurrent Operations and Distributed Data. ACM SIGMOD.. 1982; 1:106–115.
Ellis, C. Concurrency Control and Linear Hashing. ACM PODS.. 1985; 1:1–7.
Ellis, C. “Concurrency in Linear Hashing.”. ACM TODS.. 1987; 12(2):195–217.
Enbody, R. J., Du, H. C. “Dynamic Hashing Schemes.”. ACM Computing Sutweys.. 1988; 20(2):85–113.
Englert, S., Gray, J. “Performance Benefits of Parallel Query Execution and Mixed Workload Support in NonStop SQL Release.”. Tandem System Review.. 1991; 6(2):12–23.
Englert, S., Kocher, T., Gray, J., Shah, P. “The NonStop SQL Release 2 Benchmark.”. Tandem System Review.. 1991; 6(2):12–23.
Eppinger, J. L. Virtual Memory Management for Transaction Processing. In: Ph.D. diss., CMU-CS-89-115. Carnegie Mellon University; 1989.
Eppinger, J.L., Mummert, L.B., Spector, A.Z.Camelot and Avalon: A Distributed Transaction Facility. San Mateo, CA: Morgan Kaufmann, 1991.
Epstein, R., M. Stonebraker, and E. Wong. Distributed Query Processing in a Relational Database System. ACM SIGMOD. 169-180.
Eswaran, K. P., Gray, J., Lorie, R., Traiger, I. L. “The Notions of Consistency and Predicate Locks in a Database System.”. CACM.. 1976; 19(11):624–633.
Fagin, R., Nievergelt, J., Pippenger, N., Strong, H. R. “Extendible Hashing: A Fast Access Method for Dynamic Files.”. ACM TODS.. 1979; 4(3):315–344.
Ferrari, D.Computer Systems Performance Evaluation. Englewood Cliffs, NJ: Prentice Hall, 1978.
Ford, R., Calhoun, J., Concurrency Control Mechanisms and the Serializability of Concurrent Tree Algorithms. ACM Symposium on Principles of Database Systems. 1984; 1:51–61
Frank, A. (1981). Application of DBMS to Land Information Systems. 7th VLDB. 448-453.
Fu, A., and T. Kameda. (1989). Concurrency Control for Nested Transactions Accessing B-Trees. 8th ACM PODS. 270-285.
Garcia-Molina, H. “Reliability Issues for Fully Replicated Distributed Databases.”. Computer.. 1982; 15(9):34–42.
Garcia-Molina, H. “Using Semantic Knowledge for Transaction Processing Databases.”. ACM TODS.. 1983; 8(2):186–213.
Garcia-Molina, H., and C. A. Polyzois. (1990). Issues in Disaster Recovery. 35th IEEE Compcon 90. 573-577.
Garcia-Molina, H., Salem, K. Sagas. In: Proc. ACM SIGMOD.. San Francisco: San; 1987:249–259.
Gawlick, D., Kinkade, D. “Varieties of Concurrency Control in IMS/VS FastPath.”. IEEE Database Engineering.. 1985; 8(2):3–10.
Gifford, D. K. (1979). Weighted Voting for Replicated Data. 7th SOSP. 150-162.
Gifford, D. K., Glasser, N. “Remote Pipes and Procedures for Efficient Distributed Computation.”. ACM TOCS.. 1988; 6(3):258–283.
Good, B., J. Gray, P. Homan, D. Gawlick, and H. Sammer. (1985). One Thousand Transactions Per Second. 35th IEEE Compcon 85. 96-101.
Grady, R. “Dissecting Software Failures.”. Hewlett-Packard Journal.. 1989; 40(2):57–63.
Gray, J., “Notes on Database Operating Systems.”. Operating Systems: An Advanced Course. Springer-Verlag Lecture Notes in Computer Science.; Vol. 60. Springer-Verlag, New York, 1978.
Gray, J.One, Two, Three, and Four Message Commit Protocols. Pala Mesa Workshop on Reliable Distributed Computing, 1979.
Gray, J., “A Transaction Model.”. ICALP 80: Automata, Languages, and Programming. Springer-Verlag Lecture Notes in Computer Science.; Vol. 85. Springer-Verlag, Berlin, 1980.
Gray, J. (1981). The Transaction Concept: Virtues and Limitations. 7th VLDB. 144-154.
Gray, J. (1986). Why Do Computers Stop and What Can We Do about It. 5th Symposium on Reliability in Distributed Software and Database Systems. 3-12.
Gray, J. “Transparency in Its Place.”. UNIX Review.. 1987; 5(5):42–53.
Gray, J. (1988). The Cost of Messages. 7th ACM PODC. 1-7.
Gray, J. “A Census of Tandem System Availability between 1985 and 1990.”. IEEE Transactions on Reliability.. 1990; 39(4):409–418.
Gray, J. The Benchmark Handbook for Database and Transaction Processing Systems. In: The Morgan Kaufmann Series in Data Management Systems.. San Mateo, CA: Morgan Kaufmann; 1991.
Gray, J., Homan, P., Obermarck, R., Korth, H.“A Strawman Analysis of the Probability of Waiting and Deadlock in a Database System.”. IBM San Jose Research Laboratory, 1981. [RJ 3066, February.].
Gray, J., Lorie, R. A., Putzolu, G. R., Traiger, I. L. “Granularity of Locks and Degrees of Consistency in a Shared Database.”. In: Modeling in Data Base Management Systems.. Amsterdam: Elsevier North-Holland; 1976.
Gray, J., McJones, P. R., Blasgen, M. W., Lindsay, B., Lorie, R. A., Price, T. G., Putzolu, G. R., Traiger, I. L. “The Recovery Manager of the System R Database Manager.”. ACM Computing Surveys.. 1981; 13(2):223–242.
Gray, J., Putzolu, G.R. The Five Minute Rule for Trading Memory for Disc Accesses and the 10 Byte Rule for Trading Memoty for CPU Time. ACM SIGMOD, 1987; 395–398.
Gray, J. P., Hansen, P., Homan, P., Lerner, M., Pozefsky, M. “Advanced Program-to-Program Communication in SNA.”. IBM Systems Journal.. 22(4), 1983.
Guttman, A., Stonebraker, M. R-Trees: A Dynamic Index Structure for Spatial Searching. In: ACM SIGMOD Conference on Management of Data.. Boston: Boston; 1984. [June. 47-57. Also in Stonebraker’s Readings in Database Systems.].
Gyllstrom, P. O., Wimberg, T., “STDL: A Portable Transaction Processing Language.” High Performance Transaction Processing Systems. Springer-Verlag Lecture Notes in Computer Science. Springer-Verlag: New York, 1992
Haderle, D. J., Jackson, R. D. “IBM Database 2 Overview.”. IBM Systems Journal.. 1984; 23(2):112–125.
Hagmann, R. B. “A Crash Recovery Scheme for Memory-Resident Databases.”. IEEE TOC.. 1986; 35(9):87–96.
Hagmann, R. B. (1987). Reimplementing the Cedar File System Using Logging and Group Commit. 11th ACM SIGOPS SOSP: 155-162.
Hammer, M., Shipman, D. “Reliability Mechanisms for SDD-1.”. ACM TODS.. 1980; 5(4):431–466.
Härder, T., Reuter, A. “Principles of Transaction-Oriented Database Recovery.”. ACM Computing Surveys.. 1983; 15(4):287–317.
Härder, T., Rothermel, K. “Handling Hotspot Data in DB-Sharing Systems.”. Information Systems.. 1988; 13(2):155–166.
Haskin, R., Malachi, Y., Sawdon, W., Chan, G. “Recovery Management in Quicksilver.”. ACM TOCS.. 1988; 6(1):82–108.
Helland, P. “Transaction Monitoring Facility.”. Database Engineering.. 1985; 8(2):9–18.
Helland, P. “The TMF Application Programming Interface: Program to Program Communications, Transactions, and Concurrency in the Tandem NonStop Computer System.”. Tandem Computers, TR. 1989; 89:3.
Helland, P., Sammer, H., Lyon, J., Carr, R., Garrett, P., Reuter, A. “Group Commit Timers and High Volume Transaction Systems.”. In: High Performance Transaction Systems.. Berlin: Springer-Verlag; 1987.
Hesselgrave, M.R.Considerations for Building Distributed Transaction Processing Systems on UNIX System V. Uniforum, San Francisco, 1990.
Highleyman, W.H.Performance Analysis of Transaction Processing Systems. Englewood Cliffs, NJ: Prentice Hall, 1989.
Hinrichs, K.H.The Grid File System: Implementation and Case Studies of Applications. Ph.D. diss. Institut für Informatik, ETH, Zurich, 1985.
Hobbs, L., England, K.A Comprehensive Guide to Rdb/VMS. Maynard, MA: Digital Press, 1991.
Horst, R., Gray, J. Learning from Field Experience with Fault Tolerant Systems. In: International Workshop on Hardware Fault Tolerance in Multiprocessors. Urbana: University of Illinois; 1989:77–79.
Howard, J. H., Kazar, M. L., Menees, S. G., Michols, D. A., Satyanarayanan, M., “Scale and Performance in a Distributed File System.”. ACM TOCS. 1988;6(1):51–81
IBM-CICS. (1991). Customer Information Control System /Enterprise Systems Architecture (CICS/ESA)
General Information, GC33-0155
Processing Overview, SC33-0673
Resource Definition, SC33-0666
CICS-Supplied Transactions, SC33-0669
System Programming Reference, SC33-0670
Application Programming Guide, SC33-0675
Application Programming Reference, SC33-0676
Application Programming Primer (COBOL), SC33-0674
Sample Applications Guide, SC33-0731
Distributed Transaction Programming, SC33-0783
Intercommunication Guide, SC33-0657
Recovery and Restart Guide, SC33-0658
RACF Security Guide, SC33-0749
Communicating with CICS OS/2, SC33-0736
Hursley Park, Hampshire, England: IBM.
IBM-IMS. (1991). Information Management System (IMS)
General Information, GC26-4275
System Administration, SC26-4282
Operations Reference, SC26-4288
Application Programming, SC26-4279
Data Communication Administration, SC26-4286
Database Administrator’s Guide, SC26-4288
Database Recovery Control: Guide, SC26-4287
Database Recovery Control: Logic, SC26-4293
Programming Guide for Remote SNA Systems, SC26-4186
Program Logic Manual, SC26-4294
Utilities Reference, SC26-4629
Master Index and Glossary, SH20-9085
IBM-IMS-XRF. (1991). IMS Extended Recovery Facility (XRF)
Technical Reference, GG24-3153
Operation and Recovery, GG24-3154
IBM-LU6.2. (1991). System Network Architecture (SNA) Logical Unit 6.2 (LU6.2)
SNA Concepts and Products, GC30-3072
SNA Technical Overview, GC30-3073
Transaction Programmer’s Reference Manual for LU6.2, GC30-3084
Formats and Protocol Reference Manual for LU6.2, SC30-3269
Formats and Protocol Reference Manual: Architectural Logic, SC30-3112
Reference: Peer-Protocols, SC31-6808
Research Triangle Park, NC: IBM.
IBM-MVS-APPC. (1991). MVS Application Program-to-Program Communications (APPC/MVS)
Application Development, Writing Transaction Programs for APPC/MVS, GC28-1112
Planning, APPC Management, GC28-1110
APPC/MVS Handbook for the OS/2 System Administrator, GCGC28-1133
IBM-SAA. (1991). System Application Architecture (SAA)
Common Programming Inteface: Summary, GC26-4625
Common Communications Support: Summary, GC31-6810
Communications Reference (CPI-C), SC26-4399
Database Reference (SQL), SC26-4348
Repository Reference, SC26-4684
Resource Recovery Reference, SC31-6821
Concepts of Distributed Data, SC26-4417
Writing Applications: A Design Guide, SC26-4362
(see Overview for C, COBOL, FORTRAN, presentation, dialog, …)
Ioannidis, Y. E., Wong, E., Query Optimization by Simulated Annealing. Proc. ACM SIGMOD. San Francisco:, 1987:9–22
ISO-SQL. (1986). Database Language SQL. ISO document ISO/TC97/SC21/WG3 N117 or ANSI document ANSI. X3.13-1986.
——. (1991). Database Language SQL, an ISO Standard
SQLl Adendum (1989), X3-135-1992
Jain, R.The Art of Computer Systems Performance Analysis: Techniques for Experimental Design, Measurement, Simulation, and Modeling. New York: John Wiley & Sons, 1991.
Jarke, M., Kock, J. “Query Optimization in Database Systems.”. ACM Computing Surveys.. 1984; 16(2):111–152.
Johnson, B.W.Design and Analysis of Fault Tolerant Digital Systems. Reading, MA: Addison-Wesley, 1989.
Johnson, T., Shasha, D. “B-Trees with Inserts and Deletes: Why Free-at-empty Is Better than Merge-at-half.”. In: Courant Institute of Mathematical Sciences. New York University; 1991. [November 11.].
Johnson, T., Shasha, D.“The Performance of Concurrent B-Tree Algorithms.”. University of Florida New York University, 1991. [October 3, 1991.].
Joshi, A. (1991). Adaptive Locking Strategies in a Multi-Node Data Sharing Model Environment. 17th VLDB. 181-192.
Joshi, A. M., Rodwell, K. E. “A Relational Database Management System for Production Applicaitons.”. Digital Technical Journal.. 1989; 1(8):99–109.
Karp, R. M., Miller, R. E. “Properties of a Model for Parallel Computations: Determinacy, Termination, Queueing.”. SIAMJAM.. 1966; 14(6):1390–1411.
Kernighan, B. W., Ritchie, D. M. The C Programming Language. In: Prentice Hall Software Series.. Englewood Cliffs, NJ: Prentice Hall; 1988.
Klein, J. (1991). Advanced Rule Driven Transaction Management. 36th IEEE Compcon 91. 562-567.
Klein, J., and A. Reuter. (1988). Migrating Transactions. Workshop on the Future Trends of Distributed Computing Systems. 512-520.
Knuth, D.E.The Art of Computer Programming. Reading, MA: Addison-Wesley, 1973.
Kohler, W. H., Hsu, Y. P., Rogers, T. K. “Performance Evaluation of Transaction Processing Systems.”. Digital Technical Journal.. 1991; 3(1):45–57.
Kramer, S.N.The Sumerians: Their History, Culture, and Character. Chicago: University of Chicago Press, 1963.
Kronenberg, N., Levey, H., Strecker, W., Merewood, R. “The VAXcluster Concept: An Overview of a Distributed System.”. Digital Technical Journal.. 1987; 1(3):7–21.
Kumar, V. “Concurrency Control on Extendible Hashing.”. Information Processing Letters.. 1989; 31(1):35–41.
Kung, H. T., Lehman, P. L. “Concurrent Manipulation of Binary Search Trees.”. ACM TODS.. 1980; 5(3):339–353.
Kwong, Y. S., Wood, D., “Method for Concurrency in B-Trees.”. IEEE TOSE. 1982;8(3):211–223
Laing, W. A., Johnson, J. E., Landau, R. V. “Transaction Management Support in the VMS Operating System Kernel.”. Digital Technical Journal.. 1991; 3(1):33–44.
Lamport, L. “The Implementation of Reliable Distributed Multiprocessor Systems.”. Computer Networks.. 1978; 2:95–114.
Lampson, B. W. “Protection.”. ACM Operating Systems Review.. 1974; 8(1):18–24.
Lampson, B. W. (1979). Sandwich Commit Protocols. Pala Mesa Workshop on Reliable Distributed Computing.
Lampson, B. W., “Atomic Transactions.”. Distributed Systems—Architecture and Implementation: An Advanced Course. Lecture Notes in Computer Science.; Vol. 105. Springer-Verlag, New York, 1981.
Lampson, B.W., Sturgis, H.E.“Crash Recovery in a Distributed Data Storage System.”. Xerox Palo Alto Research Center, 1979.
Laprie, J. C. (1985). Dependable Computing and Fault Tolerance: Concepts and Terminology. 15th FTCS. 2-11.
Larson, P.-Å. Linear Hashing with Partial Expansions. 6th International Conference on Very Large Databases.. 1980; 1:224–232.
Larson, P.-Å. “Performance Analysis of Linear Hashing with Partial Expansions.”. ACM TODS.. 1982; 7(4):566–587.
Larson, P.-Å. “Linear Hashing with Overflow-Handling by Linear Probing.”. ACM TODS.. 1985; 10(1):75–89.
Larson, P.-Å. “Linear Hashing with Separators: A Dynamic Hashing Scheme Achieving One-Access Retrieval.”. ACM TODS.. 1988; 13(3):366–388.
Lehman, P. L., Yao, S. B. “Efficient Locking for Concurrent Operations on B-Trees.”. ACM TODS.. 1981; 6(4):650–670.
Lehman, T.J., Carey, M.J. A Recovery Algorithm for a High-Performance Memory-Resident Database System. ACM SIGMOD, 1987; 104–117.
Lehman, T.J., Lindsay, B.G.“The Starburst Long Field Manager.”. IBM San Jose Research Laboratory, 1989. [RJ 6899 (June).].
Leu, Y., Elmargarmid, A.K., Boudriga, N.“Specification and Execution of Transactions for Adavanced Database Applications.”. Purdue University, 1990. [CSD-TR-1030.].
Leu, Y., Elmargarmid, A.K., Rusinkiewicz, M.“An Extended Transaction Model for Multidatabase Systems.”. Purdue University, 1989. [CSD-TR-925.].
Lindsay, B. G. Single and Multisite Recovery Facilities. In: Distributed Databases.. Cambridge: Cambridge University Press; 1980.
Lindsay, B.G., Sellinger, P.G., Galtieri, C., Gray, J., Lorie, R.A., Price, T.G., Putzolu, G.F., Traiger, I.L., Wade, B.W.“Notes on Distributed Databases.”. IBM San Jose Research Laboratory, 1979. [RJ 2571(33471)].
Liskov, B. “The Argus Language and System.”. In: Chapter 7 in Distributed Systems—Methods and Tools for Specification: An Advanced Course.. Berlin: Springer-Verlag; 1987.
Liskov, B. “Distributed Programming in Argus.”. CACM.. 1988; 31(3):300–312.
Liskov, B., Curtis, D., Johnson, P., Scheifler, R. “Implementation of Argus.”. ACM SIGOPS.. 1987; 21(5):111–122.
Liskov, B., Ghemawat, S., Gruber, R., Johnson, P., Shira, L., Williams, M. “Replication in the Harp File System.”. ACM Operating Systems Review.. 1991; 25(5):226–238.
Liskov, B., Scheifler, R. “Guardians and Actions: Linguistic Support for Robust Distributed Programs.”. ACM TOPLAS.. 1983; 5(3):381–404.
Litwin, W. (1980). Linear Hashing: A New Tool for Files and Tables Addressing. 6th VLDB. 212-223.
Litwin, W., Lomet, D., “A New Method for Fast Data Searches with Keys.”. IEEE Software, 1987;4(2):16–24
Lomet, D. B. “Process Structuring, Synchronization, and Recovery Using Atomic Actions.”. ACM SIGPLAN Notices.. 1977; 12(3):128–137.
Lomet, D. B. Multi-Table Search for B-Tree Files. ACM SIGMOD.. 1979; 1:35–41.
Lomet, D. B. Digital B-Trees. 7th International Conference on Very Large Databases.. 1981; 1:333–343.
Lomet, D. B. “Bounded Index Exponential Hashing.”. ACM TODS. 1983; 8(1):136–165.
Lomet, D. B. A High-Performance Universal Key Associative Acess Method. ACM SIGMOD. 1983; 1:120–133.
Lomet, D. B. “Partial Expansions for File Organizations with an Index.”. ACM TODS.. 1987; 12(1):65–84.
Lomet, D. B. “A Simple Bounded Disorder File Organization with Good Performance.”. ACM TODS.. 1988; 13(3):525–551.
Lomet, D.B.“MLR: A Recovery Method for Multi-Level Systems.”. DEC Cambridge Research Lab, 1991. [CRL 91/7, July.].
Lomet, D.B., Salzberg, B. Access Methods for Multiversion Data. ACM SIGMOD, 1989; 315–324.
Lomet, D. B., and B. Salzberg. (1989b). A Robust Multiattribute Search Structure. 5th International Conference on Data Engineering. 296-304.
Lomet, D.B., Salzberg, B. The Performance of a Mutiversion Access Method. ACM SIGMOD, 1990; 353–363.
Lomet, D. B., Salzberg, B. “The hB-Tree: A Multiattribute Indexing Method with Good Guaranteed Performance.”. ACM TODS.. 1990; 15(4):625–658.
Lomet, D. B., and B. Salzberg. (1991). “Concurrency and Recovery for Index Trees.” Cambridge Research Laboratory, CRL 91/8, August.
Long, D.D.E., Carrol, J.L., Park, C.J.“A Study of the Reliability of Internet Sites.”. UC Santa Cruz, TR UCSC-CRL-90-46, 1990. [September.].
Lorie, R. A. “Physical Integrity in a Large Segmented Database.”. ACM TODS.. 1977; 2(2):91–106.
Lynch, N. A. “Multilevel Atomicity: A New Correctness Criterion for Database Concurrency Control.”. ACM TODS.. 1983; 8(4):484–502.
Lyon, J. (1990). Tandem’s Remote Data Facility. 35th IEEE Compcon 90. 562-567.
Maier, D., Stein, J. Indexing in an Object-Oriented DBMS. Workshop on Object-Oriented Database Systems.. 1986; 1:171–182.
Mandber, U., Ladner, R. E. Concurrency Control in a Dynamic Search Structure. In: ACM Proceedings on Database Systems.. Boston: Association for Computing Machinery; 1982.
Maxion, R. A., Feather, F. E. “A Case Study of Ethernet Anamolies in a Distributed Computing Environment.”. IEEE Transactions on Reliability.. 1990; 39(4):433–443.
McGee, W. C. “IMS Structure, Database, Batch, Data Communications, and Transaction Processing (in 5 parts).”. IBM Systems Journal.. 1977; 16(2):84–168.
Melton, J. (1989). Database Language SQL 2 and SQL3 (ISO-ANSI working draft). X3H2-89-252 and ISO DBL FIR-3.
Merrett, T. “Dynamic Multipaging in Even Less Space.”. 1988; 17(4):56–61.
Meyer-Wegener, K. Transaktionssysteme. In: Leitfäden der Angewandten Informatik.. Stuttgart: Teubner Verlag; 1988.
Misra, M.IBM RISC System/6000 Technology. Austin, TX: International Business Machines Corporation, 1990.
Mohan, C.“ARIES/LHS: A Concurrency Control and Recovery Method Using Write-Ahead Logging for Linear Hashing with Separators.”. IBM Almaden Research Center, 1989. [March.].
Mohan, C. (1990a). ARIES/KVL: A Key-Value Locking Method for Concurrency Control of Multiaction Transactions on B-Tree Indexes. 16th VLDB. 392-405.
Mohan, C. (1990b). Commit_LSN: A Novel and Simple Method for Reducing Locking and Latching in Transaction Processing Systems. 16th VLDB. 406-418.
Mohan, C. “ARIES/LHS: A Concurrency Control and Recovery Method Using Write-Ahead Logging for Linear Hashing with Separators.”. IBM Almaden Research Center, 1990 November.
Mohan, C. “A Cost-Effective Method for Providing Improved Availability During DBMS Restart Recovery After a Failure.”. In: High Performance Transaction Processing Systems. Springer-Verlag Lecture Notes in Computer Science.. New York: Springer-Verlag; 1992.
Mohan, C., Haderle, D., Lindsay, B., Pirahesh, H., Schwarz, P. “ARIES: A Transaction Recovery Method Supporting Fine-Granularity Locking and Partial Rollbacks Using Write-Ahead Logging.”. ACM TODS.. 1992; 17(1):94–162.
Mohan, C., Haderle, D., Peterson, A.“ARIES/IM/PD: A Concurrency Control Index Management Method Using Write-Ahead Logging and Pseudo Deletes of Keys.”. IBM Almaden Research Center, Research Report, in preparation, 1990. [1990.].
Mohan, C., D. Haderle, Y. Wang, and J. Cheng. (1990). Single Table Access Using Multiple Indexes: Optimization, Execution, and Concurrency Control Techniques. International Conference on Extending Database Technology. 29-43.
Mohan, C., Levine, F.“ARIES/IM: An Efficient and High Concurrency Index Management Method Using Write-Ahead Logging.”. IBM Almaden Research Center, 1989. [RJ 6848, August.].
Mohan, C., Levine, F.“ARIES/IM: An Efficient and High Concurrency Index Management Method Using Write-Ahead Logging.”. ACM SIGMOD, 1992.
Mohan, C., and B. G. Lindsay. (1983). Efficient Commit Protocols for the Tree of Processes Model of Distributed Transactions. 2nd ACM PODC. 76-88.
Mohan, C., Lindsay, B., Obermarck, R. “Transaction Management in the R* Distributed Database Management System.”. ACM TODS.. 1986; 11(4):378–396.
Mohan, C., and I. Narang. (1991a). Recovery and Concurrency Control Protocols for Fast Intersystem Page Transfer and Fine-Granularity Locking in a Shared Disc Transaction Environment. 17th VLDB. 195-208.
Mohan, C., Narang, I.“ARIES/SD: A Transaction Recovery and Concurrency Control Mechanism for a Shared Disc Environment.”. IBM Almaden Research Center, Research Report, forthcoming, 1991.
Mohan, C., Narang, I.Algorithms for Creating Indexes for Very Large Tables without Quiescing Updates. ACM SIGMOD, 1992.
Mohan, C., Narang, I., Palmer, J. “A Case Study of Problems in Migrating to Distributed Computing: Page Recovery Using Multiple Logs in a Shared Disc Environment.”. IBM Research Report, RJ. 7343, 1990. [March.].
Mohan, C., Narang, I., Silen, S. “Solutions to Hot Spot Problems in a Shared Disc Transaction Environment.”. In: High Performance Transaction Processing Systems. Springer-Verlag Lecture Notes in Computer Science.. New York: Springer-Verlag; 1992.
Mohan, C., and H. Pirahesh. (1991). ARIES-RRH: Restricted Repeating of History in the ARIES Transaction Recovery Method. 7th International Conference on Data Engineering.
Mohan, C., H. R. Strong, and S. Finkelstein. (1983). Method for Distributed Transaction Commit and Recovery Using Byzantine Agreement within Clusters of Processors. 2nd ACM PODC. 89-103.
Moss, J.E.B. “Nested Transactions: An Approach to Reliable Computing.”. MIT, 1981 LCS-TR-260.
Moss, J.E.B.Nested Transactions: An Approach to Reliable Distributed Computing. Boston: MIT Press, 1985.
Moss, J. E. B., B. Leban, and P. K. Chrysanthis. (1986). Finer Grained Concurrency for Database Cache. Fourth Data Engineering Conference. 96-103.
Mourad, J. (1985). The Reliability of the IBM MVS/XAOperating System. 15th FTCS. 93-98.
Needham, R., Schroder, M. “Using Encryption for Authenticaton in Large Networks of Computers.”. CACM.. 1978; 21(12):993–999.
Nievergelt, J., Hinterberger, H., Sevcik, K. C. “The Grid File: An Adaptable, Symmetric Multi-Key File Structure.”. ACM TODS.. 1984; 9(1):38–71.
Obermarck, R.“IMS/VS Program Isolation Feature.”. IBM San Jose Research Laboratories, 1980. [RJ 72879 (36435), July.].
Oki, B.M., Liskov, B.H., Scheifler, R.W. Reliable Object Storage to Support Atomic Actions. Symposium on Operating Systems Principles, 1985; 147–159.
O’Neil, P. E. “The Escrow Transactional Method.”. ACM TODS.. 1986; 11(4):405–430.
O’Neil, P. E. “Promises.”. In: High Performance Transaction Processing Systems. Springer-Verlag Lecture Notes in Computer Science.. New York: Springer-Verlag; 1992.
Orenstein, J. A. Spatial Query Processing in an Object-Oriented Database. ACM SIGMOD.. 1986; 1:326–336.
Orenstein, J. A. Redundancy in Spatial Databases. ACM SIGMOD.. 1989; 1:295–305.
Orenstein, J. A., Merrett, T. A Class of Data Structures for Associative Searching. ACM SIGMOD Symposium on Principles of Database Systems.. 1984; 1:181–190.
Orfali, R., Harkey, D.Client-Server Programming with OS/2 Extended Edition. New York: Van Nostrand Reinhold, 1990.
OSF-DCE. (1990). “OSF Distributed Computing Environment Rationale.” Cambridge, MA: Open Software Foundation.
OSE-CCR. (1989). Open Systems Interconnection: Commit, Concurrency Control, and Recovery (OSI-CCR)
Service Definition, ISO IS 9804-2
Protocol Specification, ISO IS 9804-3
OSI-TP. (1992). Open Systems Interconnection-Distributed Transaction Processing (OSI-TP) Model, ISO IS 10026-1
Service Definition, ISO IS 10026-2
Protocol Specification, ISO IS 10026-3
Ozsu, T., Valduriez, P.Principles of Distributed Database Systems. Englewood Cliffs, NJ: Prentice Hall, 1990.
O’Neil, P.E.“Escrow Promises.”. University of Massachussetts, 1990. [TR 90-3.].
Papadimitriou, C.H.The Theory of Database Concurrency Control. Rockville, MD: Computer Science Press, 1986.
Patterson, D.A., Gibson, G., Katz, R. A Case for Redundant Arrays of Inexpensive Disks (RAID). ACM SIGMOD, 1988; 109–116.
Patterson, D.A., Hennessy, J.L.Computer Architecture: A Quantitative Approach. San Mateo, CA: Morgan Kaufmann, 1990.
Pease, M., Shostak, R., Lamport, L., “Reaching Agreement in the Presence of Faults.”. JACM. 1980;27(2):228–234
Peinl, P., Reuter, A., Sammer, H. High Contention in a Stock Trading Database: A Case Study. ACM SIGMOD, 1988; 260–268.
Peterson, R. J., and J. P. Strickland. (1983). Log Write-Ahead Protocols and IMS/VS Logging. 2nd PODC. 216-243.
Polyzois, C. A., Garcia-Molina, H. “A Generalized Disaster Recovery Model and Algorithm.”. In: High Performance Transaction Processing Systems. Springer-Verlag Lecture Notes in Computer Science.. New York: Springer-Verlag; 1992.
Pradhan, D.K.Fault Tolerant Computing: Theory and Techniques, Vols. 1 and 2. Englewood Cliffs, NJ: Prentice Hall, 1986.
Pu, C. “Generalized Transaction Processing.”. In: High Performance Transaction Processing Systems. Springer-Verlag Lecture Notes in Computer Science.. New York: Springer-Verlag; 1992.
Rahm, E. “Use of Global Extended Memory for Distributed Transaction Processing.”. In: High Performance Transaction Processing Systems. Springer-Verlag Lecture Notes in Computer Science.. New York: Springer-Verlag; 1992.
Ramakrishna, M. V., Larson, P.-Å. “File Organization Using Composite Perfect Hashing.”. ACM TODS.. 1989; 14(2):231–263.
Randell, B., Lee, P. A., Treleaven, P. C. “Reliability Issues in Computer System Design.”. ACM Computing Surveys.. 1978; 10(2):123–165.
Reed, D.“Naming and Synchronization in a Decentralized System.”. MIT, 1978. [LCS TR 205.].
Reed, D. “Implementing Atomic Actions on Decentralized Data.”. ACM TOCS.. 1981; 1(1):3–23.
Reed, D., Svobodova, L. “Swallow: A Distributed Data Storage System for a Local Network.”. In: Local Networks for Computer Communications.. New York: North Holland; 1981.
Rengarajan, T. K., Spiro, P. M., Wright, W. A. “High Availability Mechanisms for VAX DBMS Software.”. Digital Technical Journal.. 1989; 1(8):88–98.
Reuter, A. (1982). Concurrency on High-Traffic Data Elements. 1st ACM PODS. 83-92.
Reuter, A. (1986). Load Control and Load Balancing in Shared Database Management Systems. International Conference on Data Engineering.
Reuter, A. (1989). ConTracts: A Means for Extending Control Beyond Transaction Boundaries. 3rd International Workshop on High Performance Transaction Systems.
Reuter, A., Schmidt, U. “Transactions in Manufacturing Applications.”. In: High Performance Transaction Processing Systems. Springer-Verlag Lecture Notes in Computer Science.. New York: Springer-Verlag; 1992.
Rivest, R., Shamir, E., Adleman, L. “A Method for Obtaining Digital Signatures and Public Key Cryptosystems.”. CACM.. 1978; 21(2):120–126.
Rosenkrantz, D. J., Steams, R. D., Lewis, P. M. “System Level Concurrency Control for Distributed Database Systems.”. ACM TODS.. 1977; 3(2):178–198.
Rothermel, K., and C. Mohan. (1989). ARIES/NT: A Recovery Method Based on Write-Ahead Logging for Nested Transactions. 15th VLDB. 337-346.
Rothermel, K., and S. Pappe. (1990). Open Commit Protocols for the Tree of Processes Model. 10th International Conference on Distributed Computing Systems. 236-244.
Rubenstein, W.B., Kubicar, M.S., Cattell, R.G.G. Benchmarking Simple Database Operations. ACM SIGMOD, 1987; 387–394.
Sacco, G., and M. Schkolnick. (1982). A Mechanism for Managing the Buffer Pool in a Relational Database System Using the Hot Set Model. International Conference on Very Large Databases.
Sacco, G. M., Schokolnick, M. “Buffer Management in Relational Database Systems.”. ACM TODS.. 1986; 11(4):473–498.
Sacks-Davis, R., Kent, A., Ramamohanarao, K., “Multikey Access Methods Based on Superimposed Coding Techniques.”. ACM TODS. 1987;12(4):655–696
Sagiv, Y. “Concurrent Operations on B*-Trees with Overtaking.”. Journal of Computer and System Sciences.. 1986; 33(2):275–296.
Saltzer, J., Reed, D., Clark, D. “End-to-End Arguments in System Design.”. ACM TOCS.. 1984; 2(4):277–288.
Salzberg, B. J. “Grid File Concurrency.”. Information Systems.. 1986; 11(3):235–244.
Salzberg, B.J.File Structures: An Analytic Approach. Englewood Cliffs, NJ: Prentice Hall, 1988.
Samet, H. “The Quadtree and Related Hierarchical Data Structures.”. ACM Computing Surveys.. 1984; 16(2):187–260.
Sattler, H.Transaktionssystem BS2000. (In German.). Munich: Siemens AG, 1989.
Schek, H. J., Scholl, M. “The Relational Model with Relation Valued Attributes.”. Information Systems.. 1986; 11(2):137–147.
Schmuk, F., Wyllie, J. “Experience With Transactions in Qucksilver.”. ACM Operating Systems Review.. 1991; 25(5):239–253.
Schnieder, F.B. FailStop Processors. IEEE COMPCON, 1983; 66–70.
Schulze, M., G. Gibson, R. Katz, and D. A. Patterson. (1989). How Reliable is a RAID. 34th IEEE COMPCON 89. 118-123.
Scrutchin, T.TPF: Performance, Capacity, and Availability. IEEE COMPCON, 1987.
Serlin, O.TPC Benchmark A™. Los Altos, CA: ITOM International, 1990.
Shah, J.VAXclusters: Architecture, Programming, and Management. New York: McGraw-Hill, 1991.
Shasha, D., Goodman, N. “Concurrent Search Structure Algorithms.”. ACM TODS.. 1988; 13(1):53–90.
Shasha, D. E. Concurrent Algorithms for Search Structures. In: PhD Thesis, Comp. Sci. Dept.. Harvard Univ; 1984. [TR-12-84.].
Siewiorek, D.P., Swarz, R.S.The Theory and Practice of Reliable System Design. Bedford, MA: Digital Press, 1982.
Siwiec, J. E. “A High-Performance DB/DC System.”. IBM Systems Journal.. 1977; 16(2):169–195.
Skeen, D. (1981). Nonblocking Commit Protocols. ACM SIGMOD. 133-142 (Also available in Stonebraker’s Readings in Database Systems).
Snaman, W. E. “Application Design in a VAXcluster System.”. Digital Technical Journal.. 1991; 3(3):16–26.
Snaman, W. E., Thiel, D. W. “The VAX/VMS Distributed Lock Manager.”. Digital Technical Journal.. 1987; 5(3):29–44.
SNI. (1989). Universeller Transaktionsmonitor UTM (SINIX): Verteilte Transaktionsverarbeitung. Munich: Siemens AG.
Software, AG.ADABAS TPF: Introduction Manual. Darmstadt, Germany: Software AG, 1988.
Software, AG.ADANET Distributed Processing Facility. Darmstadt, Germany: Software AG, 1989.
Spector, A. Z. Open, Distributed Transaction Processing with Encina. In: International Workshop on High Performance Transaction Systems.. Monterey, CA: Monterey; 1991.
Spector, A. Z., Eppinger, J. L., Daniels, D. S., Draves, R., Bloch, J. J., Duchamp, D., Pausch, R. F., Thompson, D. “High Performance Distributed Transaction Processing in a General Purpose Computing Environment.”. In: High Performance Transaction Systems.. Berlin: Springer-Verlag; 1987.
Spector, A. Z., Schwarz, P. M. “Transactions: A Construct for Reliable Distributed Computing.”. ACM Operating Systems Review.. 1983; 17(2):18–35.
Speer, T. G., Storm, M. W. “Digital’s Transaction Processing Monitors.”. Digital Technical Journal.. 1991; 3(1):18–32.
Spiro, P. M., Joshi, A. M., Rengarajan, T. K., “Designing an Optimized Transaction Commit Protocol.”. Digital Technical Journal. 1991;3(1):70–78
Srinivasan, V., Carey, M. J. “On-Line Index Construction Algorithms.”. In: High Performance Transaction Processing Systems. Springer-Verlag Lecture Notes in Computer Science.. New York: Springer-Verlag; 1992.
Stonebraker, M. “Concurrency Control and Consistency of Multiple Copies of Data in Distributed Ingres.”. IEEE SE.. 1979; 5(3):188–194.
Stonebraker, M. “Operating System Support for Database Management.”. CACM.. 1981; 24(7):412–418.
Stonebraker, M. “Virtual Memory Transaction Management.”. ACM Operating Systems Review.. 1984; 18(2):8–16.
Stonebraker, M. “The Case For Shared Nothihng.”. IEEE Database Engineering.. 1986; 9(1):610–621.
Stonebraker, M. “The Design of the Postgres Storage System.”. In: Readings in Database Systems.. San Mateo, CA: Morgan Kaufmann; 1988.
Stonebraker M., ed. Readings in Database Systems. San Mateo, CA: Morgan Kaufmann, 1988.
Stonebraker, M., Wong, E., Kreps, P., Held, G. “The Design and Implementation of Ingres.”. ACM TODS.. 1976; 1(3):189–222.
Strickland, J., Uhrowczik, P., Watts, V. “IMS/VS: An Evolving System.”. IBM Journal of Research and Development.. 1982; 21(4):490–510.
Svobodova, L. (1979). Reliability Issues in Distributed Information Processing Systems. 9th FTCS. 9-16.
Svobodova, L. “Management of Object Histories in the Swallow Repository.”. MIT, LCS TR. 243, 1980.
Svobodova, L. (1981). A Reliable Object-Oriented Data Repository for a Distributed Computer System. 8th SOSP. 47-58.
Tamminen, M., “The Extendible Cell Method for Closest Point Problems.”. BIT. 1982;22(1):27–41
Tandem. (1991). Tandem Products
Introduction to NonStop Systems, 16207
Summary of Technical Publications, 58967
Cupertino, CA: Tandem Computers Inc.
Tandem Database Group. (1987). NonStop SQL: A Distributed High Performance, High Availability Implementation of SQL. In High Performance Transaction Systems. Berlin: Springer-Verlag.
Tandem-Pathway. (1991). Pathway Transaction Processing System
Introduction to Pathway, 82339
System Management Guide, 39864
Management Programming Commands, 31199
Management Programming Messages and Events, 31200
Application Programming Guide, 39544
Screen Cobol Reference Manual, 20356
Introduction to Pathmaker, 84070
Pathmaker Programming Manual, 27449
Cupertino, CA: Tandem Computers Inc.
Tandem Performance Group. (1988). A Benchmark of NonStop SQL on the Debit Credit Transaction. ACM SIGMOD. 337-341.
Tandem-RDF. (1991). Remote Duplicate Database Facility (RDF™)
Cupertino, CA: Tandem Computers Inc.
Tandem-SQL. (1991). NonStop SQL
Introduction to Data Management, 15873
Conversational Interface Manual, 22978
Programming Reference Manual, 84258
Installation and Management, 20263
Cupertino, CA: Tandem Computers.
Tandem-TMF. (1991). Tandem’s Transaction Monitoring Facility (TMF)
Management and Operations Guide, 18680
Management and Operations Manual, 84065
Cupertino, CA: Tandem Computers.
Tanenbaum, A.S.Operating Systems: Design and Implementation. Englewood Cliffs, NJ: Prentice Hall, 1987.
Tay, Y.C.Locking Performance in Centralized Databases. Orlando, FL: Academic Press, 1987.
Teng, J. Z., Gumaer, R. A. “Managing IBM Database 2 Buffers to Maximize Performance.”. IBM Systems Journal.. 1984; 23(2):211–218.
Thomas, R. H. “A Majority Consensus Approach to Concurrency Control for Multiple Copy Databases.”. ACM TODS.. 1979; 4(2):180–209.
Thomasian, A. “High Performance Distributed Transaction Processing.”. In: High Performance Transaction Processing Systems. Springer-Verlag Lecture Notes in Computer Science.. New York: Springer-Verlag; 1992.
Traiger, I. L. (1982a). “Virtual Memory Management for Database Systems.” IBM San Jose Research Laboratory, RJ 3489 (41346), May.
Traiger, I. L. “Virtual Memory Management for Database Systems.”. ACM Operating Systems Review.. 1982; 16(4):26–48.
Traiger, I. L., Galtaire, C. A., Gray, J., Lindsay, B. G. “Transactions and Consistency in Distributed Database Systems.”. ACM TODS.. 1982; 7(3):323–342.
Transarc-Encina. (1991). Encina Transaction Processing System
Monitor: Programmers Guide, TP-00-D078
Transactional-C Programmers Guide and Reference, TP-00-D347
Using the Transarc Toolkit: Guide to Transaction Processing System Development, TP-00-137
Toolkit Executive, Reference Manual, TP-00-D539
Toolkit Server Core, Reference Manual, TP-00-D540
Structured File Server, Programmer’s Guide, TP-00-D170
Structured File Server, Programmer’s Reference, TP-00-D223
Base Development Environment, TP-00-D509
Pittsburgh, PA: Transarc Corp.
Tullis, N., “Powering Computer-Controlled Systems: AC or DC?”. Telesis. 1984;11(1):8–14
USL-Tuxedo. (1991). Tuxedo System Transaction Manager, Release 4.0
Transaction Manager Administrator’s Guide
Transaction Manager Programmer’s Guide
Transaction Manager Reference Manual
Transaction Manager Master Index
Database Manager Administrator’s Guide
Database Manager Programmer’s Guide
SQL User’s Guide/Reference Reference Manual
ESQL User’s Guide/Reference Reference Manual
Database Manager Reference Manual
Summit, NJ: UNIX System Laboratories or Prentice Hall, Englewood Cliffs, NJ: Prentice Hall.
van der Pool, J. A. “Optimum Storage Allocation for a File with Open Addressing.”. IBM Journal of Research and Development.. 1973; 17(2):106–114.
Veklerov, E. “Analysis of Dynamic Hashing with Deferred Splitting.”. ACM TODS.. 1985; 10(1):90–96.
von Neumann, J. Probabilistic Logics and the Synthesis of Reliable Organisms from Unreliable Components. In: Automata Studies.. Princeton, NJ: Princeton University Press; 1956.
Walter, B. (1984). Nested Transactions with Multiple Commit Points: An Approach to the Structuring of Advanced Database Applications. 5th VLDB. 161-171.
Watanabe, E.“Survey on Computer Security.”. Tokyo: Japan Information Development Corporation (JIPDEC), 1986. [March.].
Weber, R. O. “Coordinating Computerized Theatrical Cues.”. Theater Design and Technology.. 1990; 26(4):47–50.
Weikum, G.“Principles and Realisation Strategies of Multi-Level Transaction Management.”. Technical University of Darmstadt (Germany), 1987. [DVSI-1987-T1.].
Wiederhold, G.Database Design. International Student Edition. New York: McGraw-Hill, 1977.
Wong, E., Youssefi, K. “Decomposition: A Strategy for Query Processing.”. ACM TODS.. 1976; 1(3):223–241.
X/Open DTP. (1991). X/Open Common Application Environment
Distributed Transaction Processing: Reference Model
Distributed Transaction Processing: The XA Specification
Reading, Berkshire, England: X/Open Ltd.
Yelavich, B. M. “Customer Information Control System: An Evolving System Facility.”. IBM Systems Journal.. 1985; 24(3/4):264–278.