Franz Tech Corner News: High Performance Btree Module Now Available

The Franz Tech Corner, December 13, 2006

In this issue:

1. High Performance Btree Module Now Available
2. Techniques for reducing consing when processing large text files
3. Allegro CL documentation index and permuted index update
4. ILC 2007 News, The deadline for abstract submissions is Dec. 15th
5. Training Schedule

1. High Performance Btree Module Now Available

The same btree module that AllegroCache has been using to implement
object persistence is now available for programmers to use
directly. Btrees are useful for applications where you need a simple
and efficient way of storing on disk and retrieving vast amounts of
data and where you don't want to pay the overhead of transactions and
CLOS.

This note discusses Btrees and gives a simple example using them.

http://franz.com/support/tech_corner/btree-121306.lhtml

2. Techniques for reducing consing when processing large text files

Programs often have to process large text files. In particular,
AllegroCache and AllegroGraph programs often need to read enormously
large text based files, such as ntriple rdf files or comma separated
files with hundreds of millions of entries or more. In these cases,
even a small amount of extra consing per entry results in a burdensome
or even unacceptable garbage collection overhead. Techniques are thus
needed for reducing consing to a minimum. In this note, we show
effective cons reducing code. It uses the resource based read-line
variants discussed in this earlier Tech Corner article,

http://franz.com/support/tech_corner/read-line-variants-071406.lhtml

We show space usage reductions from 79Mbytes to 8Kbytes (comparing
naive use of read-line compared to using the variants) and from 257
Mbytes to 98 Mbytes in an example where some information from the data
must be stored.

Read the full article here:
http://franz.com/support/tech_corner/cons-tricks-121306.lhtml

3. Allegro CL documentation index and permuted index update

We have now automated the system for producing the Allegro CL
documentation index and permuted index. This allows us to update both
indexes regularly so features added after a release will be
indexed. (In the past, the regular index was only occasionally updated
and the permuted index was only occasionally updated between Allegro
CL releases.) The Allegro CL 8.0 documentation on our website has
updated indexes.

You may view it on the web or see this page for information
on downloading the updated version.

http://franz.com/support/documentation/

4. ILC 2007 deadline for abstract submissions is December 15th

Please submit your abstracts before the end of this week!!

+ Registration for the conference is now open. Register before
December 31st for a 20% discount off the advance registration
price. There are also discounts for ACM and ALU members.

+ The following have accepted invitations to speak at the conference:

Jans Aasman (Franz)
Richard Jones (University of Kent)
John Mallery (MIT CSAIL)
Ralf Moeller (Hamburg University of Technology)
Christian Queinnec (Univ. Pierre & Marie Curie)
Manuel Serrano (INRIA Sophia Antipolis)
Michael Sperber (University of Tuebingen)
Herbert Stoyan (University of Erlangen)

A few more invited speakers will be announced soon.
http://www.international-lisp-conference.org/2007/speakers

For all of the details:
http://www.international-lisp-conference.org/2007/index

5. Training Schedule

Allegro CL Certification Program - Basic and Intermediate courses
available. Next 3-day sessions:

- Basic, January 10, 17 and 24
- Intermediate, February 7, 14 and 21

Ask us about previously recorded programs that are available if you
are unable to attend the live course.

http://franz.com/services/classes

Make the most of your Allegro CL application by utilizing our
consulting services,

http://franz.com/services/consulting/

Lisp Jobs - http://www.lispjobs.com/

For more information about other Franz products and services, please
contact your product application manager or email sales@franz.com.

Copyright © 2014 Franz Inc., All Rights Reserved | Privacy Statement
Delicious Google Buzz Twitter Google+