[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

[Savannah-register-public] [task #8839] Submission of Junoplay Table

From: Morten Hustveit
Subject: [Savannah-register-public] [task #8839] Submission of Junoplay Table
Date: Tue, 11 Nov 2008 19:10:56 +0000
User-agent: Mozilla/5.0 (X11; U; Linux x86_64; en-US; rv: Gecko/2008071420 Iceweasel/3.0.1 (Debian-3.0.1-1)


                 Summary: Submission of Junoplay Table
                 Project: Savannah Administration
            Submitted by: mortehu
            Submitted on: Tue 11 Nov 2008 07:10:54 PM GMT
         Should Start On: Tue 11 Nov 2008 12:00:00 AM GMT
   Should be Finished on: Fri 21 Nov 2008 12:00:00 AM GMT
                Category: Project Approval
                Priority: 5 - Normal
                  Status: None
                 Privacy: Public
        Percent Complete: 0%
             Assigned to: None
             Open/Closed: Open
         Discussion Lock: Any
                  Effort: 0.00



A new project has been registered at Savannah 
This project account will remain inactive until a site admin approves or
discards the registration.

= Registration Administration =

While this item will be useful to track the registration process, *approving
or discarding the registration must be done using the specific Group
<> page*,
accessible only to site administrators, effectively *logged as site
administrators* (superuser):

* Group Administration

= Registration Details =

* Name: *Junoplay Table*
* System Name:  *jpt*
* Type: non-GNU software & documentation
* License: GNU General Public License v2 or later


==== Description: ====
A database designed for use from applications, similar to Berkeley DB.

The interface is designed to be very straightforward to use, requiring only a
call to "init", "insert" and "close" to create a database file and insert a
value into it.

Each database is represented by a single sparse table, that can have up to
2^32 (4 billion) columns and an "arbitrary" number of rows.

The database employs PATRICIA tries and bloom filters for fast data
retrieval.  Newly inserted data is buffered in a splay tree (as well as a
linear transaction log file) for fast data storage.

Unlike most databases, jpt supports the "append" operation, making it suited
to build indexes.

==== Tarball URL: ====


Reply to this item at:


  Message sent via/by Savannah

reply via email to

[Prev in Thread] Current Thread [Next in Thread]