Perl Cheap Database Management System For Sale

CHEAP PERL DATABASE MANAGEMENT SYSTEM

Price

$59.95

The Cheap Perl Database Management System (CPDBMS) is SMALL and EASY to use. It's for Perl. It's small so that it COMPILES FAST (since Perl must be compiled on each execution).

This database system is similar to dBase since all the Field information is stored right in the datbase itself. That means, it's EASY to change the database. You can also browse any database using the Cheap Pearl DBMS browser. (I call it DBU...).

About the index system. It uses a BINARY TREE. Not a BALANCED binary tree, just the simplest, lowest level index possible: a simple BINARY TREE. Although primitive, it avoids a lot of code that makes compile times too long. In my user database, the binary tree search can find a user out of 10,000 users in under 15 reads. Not bad. Well, it's not balanced. But it works OK.

For more information, you may email me at craigh01@gmail.com

If you buy any aaagames.com program you get the basic database routines:

DBOPEN: Open a database

DBGET: Get/read a record based on record number, or NEXT record

DBPUT: Add a record to the database: to the END, or to a specific record number

NDXPUT: Accesses the Cheap Binary Tree index files: can Find a record in the index, or PUT a new record in the index.

Here's what you get with the full database system:

Full documentation on how to use each of the database routines
DBU: Generic Database browser for command-line window or for Telnet
HDBU: Generic Database browser for HTML: You can browse any of the CPDBMS databases, add records, modify records, search, and browse back and forth
Example SCHEMAs and documentation on how to create your databases
DBCREATE: Program to create databases from the schemas
DBUPDATE: With CPDBMS it's so easy to modify the database! Just modify the schema to add or change fields, and run DBUPDATE! The database is updated easily, and a copy of the old database is saved
DBINDEX: Re-index the binary tree indexes. You can also use the reindexing subroutines in your own Perl programs to do a nightly re-index of any databases in your systems
Data DictionaryThis meta-data system lets you have data about your data! It is used to give descriptions for each data field, which is then used by the web-based database browser (HDBU) to give informational titles to your data fields. You can also use the BROWSEDB.PL subroutine to create hard-coded browsers for specific tables - to be used by end users.

Note on the CPDBMS Binary Tree: this is a simple binary tree, not a balanced binary tree. That means it depends on the data being entered randomly. Entering data in sorted order will loose the value of the binary tree! In my User Database (the largest index I've got), I had no problem since user names are entered fairly randomly. As I mentioned, out of 10,000 users an average seek takes 15 reads.

This is also not a B+ tree. A B+ tree would be nicer, since you can traverse your indexes and produce lists in sorted order. With the CPDBMS binary tree, I could not use that algorithm because it is too many lines of code and takes too long to compile (each execution!). However, in order to support one-to-many and many-to-many relationships, I added a linked list algorithm to the binary tree, which links all items with the same key together. You can then use the NDXARRAY subroutine to return an array of record numbers with the key you search on. This supports a one-to-many relationship such as DEPTARTMENT --> EMPLOYEE (use NDXARRAY to return all employees for a specific department), and a many-to-many relationship.

See this stuff online: aaagames.com CGI programs
Main Menu
Web Trivia!
Pokemon Trivia
Movie Lines Trivia
TicTacToe Game
Tagalog2.com - Learn Tagalog!
Graffiti Wall
Football Pool