[Bernstein09] Bibliography

Bibliography

Alonso, G., Casati, F., Kuno, H., Machiraju, V., 2004. Web Services. Springer-Verlag, Berlin.

Andrade,J.M., Carges, M.T., Dwyer, T.J., Felts, S.D., 1996. The TUXEDO System,Software for Constructing and Managing Distributed BusinessApplications. Addison Wesley, Reading, MA.

Attar,R., Bernstein, P.A., Goodman, N., 1984. Site initialization, recovery,and backup in a distributed database system. IEEE Trans. Software Eng.10 (6), 645–650.

Bayer, R., McCreight, E.M., 1972. Organization and maintenance of large ordered indices. Acta Inform. 1, 173–189.

Bayer, R., Schkolnick, M., 1977. Concurrency of operations on B-trees. Acta Inform. 9 (1), 1–21.

Bayer, R., Unterauer, K., 1977. Prefix B-Trees. ACM Trans. Database Syst. 2 (1), 11–26.

Berenson,H., Bernstein, P.A., Gray, J.N., Melton, J., O’Neil, E., O’Neil, P.,1995. Levels of isolation. In: Proceedings of the 1995 ACM SIGMODConference on Management of Data, pp. 1–10.

Bernstein, P.A., 1990. Transaction processing monitors. Commun. ACM 33 (11), 75–86.

Bernstein,P.A., Emberton, W., Trehan, V., 1991. DECdta: digital’s distributedtransaction processing architecture. Digital Tech. J. 3 (1), 10–17.

Bernstein,P.A., Hadzilacos, V., Goodman, N., 1987. Concurrency Control andRecovery in Database Systems. Addison-Wesley, Reading, MA. Freelydownloadable at: http://research.microsoft.com/~philbe.

Bernstein,P.A., Hsu, M., Mann, B., 1990. Implementing recoverable requests usingqueues. In: Proceedings of the 1990 ACM SIGMOD Conference on Managementof Data, pp. 112–122.

Bernstein,P.A., Shipman, D.W., Wong, W.S., 1979. Formal aspects ofserializability in database concurrency control. IEEE Trans. SoftwareEng. SE-5 (3), 203–215.

Birrell, A.D., Nelson, B.J., 1984. Implementing remote procedure calls. ACM Trans. Comput. Syst. 2 (1), 39–59.

Brewer,E.A., 2000. Towards robust distributed systems (abstract). In:Proceedings of the Nineteenth Annual ACM Symposium on Principles ofDistributed Computing, p. 7.

Burke, B., Monson-Haefel, R., 2006. Enterprise Java Beans, fifth ed. O’Reilly Media, Sebastopol, CA.

Chan,A., Fox, S., Lin, W.T.K., Nori, A., Ries, D.R., 1982. Theimplementation of an integrated concurrency control and recoveryscheme. In: Proceedings of the 1982 ACM SIGMOD Conference on Managementof Data, pp. 184–191.

Chandra,T.D., Griesemer, R., Redstone, J., 2007. Paxos made live: anengineering perspective. In: Proceedings of the 1988 ACM Conference onPrinciples of Distributed Computing, pp. 398–407.

Claybrook, B.J., 1992. OLTP—Online Transaction Processing Systems. J. Wiley & Sons, New York.

Comer, D., 1979. The ubiquitous B-Tree. ACM Comput. Surv. 11 (2), 121–137.

DeCandia,G., Hastorun, D., Jampani, M., Kakulapati, G., Lakshman, A., Pilchin,A., Sivasubramanian, S., Vosshall, P., Vogels, W., 2007. Dynamo:amazon’s highly available key-value store. In: Proceedings of the 21stACM Symposium on Operating Systems Principles, pp. 205–220.

ElAbbadi, A., Skeen, D., Cristian, F., 1985. An efficient, fault-tolerantprotocol for replicated data management. In: Proceedings of the 1985Symposium on Principles of Database Systems, pp. 215–229.

ElAbbadi, A., Toueg, S., 1989. Maintaining availability in partitionedreplicated databases. ACM Trans. Database Syst. 14 (2), 264–290.

Eswaran,K.P., Gray, J.N., Lorie, R.A., Traiger, I.L., 1976. The notions ofconsistency and predicate locks in a database system. Commun. ACM 19(11), 624–633.

Fielding,R.T., 2000. Architectural Styles and the Design of Network-basedSoftware Architectures. University of California, Irvine, http://www.ics.uci.edu/~fielding/pubs/dissertation/top.htm.

Fischer,M.J., Michael, A., 1982. Sacrificing serializability to attain highavailability of data in an unreliable network. In: Proceedings of the1982 Symposium on Principles of Database Systems, pp. 70–75.

