I/O efficient dynamic data structures for longest prefix queries

Moshe Hershcovitch, Haim Kaplan

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We present an efficient data structure for finding the longest prefix of a query string p in a dynamic database of strings. When the strings are IP-addresses then this is the IP-lookup problem. Our data structure is I/O efficient. It supports a query with a string p using I/O operations, where B is the size of a disk block. It also supports an insertion and a deletion of a string p with the same number of I/O's. The size of the data structure is linear in the size of the database and the running time of each operation is O(log(n)∈+∈|p|).

Original languageEnglish
Title of host publicationAlgorithm Theory - SWAT 2008 - 11th Scandinavian Workshop on Algorithm Theory, Proceedings
Pages29-40
Number of pages12
DOIs
StatePublished - 2008
Event11th Scandinavian Workshop on Algorithm Theory, SWAT 2008 - Gothenburg, Sweden
Duration: 2 Jul 20084 Jul 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5124 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference11th Scandinavian Workshop on Algorithm Theory, SWAT 2008
Country/TerritorySweden
CityGothenburg
Period2/07/084/07/08

Fingerprint

Dive into the research topics of 'I/O efficient dynamic data structures for longest prefix queries'. Together they form a unique fingerprint.

Cite this