From owner-freebsd-hackers Sun Jun 23 06:43:00 1996 Return-Path: owner-hackers Received: (from root@localhost) by freefall.freebsd.org (8.7.5/8.7.3) id GAA27672 for hackers-outgoing; Sun, 23 Jun 1996 06:43:00 -0700 (PDT) Received: from zed.ludd.luth.se (root@zed.ludd.luth.se [130.240.16.33]) by freefall.freebsd.org (8.7.5/8.7.3) with ESMTP id GAA27666 for ; Sun, 23 Jun 1996 06:42:57 -0700 (PDT) Received: from mother.ludd.luth.se (mother.ludd.luth.se [130.240.16.3]) by zed.ludd.luth.se (8.7.5/8.7.2) with ESMTP id PAA09100; Sun, 23 Jun 1996 15:42:41 +0200 Received: (pantzer@localhost) by mother.ludd.luth.se (8.6.11/8.6.11) id PAA06695; Sun, 23 Jun 1996 15:42:39 +0200 Date: Sun, 23 Jun 1996 15:42:39 +0200 (MET DST) From: Mattias Pantzare To: Michael Hancock cc: denis , freebsd-hackers@FreeBSD.ORG Subject: Re: Dynamically Allocatable Name Service (DANS) In-Reply-To: Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: owner-hackers@FreeBSD.ORG X-Loop: FreeBSD.org Precedence: bulk > > I want to write a name server with dynamical updates and all > > binary database. (Actually I'm writing it) I know, that there is > > dynamical updates support in the existing BIND distribution, but > > it seems to me like fixing a rocket motor to the bike. > > What binary database has enough performance to handle names on the > Internet? I don't think even db will do. And textfiles would be faster?? It is a lot faster with a binary database. Imagine rewriting the textfile every time a change is made. It is not like the database is supposed to hold all the names on the Internet.