Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 5 of 5 for “"Object graph"”.

  1. A flexible approach for mapping between object-oriented databases and xml. A two way method based on an object graph.

    … a two-way mapping approach between XML and object-oriented databases. The basic steps of the proposed approach are applied in a systematic way to produce a graph from the source and then transform the graph into the destination format. In other words, the derived graph summarizes …

    bradford Repository record for A flexible approach for mapping between object-oriented databases and xml. A two way method based on an object graph. (opens in a new tab)

  2. Static Extraction Of Dataflow Communication For Security

    … of the runtime architecture as an abstract object graph with dataflow edges that refer to abstract objects. The annotations express local, modular hints about architectural tiers, logical containment, and strict encapsulation, such that the extracted object graph is hierarchical, which …

    wayne-thes Repository record for Static Extraction Of Dataflow Communication For Security (opens in a new tab)

  3. Reducing pause times with clustered collection

    … live data. A full collection of millions of live objects can pause the program for multiple seconds. Much of this work, however, is repeated from one collection to the next, particularly for programs that modify only a small fraction of their object graphs between collections. Clustered Collection …

    mit Repository record for Reducing pause times with clustered collection (opens in a new tab)

  4. High Performance Reference Counting and Conservative Garbage Collection

    … It automatically reclaims memory occupied by objects that are no longer in use. Garbage collection began in 1960 with two algorithmic branches — tracing and reference counting. Tracing identifies live objects by performing a transitive closure over the object graph starting with the stacks, …

    aus-cath Repository record for High Performance Reference Counting and Conservative Garbage Collection (opens in a new tab)

  5. High Performance Reference Counting and Conservative Garbage Collection

    … It automatically reclaims memory occupied by objects that are no longer in use. Garbage collection began in 1960 with two algorithmic branches — tracing and reference counting. Tracing identifies live objects by performing a transitive closure over the object graph starting with the stacks, …

    anu Repository record for High Performance Reference Counting and Conservative Garbage Collection (opens in a new tab)