DOCSLIB.ORG

Exploring Remote Object Coherence in XML Web Services

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Exploring Remote Object Coherence in XML Web Services Published in the proceedings of the IEEE International Conference on Web Services (ICWS) 2006, pages 249–256. Exploring Remote Object Coherence in XML Web Services Robert van Engelen1∗ Madhusudhan Govindaraju2† Wei Zhang1 1 Department of Computer Science and School of Computational Science, Florida State University 2 Department of Computer Science, State University of New York (SUNY) at Binghamton Abstract Yet, SOAP RPC [20] provides an object and data serial- ization format that clearly suggests a tight coupling between Object-level coherence in distributed applications and programming language types and XML constructs such systems has been studied extensively. Object coherence in as primitive types, arrays, structs, and multi-references. platform-specific and tightly-coupled systems is achieved The SOAP RPC standard appears to be particularly well- with binary serialization protocols to ensure data struc- suited for RPC-based messaging by mapping application tures and object graphs are safely transmitted, manipu- data onto SOAP RPC-encoded XML. With the move to doc- lated, and stored. On the opposite side of the spectrum ument/literal Web services and XML schema as a popular are platform-neutral Web services that embrace XML as serialization meta-format, accurate programming language a serialization protocol for building loosely coupled sys- type mappings have become even more important, yet more tems. The advantages of XML to connect heterogeneous sys- difficult to achieve because there is no standard mapping be- tems are plenty, but rendering programming-language spe- tween XML schema and program language types. cific data structures and object graphs in text form incurs Several authors [8, 10] refer to the mapping problem a performance hit and presents challenges for systems that as the Object/XML (O/X) impedance mismatch, a term require object coherence. Achieving the latter goal poses that bears some resemblance with the heavily-studied Ob- difficulties by a phenomenon that is sometimes referred to ject/Relational (O/R) mapping problem, thereby relating as the “impedance mismatch” between programming lan- the SOAP/XML interoperability issues to the imperfec- guage data types and XML schema types. This paper exam- tion of the O/X mapping. However, a major part of the ines the problem, debunks the O/X-mismatch controversy, O/X-mismatch can be attributed to the limitations of the and presents a mix of static/dynamic algorithms for accu- widely-used JAX-RPC implementation of SOAP in Java, rate XML serialization. Experimental results show that the see Loughran et al. [8]. They also argue that the O/X- implementation in C/C++ is efficient and competitive to bi- mismatch problem is compounded by the misconception nary protocols. Application of the approach to other pro- among many developers that JAX-RPC is SOAP-RPC. gramming languages, such as Java, is also discussed. This paper debunks the O/X-mismatch controversy, ex- amines the coherence problem, and presents a mix of static/dynamic algorithms for accurate XML serializa- 1. Introduction tion within the limits of XML schema constraints. In Sec- tion 2 we argue that trying to compare XML schema to pro- XML Web services technologies have proven to be ex- gramming language type systems is counter productive. cellent vehicles for bridging the platform and programming Section 3 states the requirements for object-level coher- language gap in heterogeneous distributed systems. The ex- ence and presents a brief overview of systems that achieve pressiveness and simplicity of XML paired with SOAP Web coherence using binary protocols. We discuss the de- services interoperability characteristics are highly appeal- sign and solution space for object coherence in XML ser- ing compared to binary protocols. However, object coher- vices using specific examples from Apache Axis (Java) [1] ence in platform-specific and tightly-coupled systems has and gSOAP (C/C++) [17]. The mapping problem of pro- been achieved for years with binary serialization protocols. gramming language types to XML schema is discussed By contrast, Web services are loosely coupled and are not in Section 4 and specifically applied to C/C++ and Java. specifically designed to meet these strong requirements. Our XML serialization approach for object-level coher- ence is introduced in Section 5 with a presentation of the al- ∗ Supported in part by NSF grant BDI-0446224 and DOE Early Career gorithms. Section 6 gives performance results to verify the Principal Investigator grant DEFG02-02ER25543. efficiency of the implementation on various platforms. Fi- † Supported in part by NSF grants IIS-0414981 and CNS-0454298. nally, Section 7 summarizes our findings. 2. The O/X Impedance Mismatch Revisited ical namespace prefixes in identifier names, such as struct/class members with gSOAP [17], is practical Any context-free language has an infinite number of and effective to resolve namespaces. Annotations sug- grammars to describe the syntactically valid strings. Like- gested in [8] are not sufficient, because name clashes wise, XML content can be described and constrained in cannot be resolved. many different ways [12], e.g. using XML schema, Relax • Unsupported XML schema components. As we men- NG, DTD, and LL(1) grammars [9] to name just a few. In tioned earlier, many schema components that are for- fact, many different XML schemas can be constructed to eign to programming language types can be elimi- describe the structure of a set of XML documents. In other nated and translated to simpler structures. De-sugaring words, we believe it is counter productive to compare a spe- a schema yields an equivalent but simpler schema. cific schema to a programming language type system. • Unsupported types. All built-in XSD types can be The primary purpose of XML schema is to provide a mapped to basic programming language types or to meta language for (manually) defining valid XML content, specialized types introduced to represent XSD types. where certain schema components are clearly intended to • Serializing a graph of objects. SOAP-RPC encod- make this process simpler with convenient constructs to re- ing provides multi-referencing to serialize (cyclic) ob- lieve the schema author from heavy text editing and by pro- ject/data graphs. Most SOAP toolkits support this fea- viding modular components for elements, types, and group- ture, but not all of the toolkits necessarily follow the ings of these. Any XML schema with element references, SOAP specification that limits the use of multi-ref for groups, and substitutions can be translated into an equiva- data with multiple references only. Document/literal lent schema (or schema-like language) without these, while poses some further problems, see Section 3. maintaining the validity constraints. Once we obtain a de- sugared schema by translating the unnecessary extras to This section presented mostly a schema-centric view of simpler constructs, the mapping is much clearer. Therefore, Web services layered on top of a programming language we reject the notion that the O/X mapping is intractable. and its type system, where we reflected on the primary con- However, we agree that the mapping is a challenge for cerns for finding suitable programming language types for each unique programming language, especially for serial- XML schema components. However, the latter issue also izing object graphs in SOAP/XML. presents a point of view from a language perspective, where We summarize and comment on the arguments com- the problem at hand has close similarities to the object- monly stated in the context of the alleged O/X-mismatch: coherence problem. • The inability to support derivation by restriction, such as restricted value ranges and patterns. However, re- 3. Object-Level Coherence Requirements stricted types basically stand on their own, so the Large-scale distributed systems require strong ob- derivation hierarchy is not relevant at runtime when se- ject coherence guarantees [2] to ensure that objects moved, rializing objects. Indeed, support for restriction is not cached, and copied across a set of nodes in a distributed sys- fundamentally more difficult than defining restricted tem preserve their structure and state. Coherence is a ba- types in languages that support subtyping, e.g. sub- sic requirement in tightly-coupled distributed systems, such range types in Pascal. Note that languages that do not as Java RMI [15], CORBA [13], and XDR-based RPC [6]. support subtyping require other mechanisms, such as In these systems the consistency of the distributed ob- the program annotations with gSOAP [17] for C/C++. jects is critical and leads to fragility of the system when • Not being able to map XML names to identifiers. Punc- kept unchecked, e.g. Java class loaders dynamically ver- tuation and Unicode characters in XML names can ify imported classes. be encoded with simple conventions such as with hex Similarly, SOAP/XML processors share schemas to ver- _xABCD_ codes in identifier names, as suggested in ify XML content, but must also be aware of the object refer- the SOAP specifications. Many modern programming encing mechanism used when (de)serializing object graphs. languages also support Unicode identifier names. Accurately representing object graphs in XML is critical • No mechanism for implementing XML namespaces. to achieve structural coherence. We consider resolutions to We agree that Java packages and C++ namespaces the following issues critical for achieving object-level co- cannot adequately simulate the XML namespace con- herence in XML Web services: cept, because XML namespace resolution is not lim- ited to types, but also determines the namespaces of • SOAP 1.1 RPC encoded multi-ref accessors are placed local elements and attributes. Schema import, include, at the end of a message, so that all references are and redefine constructs also do not translate to package forward pointing. Object copying or pointer back- imports. We believe that the incorporation of canon- patching must be used by the deserializer for each for- Tree DAG DAG X X X X X Shape Y Z Y X <complexType name="X"> <complexType name="X"> <sequence> ..
Load more

