- Hello World!
- Parallel Ingest
- Rental Fleet Database Application
- Network Elements (Associations | Collections)
Description: This HelloWorld application shows the basics of creating a federated database and a schema. It includes codes that creates a database, creates a container in the database, adds objects in the container, and then accesses these objects via a name look-up.
Description: This Parallel Ingest application demonstrates the raw data ingest speed of Objectivity/DB. In this example, we create a simple 2 DB Federation and populate it with a set of simple objects. The ingest occurs as two separate concurrent threads are created and instructed to fill a particular DB with these objects. The objects will be clustered within one of two containers per DB. The application measures the time it takes the threads to finish the ingest and reports that information to the user. (Total objects ingested per thread, total objects ingested in milliseconds, and the number of objects ingested per second). The number of threads and databases can be scaled up to your desire. To avoid lock conflicts, you should have each thread writing to its own database.
Description: This application demonstrates the basic operations used by the agents and managers of a vehicle rental company. The operations supported are:
- Creating databases that represent the locations of the rental companies (e.g. an airport location)
- Creating containers that represent the company at its location (e.g. a company's name)
- Adding vehicles to the rental company’s fleet of vehicles.
- Renting vehicles that satisfy a predicate.
- Returning rented vehicles.
- Creates a federated database that contains the network element node object model
- Traverses all the tree nodes of the object model
- Scans through all the circuits
- Populates the federated database with one of the schemas list below.
- Creates a database
- Creates containers that will allow the distribution and scalability
- Creates tree nodes and links bottom most nodes into a circuit
- Continues to create until complete specific number of loops
- Commits Transaction
- Starting from top tree node, a recursive scan is done to count all the node's children
- Reports number of nodes found and the time it took to traverse those nodes
- Commits transaction
- Scans circuit container, iterates through the circuit, and counts the circuits.
- Reports the number of circuits found and the time it took to iterate through them
- Commits transaction
Tuesday, October 23, 2012