| Name : bplustree
| |
| Version : 0.2.0
| Vendor : Red Hat, Inc_
|
| Release : 2
| Date : 2001-01-03 17:23:58
|
| Group : Development/Languages
| Source RPM : bplustree-0.2.0-2.src.rpm
|
| Size : 0.08 MB
| |
| Packager : Red Hat, Inc_ < http://bugzilla_redhat_com/bugzilla>
| |
| Summary : This module provides B+ trees for python.
|
Description :
This module provides B+ trees for python.
B+ trees are an efficient index structure for mapping
a dictionary type object into a disk file. All keys for
these dictionary structures are strings with a fixed
maximum length. The values can be strings or
integers (often representing seek positions in a secondary
file) depending on the implementation.
B+ trees can be useful for storing large mappings on disk
in such a way that a small number of keys/values can be
retrieved very quickly (with very few disk accesses).
B+ trees can also be useful for sorting a very large number
(millions) of records by unique string key values.
In this implementation all keys must not exceed the maximum
length for a given tree. For string values there is no
limitation on size of content. Note that in my tests
updates are 2-3 times slower than retrieves, except for
walking which is much faster than normal retrieves.
As an add-on this module also provides a dbm compatible
interface that permits arbitrary length keys and values.
See below.
|
RPM found in directory: /vol/rzm6/linux-redhat/linux/7.1/en/DMA/Python/RPMS |
