Package com.orientechnologies.orient.core.type.tree

Source Code of com.orientechnologies.orient.core.type.tree.OMVRBTreeDatabase

/*
* Copyright 1999-2010 Luca Garulli (l.garulli--at--orientechnologies.com)
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
*     http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package com.orientechnologies.orient.core.type.tree;

import java.io.IOException;
import java.util.HashSet;
import java.util.Set;

import com.orientechnologies.common.collection.OMVRBTreeEntry;
import com.orientechnologies.common.collection.OMVRBTreeThreadLocal;
import com.orientechnologies.orient.core.db.ODatabase;
import com.orientechnologies.orient.core.db.ODatabaseListener;
import com.orientechnologies.orient.core.db.record.ODatabaseRecord;
import com.orientechnologies.orient.core.id.ORID;
import com.orientechnologies.orient.core.index.OIndexException;
import com.orientechnologies.orient.core.record.impl.ORecordBytesLazy;
import com.orientechnologies.orient.core.serialization.serializer.stream.OStreamSerializer;

/**
* Persistent MVRB-Tree implementation. The difference with the class OMVRBTreeStorage is the level. In facts this class works
* directly at the database level, while the other at storage level.
*
*/
@SuppressWarnings("serial")
public class OMVRBTreeDatabase<K, V> extends OMVRBTreePersistent<K, V> implements ODatabaseListener {
  protected ODatabaseRecord  database;
  private int                users;

  public OMVRBTreeDatabase(final ODatabaseRecord iDatabase, final ORID iRID) {
    super(iDatabase.getClusterNameById(iRID.getClusterId()), iRID);
    database = iDatabase;
    record.setDatabase(iDatabase);
    init(iDatabase);
  }

  public OMVRBTreeDatabase(final ODatabaseRecord iDatabase, String iClusterName, final OStreamSerializer iKeySerializer,
      final OStreamSerializer iValueSerializer) {
    super(iClusterName, iKeySerializer, iValueSerializer);
    database = iDatabase;
    record.setDatabase(iDatabase);
    init(iDatabase);
  }

  public void delete() {
    clear();
    record.delete();
    deinit(database);
  }

  @Override
  protected OMVRBTreeEntryDatabase<K, V> createEntry(final K key, final V value) {
    adjustPageSize();
    return new OMVRBTreeEntryDatabase<K, V>(this, key, value, null);
  }

  @Override
  protected OMVRBTreeEntryDatabase<K, V> createEntry(final OMVRBTreeEntry<K, V> parent) {
    adjustPageSize();
    return new OMVRBTreeEntryDatabase<K, V>(parent, parent.getPageSplitItems());
  }

  @Override
  protected OMVRBTreeEntryDatabase<K, V> loadEntry(final OMVRBTreeEntryPersistent<K, V> iParent, final ORID iRecordId)
      throws IOException {

    // SEARCH INTO THE CACHE
    OMVRBTreeEntryDatabase<K, V> entry = (OMVRBTreeEntryDatabase<K, V>) cache.get(iRecordId);
    if (entry == null) {
      // NOT FOUND: CREATE IT AND PUT IT INTO THE CACHE
      entry = new OMVRBTreeEntryDatabase<K, V>(this, (OMVRBTreeEntryDatabase<K, V>) iParent, iRecordId);
      cache.put(iRecordId, entry);

      // RECONNECT THE LOADED NODE WITH IN-MEMORY PARENT, LEFT AND RIGHT
      if (entry.parent == null && entry.parentRid.isValid()) {
        // TRY TO ASSIGN THE PARENT IN CACHE IF ANY
        final OMVRBTreeEntryPersistent<K, V> parentNode = cache.get(entry.parentRid);
        if (parentNode != null)
          entry.setParent(parentNode);
      }

      if (entry.left == null && entry.leftRid.isValid()) {
        // TRY TO ASSIGN THE PARENT IN CACHE IF ANY
        final OMVRBTreeEntryPersistent<K, V> leftNode = cache.get(entry.leftRid);
        if (leftNode != null)
          entry.setLeft(leftNode);
      }

      if (entry.right == null && entry.rightRid.isValid()) {
        // TRY TO ASSIGN THE PARENT IN CACHE IF ANY
        final OMVRBTreeEntryPersistent<K, V> rightNode = cache.get(entry.rightRid);
        if (rightNode != null)
          entry.setRight(rightNode);
      }

      if (debug)
        System.out.printf("\nLoaded entry node %s: parent %s, left %s, right %s", iRecordId, entry.parentRid, entry.leftRid,
            entry.rightRid);

    } else {
      // COULD BE A PROBLEM BECAUSE IF A NODE IS DISCONNECTED CAN IT STAY IN CACHE?
      // entry.load();
      if (debug)
        System.out.printf("\nReused entry node %s from cache: parent %s, left %s, right %s. New parent: %s", iRecordId,
            entry.parentRid, entry.leftRid, entry.rightRid, iParent);

      // FOUND: ASSIGN IT
      entry.setParent(iParent);
    }

    entry.checkEntryStructure();

    return entry;
  }

