Objectivity/DB: Difference between revisions

Revision as of 10:16, 4 October 2009

Revision as of 10:20, 4 October 2009

Line 15:

Objects can be linked to other objects using named uni-directional or bi-directional links. The links can have a cardinality of 1:1, 1:many, many:1 or many:many and use the OIDs to speed up the navigation of networks of objects. The OIDs are also used in support of scalable collections (tree, list, set etc.), indices and hash tables. Eliminating the relational [[Join]] operations inherent in a relational database gives Objectivity/DB a marked performance advantage.

Objectivity/DB is also different from RDBMSs in the way in which it handles queries. The application declares and initializes an iterator that locates and returns qualified objects as soon as they are located. Many RDBMSs manifest a view of the results before returning any of them. The Objectivity/DB [http://www.odbms.org/download/025.01%20Guzenda%20The%20Evolution%20of%20a%20Distributed,%20Federated%20Object%20Query%20Engine%20June%202006.PDF Parallel Query Engine] splits queries into subtasks directed at individual databases or containers. Remote query agents service each subtask and return results to the iterator. The Parallel Query Engine has two replaceable components: a splitter that can determine how to best subdivide the task and a filter in the query agent that can further refine a query. A query involving cities in Europe might be split into forty nine subtasks, one for each country. The filter might access an external data source before qualifying or disqualifying the objects that the Query Agent has found in the Objectivity/DB database or container.<ref>[[http://www.odbms.org/download/025.01%20Guzenda%20The%20Evolution%20of%20a%20Distributed,%20Federated%20Object%20Query%20Engine%20June%202006.PDF The evolution of a distributed, federated object query engine] Leon Guzenda, June 2006</ref>

Databases and system data (catalogs and [[schema]]) can be replicated to multiple locations using a quorum based synchronous replication mechanism. Replicas that are temporarily separated from the quorum are transparently resynchronized when they are reconnected to the network that services them and their peers. Individual databases and lock servers can be allocated votes that are used to determine whether or not a client can update a replica.