Gawlick, D., Kinkade, D., 1985. Varieties of concurrency control in IMS/VS fastpath. IEEE Database Eng. 8 (2), 3–10.

Gifford,D.K., 1979. Weighted voting for replicated data. In: 7th ACM SIGOPSSymposium on Operating System Principles, pp. 150–159.

Gilbert,S., Lynch, N., 2002. Brewer’s conjecture and the feasibility ofconsistent, available, partition-tolerant web services. ACM SIGACT News33 (2), 51–59.

Gray,J.N., 1978. Notes on database operating systems. In: Operating Systems:An Advanced Course, Springer-Verlag Lecture Notes in Computer Science,vol. 60. Springer-Verlag, New York.

Gray,J.N., 1981. The transaction concept: virtues and limitations (InvitedPaper). In: Proceedings of the 7th International Conference on VeryLarge Data Bases. IEEE Press, pp. 144–154.

Gray,J.N., 1986. Why do computers stop and what can we do about it. In: 5thSymposium on Reliability in Distributed Software and Database Systems.IEEE Computer Society Press, pp. 3–12. Early version available at: http://research.microsoft.com/~gray/papers/TandemTR85.7_WhyDoComputersStop.pdf.

Gray,J.N. (Ed.), 1993. The Benchmark Handbook for Database and TransactionProcessing Systems, second ed. Morgan Kaufmann Publishers, SanFrancisco.Online at: http://research.microsoft.com/users/gray/BenchmarkHandbook/TOC.htm.

Gray, J.N., Edwards, J., 1994. Scale up with TP monitors. Byte Mag. April.

Gray,J.N., Lorie, R.A., Putzolu, G.R., Traiger, I.L., 1976. Granularity oflocks and degrees of consistency in a shared database. In: Modeling inData Base Management Systems. Elsevier, Amsterdam.

Gray,J.N., Lorie, R.A., Traiger, I.L., 1975. Granularity of locks in ashared data base. In: Proceedings of 1975 International Conference onVery Large Data Bases, pp. 428–451.

Gray, J.N., Reuter, A., 1992. Transaction Processing: Concepts and Techniques. Morgan Kaufmann, San Francisco.

Gray,J.N., Van Ingen, C., 2005. Empirical measurements of disk failure ratesand error rates. In: Microsoft Research Technical ReportMSR-TR-2005-166. http://research.microsoft.com/research/pubs.

Härder, T., Reuter, A., 1983. Principles of transaction-oriented database recovery. ACM Comput. Surv. 15 (4), 287–317.

Howard, M., LeBlanc, D., 2003. Writing Secure Code. Microsoft Press, Redmond, WA.

Jajodia, S., Kerschberg, L. (Eds.), 1997. Advanced Transaction Models and Architecture. Springer-Verlag, Berlin.

Josten,J.W., Mohan, C., Narang, I., Teng, J.Z., 1997. DB2’s use of thecoupling facility for data sharing. IBM Sys. J. 36 (2), 327–351.

Kaufman,C., Perlman, R., Speciner, M., 2002. Network Security–PRIVATECommunication in a PUBLIC World. Prentice Hall PTR, Upper Saddle River,NJ.

KawellJr. L., Beckhardt, S., Halvorsen, T., Ozzie, R., Greif, I., 1988.Replicated document management in a group communication system. In:Proceedings of the 1988 ACM Conference on Computer-SupportedCooperative Work. Online at the ACM Digital Library.

Kedem,Z.M., Silberschatz, A., 1980. Non-two-phase locking protocols withshared and exclusive locks. In: Proceedings of 1980 InternationalConference on Very Large Data Bases, pp. 309–317.

Krafzig,D., Banke, K., Slama, D., 2004. Enterprise SOA: Service-OrientedArchitecture Best Practices (Coad Series). Prentice Hall PTR, UpperSaddle River, NJ.

Kumar, V., Hsu, M., 1998. Recovery Mechanisms in Database Systems. Prentice Hall PTR, Upper Saddle River, NJ.

Kung, H.T., Robinson, J.T., 1982. On optimistic methods for concurrency control. ACM Trans. Database Syst. 6 (2), 213–226.

Ladin,R., Liskov, B., Shrira, L., Ghemawat, S., November 1992. Providing highavailability using lazy replication. ACM Trans. Comput. Syst. 10 (4),360.

Laing,W.A., Johnson, J.E., Landau, R.V., 1991. Transaction management supportin the VMS operating system kernel. Digital Tech. J. 3 (1), 33–44.

Lamport, L., 1978. Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21 (7), 558–565.

Lamport, L., 1998. The part-time parliament. ACM Trans. Comput. Syst. 16 (2), 133–169.

Lampson,B.W., 1981. Atomic transactions. In: Goos, G., Hartmanis, J.(Eds.),Distributed Systems—Architecture and Imple-mentation: An AdvancedCourse. LNCS 105. Springer Verlag, Berlin, pp. 246–265.

