Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

ICALP
2004
Springer

favoriteEmaildiscussreport

103views Programming Languages» more ICALP 2004»

A General Technique for Managing Strings in Comparison-Driven Data Structures

13 years 10 months ago

A General Technique for Managing Strings in Comparison-Driven Data Structures

Download www.di.unipi.it

Abstract. This paper presents a general technique for optimally transforming any dynamic data structure D that operates on atomic and indivisible keys by constant-time comparisons, into a data structure D that handles unbounded-length keys whose comparison cost is not a constant.

Gianni Franceschini, Roberto Grossi

Real-time Traffic

Data Structure | Dynamic Data Structure | ICALP 2004 | Indivisible Keys | Theoretical Computer Science |

claim paper

Related Content

» Generalized vs Set Median Strings for HistogramBased Distances Algorithms and Classificati...

» StringMatching and Update through Algebraic Signatures in Scalable Distributed Data Struct...

» Incorporating string transformations in record matching

» Probabilistic string similarity joins

» Compression Indexing and Retrieval for Massive String Data

» XML Prefiltering as a String Matching Problem

» Dictionarybased orderpreserving string compression for main memory column stores

» Information extraction from structured documents using ktestable tree automaton inference

» A heuristic approach for checking containment of generalized treepattern queries

Post Info
More Details (n/a)

Added	01 Jul 2010
Updated	01 Jul 2010
Type	Conference
Year	2004
Where	ICALP
Authors	Gianni Franceschini, Roberto Grossi

Comments (0)