Recommended publications
  • Gnu Smalltalk Library Reference Version 3.2.5 24 November 2017
    gnu Smalltalk Library Reference Version 3.2.5 24 November 2017 by Paolo Bonzini Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation; with no Invariant Sections, with no Front-Cover Texts, and with no Back-Cover Texts. A copy of the license is included in the section entitled \GNU Free Documentation License". 1 3 1 Base classes 1.1 Tree Classes documented in this manual are boldfaced. Autoload Object Behavior ClassDescription Class Metaclass BlockClosure Boolean False True CObject CAggregate CArray CPtr CString CCallable CCallbackDescriptor CFunctionDescriptor CCompound CStruct CUnion CScalar CChar CDouble CFloat CInt CLong CLongDouble CLongLong CShort CSmalltalk CUChar CByte CBoolean CUInt CULong CULongLong CUShort ContextPart 4 GNU Smalltalk Library Reference BlockContext MethodContext Continuation CType CPtrCType CArrayCType CScalarCType CStringCType Delay Directory DLD DumperProxy AlternativeObjectProxy NullProxy VersionableObjectProxy PluggableProxy SingletonProxy DynamicVariable Exception Error ArithmeticError ZeroDivide MessageNotUnderstood SystemExceptions.InvalidValue SystemExceptions.EmptyCollection SystemExceptions.InvalidArgument SystemExceptions.AlreadyDefined SystemExceptions.ArgumentOutOfRange SystemExceptions.IndexOutOfRange SystemExceptions.InvalidSize SystemExceptions.NotFound SystemExceptions.PackageNotAvailable SystemExceptions.InvalidProcessState SystemExceptions.InvalidState
    [Show full text]
  • Secure the Clones - Static Enforcement of Policies for Secure Object Copying Thomas Jensen, Florent Kirchner, David Pichardie
    Secure the Clones - Static Enforcement of Policies for Secure Object Copying Thomas Jensen, Florent Kirchner, David Pichardie To cite this version: Thomas Jensen, Florent Kirchner, David Pichardie. Secure the Clones - Static Enforcement of Policies for Secure Object Copying. ESOP 2011, 2011, Saarbrucken, Germany. hal-01110817 HAL Id: hal-01110817 https://hal.inria.fr/hal-01110817 Submitted on 28 Jan 2015 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Secure the Clones * Static Enforcement of Policies for Secure Object Copying Thomas Jensen, Florent Kirchner, and David Pichardie INRIA Rennes – Bretagne Atlantique, France [email protected] Abstract. Exchanging mutable data objects with untrusted code is a delicate matter because of the risk of creating a data space that is accessible by an attacker. Consequently, secure programming guidelines for Java stress the importance of using defensive copying before accepting or handing out references to an inter- nal mutable object. However, implementation of a copy method (like clone()) is entirely left to the programmer. It may not provide a sufficiently deep copy of an object and is subject to overriding by a malicious sub-class. Currently no language-based mechanism supports secure object cloning.
    [Show full text]
  • Lazy Object Copy As a Platform for Population-Based Probabilistic Programming
    Lazy object copy as a platform for population-based probabilistic programming Lawrence M. Murray Uber AI Abstract This work considers dynamic memory management for population-based probabilistic programs, such as those using particle methods for inference. Such programs exhibit a pattern of allocating, copying, potentially mutating, and deallocating collections of similar objects through successive generations. These objects may assemble data structures such as stacks, queues, lists, ragged arrays, and trees, which may be of random, and possibly unbounded, size. For the simple case of N particles, T generations, D objects, and resampling at each generation, dense representation requires O(DNT ) memory, while sparse representation requires only O(DT + DN log DN) memory, based on existing theoretical results. This work describes an object copy-on-write platform to automate this saving for the programmer. The core idea is formalized using labeled directed multigraphs, where vertices represent objects, edges the pointers between them, and labels the necessary bookkeeping. A specific labeling scheme is proposed for high performance under the motivating pattern. The platform is implemented for the Birch probabilistic programming language, using smart pointers, hash tables, and reference-counting garbage collection. It is tested empirically on a number of realistic probabilistic programs, and shown to significantly reduce memory use and execution time in a manner consistent with theoretical expectations. This enables copy-on-write for the imperative programmer, lazy deep copies for the object-oriented programmer, and in-place write optimizations for the functional programmer. 1 Introduction Probabilistic programming aims at better accommodating the workflow of probabilistic modeling and inference in general-purpose programming languages.
    [Show full text]
  • Concurrent Copying Garbage Collection with Hardware Transactional Memory
    Concurrent Copying Garbage Collection with Hardware Transactional Memory Zixian Cai 蔡子弦 A thesis submitted in partial fulfilment of the degree of Bachelor of Philosophy (Honours) at The Australian National University November 2020 © Zixian Cai 2020 Typeset in TeX Gyre Pagella, URW Classico, and DejaVu Sans Mono by XƎTEX and XƎLATEX. Except where otherwise indicated, this thesis is my own original work. Zixian Cai 12 November 2020 To 2020, what does not kill you makes you stronger. Acknowledgments First and foremost, I thank my shifu1, Steve Blackburn. When I asked you how to learn to do research, you said that it often takes the form of an apprenticeship. Indeed, you taught me the craft of research by example, demonstrating how to be a good teacher, a good researcher, and a good community leader. Apart from the vast technical ex- pertise, you have also been a constant source of advice, support, and encouragement throughout my undergraduate career. I could not ask for a better mentor. I thank Mike Bond from The Ohio State University, who co-supervises me. Meet- ings with you and Steve are always enjoyable for me. I am sorry for the meetings that went over time, often around the dinner time for you, lowering your glucose level. You help me turn complicated ideas into implementation with your experiences in hard- ware transactional memory. I am thankful for your patient guidance and inspiration. Many people have helped me with this thesis. I thank Adrian Herrera, Kunal Sa- reen, and Brenda Wang for subjecting themselves to the draft of this document, and providing valuable feedback.
    [Show full text]
  • Obstacl: a Language with Objects, Subtyping, and Classes
    OBSTACL: A LANGUAGE WITH OBJECTS, SUBTYPING, AND CLASSES A DISSERTATION SUBMITTED TO THE DEPARTMENT OF COMPUTER SCIENCE AND THE COMMITTEE ON GRADUATE STUDIES OF STANFORD UNIVERSITY IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF DOCTOR OF PHILOSOPHY By Amit Jayant Patel December 2001 c Copyright 2002 by Amit Jayant Patel All Rights Reserved ii I certify that I have read this dissertation and that in my opin- ion it is fully adequate, in scope and quality, as a dissertation for the degree of Doctor of Philosophy. John Mitchell (Principal Adviser) I certify that I have read this dissertation and that in my opin- ion it is fully adequate, in scope and quality, as a dissertation for the degree of Doctor of Philosophy. Kathleen Fisher I certify that I have read this dissertation and that in my opin- ion it is fully adequate, in scope and quality, as a dissertation for the degree of Doctor of Philosophy. David Dill Approved for the University Committee on Graduate Studies: iii Abstract Widely used object-oriented programming languages such as C++ and Java support soft- ware engineering practices but do not have a clean theoretical foundation. On the other hand, most research languages with well-developed foundations are not designed to support software engineering practices. This thesis bridges the gap by presenting OBSTACL, an object-oriented extension of ML with a sound theoretical basis and features that lend themselves to efficient implementation. OBSTACL supports modular programming techniques with objects, classes, structural subtyping, and a modular object construction system. OBSTACL's parameterized inheritance mechanism can be used to express both single inheritance and most common uses of multiple inheritance.
    [Show full text]
  • Lecture 8 EECS 498 Winter 2000
    C++ Object Model Classes are abstract types. Objects are instances of that type. Three distinctive aspects of an OO System • Encapsulation Classes group related data and methods • Inheritance Derived classes extend and refine existing abstractions ... the design of consistent, intuitive, and useful class hierarchies is a complex and difficult art. • Dynamic Binding (polymorphism) Delay selection of appropriate abstraction implementation until program execution. ... OO programming is abstract data types with polymorphism C++ Object Model 1 of 19 Lecture 8 EECS 498 Winter 2000 Aspects to Examine • Distinctive Types of Programming • Semantics of Constructors • Semantics of Data • Semantics of Functions • Semantics of Construction, Destruction & Copy C++ Object Model 2 of 19 Lecture 8 EECS 498 Winter 2000 Distinctive Types of Programming • Procedural char *target, *source = “Hello World!”; target = malloc( strlen( source )); strcpy( target, source ); • Abstract Data Type String target, source = “Hello World!”; target = source; if (source == target) ... • Object Oriented class B { virtual int F(int) {return 1;} /* pure? /; } class D : B { virtual void F(int) { return 2;} } class E : B { virtual void F(int) { return 3;} } ... B *b = new B, B *d = new D, E *e = new D; cout << b->F() << d->F() << e->F() << endl; Object oriented model requires reference to operating object. Referred to as this (self, current, etc.) Often first parameter to function C++ Object Model 3 of 19 Lecture 8 EECS 498 Winter 2000 Storage Layout Procedural • Storage sizes are known at compile time Pointers have fixed size on target platform Data namespace encapsulated in type structure Function namespace global Abstract Data Types • Namespace for functions bound to data structure Signature of function is name, result type, parameter types Object Oriented • Virtual functions invocation structure Virtual base classes A virtual base class occurs exactly once in a derived class regardless of the number of times encountered in the class inheritance heirarchy.
    [Show full text]
  • SECURE the CLONES 1. Introduction Exchanging Data Objects with Untrusted Code Is a Delicate Matter Because of the Risk of Creati
    Logical Methods in Computer Science Vol. 8 (2:05) 2012, pp. 1–30 Submitted Sep. 17, 2011 www.lmcs-online.org Published May. 31, 2012 SECURE THE CLONES THOMAS JENSEN, FLORENT KIRCHNER, AND DAVID PICHARDIE INRIA Rennes { Bretagne Atlantique, France e-mail address: fi[email protected] Abstract. Exchanging mutable data objects with untrusted code is a delicate matter be- cause of the risk of creating a data space that is accessible by an attacker. Consequently, secure programming guidelines for Java stress the importance of using defensive copying before accepting or handing out references to an internal mutable object. However, im- plementation of a copy method (like clone()) is entirely left to the programmer. It may not provide a sufficiently deep copy of an object and is subject to overriding by a mali- cious sub-class. Currently no language-based mechanism supports secure object cloning. This paper proposes a type-based annotation system for defining modular copy policies for class-based object-oriented programs. A copy policy specifies the maximally allowed sharing between an object and its clone. We present a static enforcement mechanism that will guarantee that all classes fulfil their copy policy, even in the presence of overriding of copy methods, and establish the semantic correctness of the overall approach in Coq. The mechanism has been implemented and experimentally evaluated on clone methods from several Java libraries. 1. Introduction Exchanging data objects with untrusted code is a delicate matter because of the risk of creating a data space that is accessible by an attacker. Consequently, secure programming guidelines for Java such as those proposed by Sun [17] and CERT [6] stress the importance of using defensive copying or cloning before accepting or handing out references to an internal mutable object.
    [Show full text]
  • Memory Management for Multi-Language Multi-Runtime Systems on Multi-Core Architectures
    UNIVERSITY OF CALIFORNIA Santa Barbara Memory Management for Multi-Language Multi-Runtime Systems on Multi-Core Architectures A Dissertation submitted in partial satisfaction of the requirements for the degree of Doctor of Philosophy in Computer Science by Michal Wegiel Committee in Charge: Professor Chandra Krintz, Chair Professor Amr El Abbadi Professor Ben Zhao March 2011 The Dissertation of Michal Wegiel is approved: Professor Amr El Abbadi Professor Ben Zhao Professor Chandra Krintz, Committee Chairperson January 2011 Memory Management for Multi-Language Multi-Runtime Systems on Multi-Core Architectures Copyright © 2011 by Michal Wegiel iii Dedication and Gratitude I dedicate this dissertation to my family: my parents, Maria and Krzysztof, and my sister, Barbara, for their unconditional support and encouragement throughout all stages of my education. I am deeply grateful to Chandra Krintz for all the support, guidance, mentorship, and help that she has provided during the entire process. I would like to thank Ben Zhao, Amr El Abbadi, and Rich Wolski for serving on my Ph.D. committee. I am grateful to Grzegorz Czajkowski and Laurent Daynes for being my mentors and collaborators during my internship at Sun Labs. Finally, I would like to thank the staff, faculty, and fellow graduate students at the Com- puter Science department at UC Santa Barbara for their support and the opportunity to pursue this work. iv Acknowledgements The text of Chapters 3–7 is in part a reprint of the material as it appears in the conference proceedings listed below. The dissertation author was the primary researcher while the co-author listed on each publication directed and supervised the research which forms the basis for these chapters.
    [Show full text]
  • Objective-C 2.0 Essentials Third Edition
    Objective-C 2.0 Essentials Third Edition i Objective-C 2.0 Essentials – Third Edition ISBN-13: 978-1480262102 © 2012 Neil Smyth. This book is provided for personal use only. Unauthorized use, reproduction and/or distribution strictly prohibited. All rights reserved. The content of this book is provided for informational purposes only. Neither the publisher nor the author offers any warranties or representation, express or implied, with regard to the accuracy of information contained in this book, nor do they accept any liability for any loss or damage arising from any errors or omissions. This book contains trademarked terms that are used solely for editorial purposes and to the benefit of the respective trademark owner. The terms used within this book are not intended as infringement of any trademarks. Find more eBooks online at http://www.eBookFrenzy.com. Rev. 3.0 ii Table of Contents 1. About Objective-C Essentials ...................................................................................................... 1 1.1 Why are you reading this? .................................................................................................... 1 1.2 Supported Platforms ............................................................................................................. 2 2. The History of Objective-C .......................................................................................................... 3 2.1 The C Programming Language .............................................................................................
    [Show full text]
  • Memory Management Programming Guide
    Memory Management Programming Guide Performance 2010-06-24 PROVIDED “AS IS,” AND YOU, THE READER, ARE ASSUMING THE ENTIRE RISK AS TO ITS QUALITY Apple Inc. AND ACCURACY. © 2010 Apple Inc. IN NO EVENT WILL APPLE BE LIABLE FOR DIRECT, All rights reserved. INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES RESULTING FROM ANY DEFECT OR INACCURACY IN THIS DOCUMENT, even No part of this publication may be reproduced, if advised of the possibility of such damages. stored in a retrieval system, or transmitted, in THE WARRANTY AND REMEDIES SET FORTH ABOVE any form or by any means, mechanical, ARE EXCLUSIVE AND IN LIEU OF ALL OTHERS, ORAL OR WRITTEN, EXPRESS OR IMPLIED. No Apple electronic, photocopying, recording, or dealer, agent, or employee is authorized to make otherwise, without prior written permission of any modification, extension, or addition to this Apple Inc., with the following exceptions: Any warranty. person is hereby authorized to store Some states do not allow the exclusion or limitation of implied warranties or liability for incidental or documentation on a single computer for consequential damages, so the above limitation or personal use only and to print copies of exclusion may not apply to you. This warranty gives you specific legal rights, and you may also have documentation for personal use provided that other rights which vary from state to state. the documentation contains Apple’s copyright notice. The Apple logo is a trademark of Apple Inc. Use of the “keyboard” Apple logo (Option-Shift-K) for commercial purposes without the prior written consent of Apple may constitute trademark infringement and unfair competition in violation of federal and state laws.
    [Show full text]
  • Life with Object-Relational Mappers Or, How I Learned to Stop Worrying and Love the ORM
    Life with Object-Relational Mappers Or, how I learned to stop worrying and love the ORM. PGCon 2011 Christophe Pettus PostgreSQL Experts, Inc. [email protected] Has this ever happened to you? • “This query is running way too slowly. God, RDBMSes suck!” • “Well, you just need to change the WHERE clause…” • “I can’t change the SQL. We’re using an…” ORM Let’s talk about ORMs. • What is an ORM? • Why do we have to put up with them? • What are they good at? • What are the problems? • Can’t we just make them go away? • No. Sorry. • How can we live with them? Oh, right. Hi! • Christophe Pettus • Consultant with PostgreSQL Experts, Inc. • PostgreSQL person since 1998. • Application and systems architect. • Designed a bunch of ORMs for various languages. WHEN WORLDS COLLIDE. The Two Worlds • Object-Oriented Programming. • Relational Database Management. Object-Oriented Programming. • Let’s ask Wikipedia! • “Object-oriented programming (OOP) is a programming paradigm using ‘objects’ …” • Ask three programmers, get five answers. • “… – data structures consisting of data fields and methods together with their interactions – to design applications and computer programs.” What is the critical OO feature? • Data abstraction? Nope. • Messaging? Nope. • Modularity? Nope. • Polymorphism? Nope, but getting warmer. • Inheritance? Getting colder… • Encapsulation. Encapsulation • Objects export behavior, not data. • Many language expose the data — but that’s a shortcut. • Many objects don’t have significant behavior — but that’s a degenerate case. • OO is all about wrapping up the behavior and the data into a single package, the object. Object Relationships. • Object models are collections of graphs.
    [Show full text]
  • Important Java Programming Concepts
    Appendix A Important Java Programming Concepts This appendix provides a brief orientation through the concepts of object-oriented programming in Java that are critical for understanding the material in this book and that are not specifically introduced as part of the main content. It is not intended as a general Java programming primer, but rather as a refresher and orientation through the features of the language that play a major role in the design of software in Java. If necessary, this overview should be complemented by an introductory book on Java programming, or on the relevant sections in the Java Tutorial [10]. A.1 Variables and Types Variables store values. In Java, variables are typed and the type of the variable must be declared before the name of the variable. Java distinguishes between two major categories of types: primitive types and reference types. Primitive types are used to represent numbers and Boolean values. Variables of a primitive type store the actual data that represents the value. When the content of a variable of a primitive type is assigned to another variable, a copy of the data stored in the initial variable is created and stored in the destination variable. For example: int original = 10; int copy = original; In this case variable original of the primitive type int (short for “integer”) is assigned the integer literal value 10. In the second assignment, a copy of the value 10 is used to initialize the new variable copy. Reference types represent more complex arrangements of data as defined by classes (see Section A.2).
    [Show full text]