Lampson,B.W., Sturgis, H., 1976. Crash recovery in a distributed data storagesystem. In: Technical Report, Computer Science Laboratory, Xerox PaloAlto Research Center, Palo Alto, CA.

LeBert, J.J., 1989. CICS for microcomputers. McGraw Hill, New York.

Lehman, P.L., Yao, S.B., 1981. Efficient locking for concurrent operations on B-trees. ACM Trans. Database Syst. 6 (4), 550–670.

Levine,C., Gray, J.N., Kiss, S., Kohler, W., 1993. The Evolution of TPCBenchmarks: Why TPC-A and TPC-B are Obsolete. Tandem Technical Report93.1, Tandem Computers. Online at: http://www.hpl.hp.com/techreports/tandem/TR-93.1.pdf.

Lewis,P.M., Bernstein, A., Kifer, M., 2002. Databases and TransactionProcessing, An Application-Oriented Approach. Addison-Wesley, Boston.

Leymann, F., Roller, D., 2000. Production Workflow, Concepts and Techniques. Prentice Hall PTR, Upper Saddle River, NJ.

Lindsay,B.G., Haas, L.M., Mohan, C., Wilms, P.F., Yost, R.A., 1984. Computationand communication in R*: a distributed database manager. ACM Trans.Comput. Syst. 2 (1), 24–38.

Liskov, B., 1988. Distributed programming in Argus. Commun. ACM 31 (3), 300–312.

Little, M., Maron, J., Pavlik, G., 2004. Java Transaction Processing. Prentice Hall PTR, Upper Saddle River, NJ.

Lomet,D.B., 1992. MLR: A recovery method for multi-level systems. In:Proceedings of the 1992 ACM SIGMOD Conference on Management of Data,pp. 185–194.

Lomet,D.B., 1993. Key range locking strategies for improved concurrency. In:Proceedings of the 1993 International Conference on Very Large DataBases, pp. 655–664.

Lomet,D.B., Anderson, R., Rengarajan, T.K., Spiro, P., 1992. How the Rdb/VMSdata sharing system became fast. In: Technical Report CRL 92/4, DigitalEquipment Corp., Cambridge Research Lab. http://www.hpl.hp.com/techreports/Compaq-DEC/CRL-92-4.pdf.

Lomet,D.B., Tuttle, M.R., 2003. A theory of redo recovery. In: Proceedings ofthe 2003 ACM SIGMOD Conference on Management of Data, pp. 397–406.

Lomet,D.B., Weikum, G., 1998. Efficient and transparent application recoveryin client-server information systems. In: Proceedings of the 1995 ACMSIGMOD Conference on Management of Data, pp. 460–471.

Lorie, R.A., 1977. Physical integrity in a large segmented database. ACM Trans. Database Syst. 2 (1), 91–104.

Loy, M., Eckstein, R., Wood, D., Elliot, J., Cole, B., 2003. Java Swing, second ed. O’Reilly Media Examples: http://examples.oreilly.com/jswing2/code/.

Lynch,N., Merritt, M., Weihl, W.E., Fekete, A., 1993. Atomic Transactions inConcurrent and Distributed Systems. Morgan Kaufmann Publishers, SanFrancisco.

Malkhi, D., Novik, L., Purcell, C., 2007. P2P replica synchronization with vector sets. Operating Syst. Rev. 41 (2), 68–74.

Microsoft Corporation, 2000. COM + Developer’s Reference Library. Microsoft Press, Redmond, WA.

Mohan,C., 1999. Repeating history beyond ARIES. In: Proceedings of the 1999International Conference on Very Large Data Bases, pp. 1–17.

Mohan,C., Haderle, D., Lindsay, B., Pirahesh, H., Schwarz, P., 1992. ARIES: atransaction recovery method supporting fine-granularity locking andpartial rollback using write-ahead logging. ACM Trans. Database Syst.17 (1), 94–162.

Mohan,C., Lindsay, B.G., Obermarck, R., 1986. Transaction management in theR* distributed database management system. ACM Trans. Database Syst. 11(4), 378–396.

Mohan,C., Narang, I., 1991. Recovery and coherency-control protocols for fastintersystem page transfer and fine-granularity locking in a shareddisks transaction environment. In: Proceedings of the 1991International Conference on Very Large Databases, pp. 193–207.

Moss, E., 1985. Nested Transactions: An Approach to Reliable Distributed Computing. MIT Press, Boston.

Newcomer, E., Lomow, G., 2004. Understanding SOA with Web Services. Addison-Wesley, Upper Saddle River, NJ.

