On the dynamization of data structures
Copyright policy )On the dynamization of data structures
We present a simple dynamization method that preserves the query and storage costs of a static data structure and ensures reasonable update costs. In this method, the majority of data elements are maintained in a single data structure, and the updates are handled using ``smaller'' auxiliary data structures. We analyze the query, storage, and amortized update costs for the dynamic version of a static data structure in terms of a function f, such that \(f(n)
- Louisiana State University United States
- Georgia State University United States
Data structures, multiple attribute trees, merging cost, K- d trees, quadtrees, query and storage costs, Voronoi diagrams, amortized insertion and deletion costs, update costs, merging of two data structures
Data structures, multiple attribute trees, merging cost, K- d trees, quadtrees, query and storage costs, Voronoi diagrams, amortized insertion and deletion costs, update costs, merging of two data structures
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).3 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!