Cache-oblivious data structures for orthogonal range searching

No abstract is available for this paper.

• Publication year

  2003

• Venue

  SCG '03

• Publication date

  2003-06-08

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1145/777792.777828
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Bkd-Tree: A Dznamic Scalable kd-Tree

  2003cited by this paper
• Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy

  2002cited by this paper
• A locality-preserving cache-oblivious dynamic dictionary

  2002cited by this paper
• Cache Oblivious Distribution Sweeping

  2002cited by this paper
• Exponential Structures for Efficient Cache-Oblivious Algorithms

  2002cited by this paper
• Cache-oblivious priority queue and graph algorithm applications

  2002cited by this paper
• Cache oblivious search trees via binary trees of small height

  2001cited by this paper
• External memory algorithms and data structures: dealing with massive data

  2001cited by this paper
• External Memory Data Structures

  2001cited by this paper
• A Framework for Index Bulk Loading and Dynamization

  2001cited by this paper
• Optimised Predecessor Data Structures for Internal Memory

  2001cited by this paper
• Cache-oblivious B-trees

  2000influential reference
• Tight(er) worst-case bounds on dynamic searching and priority queues

  2000cited by this paper
• Cache-oblivious algorithms

  1999cited by this paper
• On two-dimensional indexability and optimal range search indexing

  1999cited by this paper
• Lower bounds for orthogonal range searching: I. The reporting case

  1990cited by this paper
• A Functional Approach to Data Structures and Its Use in Multidimensional Searching

  1988cited by this paper
• The input/output complexity of sorting and related problems

  1988influential reference
• Filtering search: A new approach to query-answering

  1983cited by this paper
• The K-D-B-tree: a search structure for large multidimensional dynamic indexes

  1981cited by this paper
• Ubiquitous B-Tree

  1979influential reference
• Decomposable Searching Problems

  1979cited by this paper
• Multidimensional binary search trees used for associative searching

  1975influential reference
• Organization and maintenance of large ordered indexes

  1972influential reference

• Parallel kd-tree with Batch Updates

  2025influential citation
• Optimal Batch-Dynamic kd-trees for Processing-in-Memory with Applications

  2025cites this paper
• Parallel kd-tree with Batch Updates (Abstract)

  2025cites this paper
• ParGeo: A Library for Parallel Computational Geometry

  2022influential citation
• Parallel Batch-Dynamic kd-Trees

  2021cites this paper
• High Performance Self Organizing Dynamic Dictionaries

  2016cites this paper
• Automatic Discovery of Efficient Divide-&-Conquer Algorithms for Dynamic Programming Problems

  2016cites this paper
• A guided approach to sampling-based motion planning

  2015cites this paper
• Reduced representations for efficient analysis of genomic data; From microarray to high-throughput sequencing

  2014cites this paper
• Cache-aware asymptotically-optimal sampling-based motion planning

  2014cites this paper
• Indel-tolerant read mapping with trinucleotide frequencies using cache-oblivious kd-trees

  2012cites this paper
• Improved space bounds for cache-oblivious range reporting

  2011influential citation
• I/O-efficient data structures for colored range and prefix reporting

  2011cites this paper
• RANGE SEARCHING DATA STRUCTURES WITH CACHE LOCALITY

  2011cites this paper
• Simulating Parallel Algorithms in the MapReduce Framework with Applications to Parallel Computational Geometry

  2010cites this paper
• A general approach for cache-oblivious range reporting and approximate range counting

  2009cites this paper
• Cache-Oblivious Range Reporting with Optimal Queries Requires Superlinear Space

  2009cites this paper
• On Cartesian Trees and Range Minimum Queries

  2009influential citation
• Engineering a cache-oblivious sorting algorithm

  2008cites this paper
• Cache-Oblivious Model

  2008cites this paper
• External-Memory Search Trees with Fast Insertions by Jelani Nelson

  2007cites this paper
• An Optimal Cache-Oblivious Priority Queue and Its Application to Graph Algorithms

  2007cites this paper
• I/o efficient algorithms and applications in geographic information systems

  2006cites this paper
• External-Memory Search Trees with Fast Insertions

  2006cites this paper
• Simple and semi-dynamic structures for cache-oblivious planar orthogonal range searching

  2006cites this paper
• External-Memory Search Trees with Fast Insertions

  2006cites this paper
• Cache-Oblivious Planar Shortest Paths

  2005cites this paper
• Cache-oblivious planar orthogonal range searching and counting

  2005cites this paper
• Space Efficient Dynamic Orthogonal Range Reporting

  2005cites this paper
• Cache-Oblivious R-Trees

  2005cites this paper
• Cache-Oblivious Algorithms and Data Structures

  2004cites this paper
• Cache-Oblivious Data Structures

  2004influential citation
• Proximity Mergesort: optimal in-place sorting in the cache-oblivious model

  2004cites this paper
• On the limits of cache-obliviousness

  2003cites this paper
• The Cost of Cache-Oblivious Searching

  2003cites this paper
• Static Data Structure for Discrete Advance Bandwidth Reservations on the Internet

  2003cites this paper
• A locality-preserving cache-oblivious dynamic dictionary

  2002cites this paper
• 38 Cache-Oblivious Data Structures

  year unknowncites this paper
• Efficient implementations of range trees

  year unknowncites this paper