Novik,L., Hudis, I., Terry, D.B., Anand, S., Jhaveri, V., Shah, A., Wu, Y.,2006. Peer-to-peer replication in WinFS. In: Microsoft ResearchTechnical Report MSR-TR-2006-78.

Oki,B.M., Liskov, B., 1988. View stamped replication: a general primarycopy. In: Proceedings of the 1988 ACM Symposium on Principles ofDistributed Computing, pp. 8–17.

ParkerJr., D.S., Popek, G.J., Rudisin, G., Stoughton, A., Walker, B.J.,Walton, E., Chow, J.M., Edwards, D., Kiser, S., Kline, C., 1983.Detection of mutual inconsistency in distributed systems. IEEE Trans.Software Eng. 9 (3), 240–247.

Patterson,D.A., Gibson, G., Katz, R.H., 1988. A case for redundant arrays ofinexpensive disks (RAID). In: Proceedings of the 1988 ACM SIGMODConference on Management of Data, pp. 109–116.

Pausch,R., 1988. Adding input and output to the transaction model. Ph.D.Thesis, Computer Science Dept., Carnegie Mellon University, August(CMU-CS-88-171).

Pinheiro,E., Weber, W.-D., Barroso, L.A., 2007. Failure trends in large diskdrive populations. In: Proceedings of the 5th USENIX Conference on Fileand Storage Technologies (FAST ’07), pp. 17–28.

Rahm,E., 1993. Empirical performance evaluation of concurrency and coherencycontrol protocols for database sharing systems. ACM Trans. DatabaseSyst. 18 (2), 333–377.

Raz,Y., 1992. The principle of commitment ordering, or guaranteeingserializability in a heterogeneous environment of multiple autonomousresource managers using atomic commitment. In: Proceedings of the 1992International Conference on Very Large Data Bases, pp. 292–312.

Reed,D.P., 1978. Naming and synchronization in a decentralized computersystem. Ph.D. Dssertation, Department of Electrical Engineering andComputer Science, MIT., Cambridge, MA. Technical Report TR-205,Laboratory for Computer Science, Cambridge, MA.

Rescorla, E., 2001. SSL and TLS—Designing and Building Secure Systems. Addison-Wesley, Upper Saddle River, NJ.

Richardson, L., Ruby, S., 2007. RESTful Web Services. O’Reilly Media, Sebastopol, CA.

Shasha,D., Bonnet, P., 2002. Database Tuning: Principles, Experiments, andTroubleshooting Techniques. Morgan Kaufmann Publishers, San Francisco.

Silberschatz, A., Galvin, P.B., Gagne, G., 2008. Operating System Concepts, seventh ed. Wiley, Hoboken, NJ.

Stonebraker,M., 1979. Concurrency control and consistency of multiple copies ofdata in distributed INGRES. IEEE Trans. Software Eng. 3 (3), 188–194.

Tay, Y.C., 1987. Locking Performance in Centralized Databases. Academic Press, Orlando, FL.

Terry,D.B., 2008. Replicated data management for mobile computing. In:Synthesis Lectures on Mobile and Pervasive Computing #5, Morgan &Claypool Publishers.

The Open Group, 1992. Distributed TP: The XA Specification. http://www.opengroup.org/bookstore/catalog/c193.htm.

Thomas,R., 1979. A majority consensus approach to concurrency control formultiple copy databases. ACM Trans. Database Syst. 4 (2), 180–209.

Thomasian, A., 1996. Database Concurrency Control: Methods, Performance, and Analysis. Kluwer Academic Publishers, Boston.

Thomasian, A., 1998. Concurrency control: methods, performance, and analysis. ACM Comput. Surv. 30 (1), 70-119.

UNIX International, 1992. Open Enterprise Transaction Processing: Integrating the TUXEDO System with Mainframe CICS.

Vinoski,S., 2008a. RPC and REST—dilemma, disruption, and displacement. IEEEInternet Comput. September/October, 92–95, Toward Integration Column.

Vinoski,S., 2008b. RESTful web services development checklist. IEEE InternetComput. November/December, 94–96, Toward Integration Column.

Weerawarana,S., Curbera, F., Leymann, F., Storey, T., Ferguson, D., 2005. WebServices Platform Architecture: SOAP, WSDL, WS-Policy, WS-Addressing,WS-BPEL, WS-Reliable Messaging, and More. Prentice-Hall, Upper SaddleRiver, NJ.

Weikum,G., Vossen, G., 2002. Transactional Information Systems—Theory,Algorithms, and the Practice of Concurrency Control and Recovery.Morgan Kaufmann Publishers, San Francisco.

Willis, J.M., 1994. TP Software Development for Open VMS. CBM Books, Horsham, PA.

Wolter, R., 2006. The Rational Guide to SQL Server 2005 Service Broker. Rational Press, Rollinsford, NH.