This is a pure-Java implementation of Berkeley DB by SleepyCat (now
Oracle). Java-1.7 is required for building. From the
"Berkeley DB JE was designed from the ground up in Java. It takes full
advantage of the Java environment. The Berkeley DB JE API provides a
Java Collections-style interface, as well as a programmatic interface
similar to the Berkeley DB API.
Berkeley DB JE is different from all other Java databases available
today. Berkeley DB JE is not a relational engine built in Java. It
is a Berkeley DB-style embedded store, with an interface designed
for programmers, not DBAs. Berkeley DB JE's architecture employs a
log-based, no-overwrite storage system, enabling high concurrency and
speed while providing ACID transactions and record-level locking.
Berkeley DB JE efficiently caches most commonly used data in memory,
without exceeding application-specified limits. In this way Berkeley
DB JE works with an application to use available JVM resources while
providing access to very large data sets.
The Berkeley DB JE architecture provides an underlying storage layer
for any Java application requiring high performance, transactional
integrity and recoverability."
Radiator is a highly configurable and flexible Radius server that supports
authentication by a huge range of authentication methods such as Flat files,
DBM files, Unix password files, SQL databases, remote Radius servers
(proxying), external programs, NT User Manager, Active Directory, LDAP, PAM,
iPASS, GRIC, NIS+, Tacacs+, a wide range of ISP billing packages such as
Emerald, Platypus, Rodopi, Hawk-i, Interbiller98, Freeside etc, your legacy
user database etc, etc.
Radiator now supports more 802.1x secure wireless and LAN authentication
methods than any other Radius server giving a wide choice of 802.1x network
clients.
Radiator also includes many features not found in other Radius servers such
as double-login prevention, username rewriting, full vendor-specific
attributes, time-of-day blocking and a GUI for running user tests. Full list
of technical features.
Runs on all Unix, Linux, Windows 95, 98, NT, 2000, Mac OS-9 and Mac OS-X, VMS.
Due to license restrictions, this package must be purchased and manually
downloaded from the Open System Consultants web site.
Tools for generating IP based Geo-block-ing and Geo-routing tables in
order to configure the system's firewall and/or routing facilities
In general, routing is determined by destination IP addresses, and access
control by the firewall is established by selectors that can be attrib-
uted to incoming and outgoing IP packets, like physical interfaces on
which the packets are going, source and target IP addresses, protocol
types, port numbers, content types and content, etc. The Geo-location
would be just another selector, but this information is not carried
explicitly with IP packets, however, it can be obtained using an IP
address as a key for looking-up the location in an IP database.
Online databases do exist, but these are usually limited to single queries
and in addition the look-up in an online database is by far too slow for
even thinking about being utilized at the firewall level, where IP packets
need to be processed in a microsecond time scale. Therefore, a locally
maintained Geo-location database is indispensable in the given respect.
The System's own routing and filtering tables can be configured to do
these tasks if there is a source of the appropriate data. The ipdbtools(1)
are designed to provide this data and to assist managing and using it.
Amberfish is general purpose text retrieval software, developed at Etymon
by Nassib Nassar and distributed as open source software under the terms
of version 2 of the GNU General Public License (GPL). Its distinguishing
features are indexing/search of semi-structured text (i.e. both free tex
and multiply nested fields), built-in support for XML documents using the
Xerces library, structured queries allowing generalized field/tag paths,
hierarchical result sets (XML only), automatic searching across multiple
databases (allowing modular indexing), TREC format results, efficient
indexing, and relatively low memory requirements during indexing (and the
ability to index documents larger than available memory). Z39.50 support
is available. Other features include Boolean queries, right truncation,
phrase searching, relevance ranking, support for multiple documents per
file, incremental indexing, and easy integration with other UNIX tools,
The architecture is also designed to permit proximity queries; however,
they are not fully implemented at present.
This port also includes the Porter stemming algorithm for suffix
stripping, available at:
http://www.tartarus.org/~martin/PorterStemmer