  public ODatabaseRecord getDatabase() {
    return database;
  }

  @Override
  public OMVRBTreePersistent<K, V> load() {
    if (!record.getIdentity().isValid())
      // NOTHING TO LOAD
      return this;

    record = (ORecordBytesLazy) record.load();
    record.recycle(this);
    fromStream(record.toStream());
    OMVRBTreeThreadLocal.INSTANCE.reset();
    return this;
  }

  @Override
  public OMVRBTreePersistent<K, V> save() throws IOException {
    record.save(clusterName);
    return this;
  }

  public void onOpen(final ODatabase iDatabase) {
  }

  public void onBeforeTxBegin(ODatabase iDatabase) {
  }

  public void onBeforeTxRollback(ODatabase iDatabase) {
  }

  public void onAfterTxRollback(final ODatabase iDatabase) {
    try {

      cache.clear();
      entryPoints.clear();
      if (root != null && ((OMVRBTreeEntryDatabase<K, V>) root).record.getIdentity().isPersistent()) {
        if (record.getDatabase() != null && !record.getDatabase().isClosed())
          ((OMVRBTreeEntryDatabase<K, V>) root).load();
      }
    } catch (IOException e) {
      throw new OIndexException("Error on loading root node");
    }
  }

  public void onBeforeTxCommit(final ODatabase iDatabase) {
    super.commitChanges(database);
  }

  public void onAfterTxCommit(final ODatabase iDatabase) {
    if (cache.keySet().size() == 0)
      return;

    // FIX THE CACHE CONTENT WITH FINAL RECORD-IDS
    final Set<ORID> keys = new HashSet<ORID>(cache.keySet());
    OMVRBTreeEntryDatabase<K, V> entry;
    for (ORID rid : keys) {
      if (rid.getClusterPosition() < -1) {
        // FIX IT IN CACHE
        entry = (OMVRBTreeEntryDatabase<K, V>) cache.get(rid);

        // OVERWRITE IT WITH THE NEW RID
        cache.put(entry.record.getIdentity(), entry);
        cache.remove(rid);
      }
    }
  }

  /**
   * Assure to save all the data without the optimization.
   */
  public void onClose(final ODatabase iDatabase) {
    if (database.isClosed())
      return;

    if (--users == 0) {
      super.commitChanges(database);
      cache.clear();
      entryPoints.clear();
      root = null;
    }
  }

  public void onCreate(ODatabase iDatabase) {
  }

  public void onDelete(ODatabase iDatabase) {
  }

  private void init(final ODatabaseRecord iDatabase) {
    users++;
    iDatabase.registerListener(this);
  }

  private void deinit(final ODatabaseRecord iDatabase) {
    iDatabase.unregisterListener(this);
  }
}
TOP

Related Classes of com.orientechnologies.orient.core.type.tree.OMVRBTreeDatabase

TOP
Copyright © 2018 www.massapi.com. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.