Sun Microsystems, Inc.

Benjamin Lerner

Swee Boon Lim

Jacob Y Levy

Donald J Kretsch

Wesley E Mitchell

The present invention teaches a variety of methods, data structures, and apparatus. In a first embodiment of the present invention, an instance of a data type has a data structure including a transient value data field for storing an internalized data format representation of a persistent data associated with the instance and a persistent value data field for storing an externalized data format representation of the persistent data associated with the instance. The data structure provides a capability of maintaining a persistent data associated with the instance within a database in which the data type of the instance is foreign. This includes embodiments in which the database is a relational database or an object oriented database. In some embodiments, the instance is included in a persistent programming language object. A separate embodiment of the present invention teaches a computer system having a central processing unit, a transient computer readable medium accessible by the central processing unit, a persistent computer readable medium accessible by the central processing unit, and an instance of a data type having a data structure stored in the transient computer readable medium. Further implemented on the computer system is a database and a persistent storage manager. The persistent storage manager is operative to manage the database such that the persistent data associated with the instance is maintained within the database. In addition, a number of methods for providing a variety of aspects of transparent persistent data support to instances of persistent foreign data types are disclosed.

Method and apparatus for providing transparent persistent data support

A system and method provides for variable target outputs from a compiler with only a single execution. The compiler includes a front end, a generic back end, and plurality of individual back ends that are dynamically loaded by the compiler during execution. The front end produces an abstract syntax tree which is then processed by the generic back end and the individual back ends to produce a number of back end trees, each adapted for a specific back end, and representative of the desired structure of the various target outputs, including target code files, or events. The generic back end traverses the abstract syntax tree, and on each node of the tree, invokes each back end that has a node of its back end tree attached thereto. The back end can then modify its own back end tree, and attach further back end nodes to other nodes of the abstract syntax tree. In turn the generic back end will invoke such added attached nodes, until all attached back end nodes on all the nodes of the abstract syntax tree have been processed. This results in completed back end trees for all of the back ends, requiring only a single pass of the front end to produce the abstract syntax tree. The individual back ends then process their respective back end trees to produce their target outputs. A look up operation is provided in the generic back end that returns one or more back end nodes in response to a request therefore specifying a node of the abstract syntax tree, and a family identification value of a back end node.

Growing community of inventors

Palo Alto, CA, United States of America

Benjamin Lerner