W3C home > Mailing lists > Public > ietf-http-wg@w3.org > April to June 2018

Re: QPACK and the Static Table

From: Dmitri Tikhonov <dtikhonov@litespeedtech.com>
Date: Thu, 24 May 2018 14:20:56 -0400
To: Roberto Peon <fenix@fb.com>
Cc: Willy Tarreau <w@1wt.eu>, Mike Bishop <mbishop@evequefou.be>, "quic@ietf.org" <quic@ietf.org>, HTTP Working Group <ietf-http-wg@w3.org>
Message-ID: <20180524182055.GA16465@ubuntu-dmitri>
On Thu, May 24, 2018 at 05:53:14PM +0000, Roberto Peon wrote:
> One could make the lookup (more) efficient by storing the index (a
> byte at most) with the key-value pair, where the key-value pair were
> sorted via whatever sorting you'd find most efficient.  If reordering
> allows for some increased efficiency without increasing bits-on-wire,
> I'd think it seems reasonable to change.

Lookup efficiency should be a marginal consideration.  The table has
only a few dozen entries.  There are ways to compile the static table
to make lookups faster (for example, by using a perfect hash) if one
is bothered by doing a simple scan.

  - Dmitri.
Received on Thursday, 24 May 2018 18:21:29 UTC

This archive was generated by hypermail 2.4.0 : Friday, 17 January 2020 17:15:21 UTC