Berkeley DB: DB->set_priority
Description: Berkeley DB: An embedded database programmatic toolkit.
Keywords: embedded,database,programmatic,toolkit,btree,hash,hashing,transaction,transactions,locking,logging,access method,access methods,Java,C,C++

### DB->set_priority |

`

###

    #include <db.h>

    int
    DB->set_priority(DB *db, DB_CACHE_PRIORITY priority);

    int
    DB->get_priority(DB *db, DB_CACHE_PRIORITY *priorityp);

### Description: DB->set_priority

Set the cache priority for pages referenced by the DB handle.

The priority of a page biases the replacement algorithm to be more or less likely to discard a page when space is needed in the buffer pool. The bias is temporary, and pages will eventually be discarded if they are not referenced again. The DB->set_priority method is only advisory, and does not guarantee pages will be treated in a specific way.

The DB->set_priority method may be called at any time during the life of the application.

The DB->set_priority method returns a non-zero error value on failure and 0 on success.

### Parameters

priority
  The priority parameter must be set to one of the following values:
  DB_PRIORITY_VERY_LOW
    The lowest priority: pages are the most likely to be discarded.
  DB_PRIORITY_LOW
    The next lowest priority.
  DB_PRIORITY_DEFAULT
    The default priority.
  DB_PRIORITY_HIGH
    The next highest priority.
  DB_PRIORITY_VERY_HIGH
    The highest priority: pages are the least likely to be discarded.

### Description: DB->get_priority

The DB->get_priority method returns the cache priority for pages referenced by the DB handle.

The DB->get_priority method may be called at any time during the life of the application.

The DB->get_priority method returns a non-zero error value on failure and 0 on success.

### Parameters

priorityp
  The DB->get_priority method returns a reference to the cache priority for pages referenced by the DB handle in priorityp.

### Class

DB

### See Also

Databases and Related Methods`

Copyright (c) 1996,2007 Oracle. All rights reserved.