Decomposable Searching Problems I: Static-to-Dynamic Transformation

  title={Decomposable Searching Problems I: Static-to-Dynamic Transformation},
  author={J. Bentley and J. B. Saxe},
  journal={J. Algorithms},
  • J. Bentley, J. B. Saxe
  • Published 1980
  • Mathematics, Computer Science
  • J. Algorithms
  • Abstract Transformations that serve as tools in the design of new data structures are investigated. Specifically, general methods for converting static structures (in which all elements are known before any searches are performed) to dynamic structures (in which insertions of new elements can be mixed with searches) are studied. Three classes of such transformations are exhibited, each based on a different counting scheme for representing the integers, and a combinatorial model is used to show… CONTINUE READING
    372 Citations

    Figures, Tables, and Topics from this paper.

    Explore Further: Topics Discussed in This Paper

    An Alphard Specification of a Correct and Efficient Transformation on Data Structures
    • 14
    • PDF
    Static-to-Dynamic Transformation for Metric Indexing Structures
    • 2
    • PDF
    Fractional cascading: I. A data structuring technique
    • 268
    Competitive Data-Structure Dynamization
    On the dynamization of data structures
    • 6
    • PDF
    Persistence, offline algorithms, and space compaction
    • 5
    • Highly Influenced
    • PDF


    Decomposable Searching Problems
    • 338
    • PDF
    An Alphard Specification of a Correct and Efficient Transformation on Data Structures
    • 14
    • PDF
    Dynamization of Decomposable Searching Problems
    • 37
    • PDF
    Efficient worst-case data structures for range searching
    • 184
    Predicate-Oriented Database Search Algorithms
    • D. Willard
    • Computer Science
    • Outstanding Dissertations in the Computer Sciences
    • 1978
    • 61
    Partial-Match Retrieval Algorithms
    • 263
    • PDF
    A data structure for orthogonal range queries
    • G. S. Lueker
    • Computer Science
    • 19th Annual Symposium on Foundations of Computer Science (sfcs 1978)
    • 1978
    • 221
    A New Approach to Planar Point Location
    • F. Preparata
    • Mathematics, Computer Science
    • SIAM J. Comput.
    • 1981
    • 132
    • PDF
    A data structure for manipulating priority queues
    • 318
    • PDF