Search data structures for skewed strings

Authors:
Pilu Crescenzi;Roberto Grossi;Giuseppe F. Italiano
Affiliations:
Dipartimento di Sistemi e Informatica, Università degli Studi di Firenze, Italy;Dipartimento di Informatica, Università di Pisa, Italy;Dipartimento di Informatica, Sistemi e Produzione, Università di Roma "Tor Vergata", Italy
Venue:
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Year:
2003

Citing 19
Cited 4

Data structures and network algorithms

Data structures and network algorithms
Self-adjusting binary search trees

Journal of the ACM (JACM)
Multidimensional Balanced Binary Trees

IEEE Transactions on Computers
Skip lists: a probabilistic alternative to balanced trees

Communications of the ACM
Algorithms in C

Algorithms in C
The on-line d-dimensional dictionary problem

SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
On k-dimensional balanced binary trees

Journal of Computer and System Sciences
Data structures and algorithm analysis in C (2nd ed.)

Data structures and algorithm analysis in C (2nd ed.)
Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Fast algorithms for sorting and searching strings

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
The analysis of hybrid trie structures

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric

Journal of the ACM (JACM)
Randomized binary searching with tree structures

Communications of the ACM
Average Case Analysis of Algorithms on Sequences

Average Case Analysis of Algorithms on Sequences
Web log data warehousing and mining for intelligent web caching

Data & Knowledge Engineering - Building web warehouse
Multidimensional B-tree: An Efficient Dynamic File Structure for Exact Match Queries

GI - 10. Jahrestagung
Multidimensional Height-Balanced Trees

IEEE Transactions on Computers
A dichromatic framework for balanced trees

SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science

Combining digital access and parallel partition for quicksort and quickselect

IWMSE '09 Proceedings of the 2009 ICSE Workshop on Multicore Software Engineering
Fast and compact hash tables for integer keys

ACSC '09 Proceedings of the Thirty-Second Australasian Conference on Computer Science - Volume 91
Engineering scalable, cache and space efficient tries for strings

The VLDB Journal — The International Journal on Very Large Data Bases
Redesigning the string hash table, burst trie, and BST to exploit cache

Journal of Experimental Algorithmics (JEA)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider skewed distributions of strings, in which any two such strings share a common prefix much longer than that expected in uniformly distributed (random) strings. For instance, this is the case of URL addresses, IP addresses, or XML path strings, all representing paths in some hierarchical order. As strings sharing a portion of the path have a quite long common prefix, we need to avoid the time-consuming repeated examination of these common prefixes while handling the linked data structures storing them. For this purpose, we show how to implement search data structures that can operate on strings with long prefixes in common. Despite the simplicity and the generality of the method, our experimental study shows that it is quite competitive with several optimized and tuned implementations currently available in the literature.