[Date Prev] [Date Next] [Thread Prev] [Thread Next] Indexes: Main | Date | Thread | Author

RE: [ba-ohs-talk] Organic Structure to Organize and Retrieve the Record

The BerkleyDB is a high speed disk access and stores
the data in a "Storable" object when you use the Tied
Hashes for transparent access to the data.    (01)

here are some starting points :
Storable for data encoding and decoding
http://www.perldoc.com/perl5.6/lib/Storable.html    (02)

DB_FILE for generic berkley access
http://www.perldoc.com/perl5.6/lib/DB_File.html    (03)

GDBM is another GNU implementation of the berkleydb.
http://www.perldoc.com/perl5.6/lib/GDBM_File.html    (04)

Personally, I found it more important to use a SQL
database server and to be able to query the data from
SQL, even if it is a bit slower. For multiuser
applications like a collaboration system, a SQL server
might be interesting.    (05)

Even though "use mod wiki" does use one DBFile per
page, I still find that not the best solution.    (06)

For the introspector I needed to store complex tree
structures in such a way that they are accessible via
tree, name, context or id.    (07)

The nodes can have any number of attributes and
relationships to other nodes.    (08)

I have written a node retrieval system based on
DBI/DBD perl. That gives you a database independent
interface to the underlying struture.
The node are stored in a graph like sql structure that
allows for addition of attributes. 
This is all part of the introspector project.
http://introspector.sourceforge.net/    (09)

mike    (010)

--- "Garold (Gary) L. Johnson" <dynalt@dynalt.com>
> Jack,
> Perl has direct support for disk based hashtables
> that appear to the program
> as memory structures.
> Berkeley DB http://www.sleepycat.com  is an open
> source database system
> providing both hash and b-tree structures that can
> interface to nearly any
> language.
> Thanks,
> Garold (Gary) L. Johnson
> -----Original Message-----
> From: owner-ba-ohs-talk@bootstrap.org
> [mailto:owner-ba-ohs-talk@bootstrap.org]On Behalf Of
> Jack Park
> Sent: Wednesday, June 05, 2002 7:00 PM
> To: ba-ohs-talk@bootstrap.org
> Subject: Re: [ba-ohs-talk] Organic Structure to
> Organize and Retrieve the
> Record
> Hashtables?
> Take a look at http://dbh.sourceforge.net/
> Disk-based hashtables
> "A DBH is a convenient way to associate keys
> composed by characters to data
> records. Any kind of digital information can go into
> the data record, such
> as text, graphic information, database structures,
> you name it. The idea
> behind using a DBH is to get rid of what is known as
> an index file in the
> database world. In the DBH world, the index is built
> into the file format."
> "DBH extends the concept of binary trees into a
> n-tuple dimensional space.
> This way the trees it creates are much more like the
> trees we actually see
> in nature, and nature is a wise thing. "
> Jack    (011)

James Michael DuPont    (012)

Do You Yahoo!?
Yahoo! - Official partner of 2002 FIFA World Cup
http://fifaworldcup.yahoo.com    (013)