I/O-Efficient Structures for Orthogonal Range-Max and Stabbing-Max Queries

No abstract is available for this paper.

• Publication year

  2003

• Venue

  Embedded Systems and Applications

• Publication date

  2003-09-16

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-540-39658-1_4
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• CRB-Tree: An Efficient Indexing Scheme for Range-Aggregate Queries

  2003cited by this paper
• Dynamic rectangular intersection with priorities

  2003cited by this paper
• Handbook of Massive Data Sets

  2002cited by this paper
• Nearest common ancestors: a survey and a new distributed algorithm

  2002cited by this paper
• External Memory Data Structures

  2001cited by this paper
• I/O-efficient dynamic planar point location (extended abstract)

  2000cited by this paper
• Internet packet filter management and rectangle geometry

  2000cited by this paper
• I/o-eecient Dynamic Planar Point Location

  2000cited by this paper
• I/O-efficient dynamic point location in monotone planar subdivisions

  1999cited by this paper
• Advances in Discrete and Computational Geometry

  1999cited by this paper
• I/o-eecient Dynamic Planar Point Location

  1999cited by this paper
• Online Data Structures in External Memory

  1999cited by this paper
• Optimal Dynamic Range Searching in Non-replicating Index Structures

  1999cited by this paper
• Issues Raised by Three Years of Developing PJama: An Orthogonally Persistent Platform for Java

  1999cited by this paper
• Multidimensional access methods

  1998cited by this paper
• Optimal dynamic interval management in external memory

  1996cited by this paper
• Recursive Star-Tree Parallel Data Structure

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

  1988influential reference
• A Functional Approach to Data Structures and Its Use in Multidimensional Searching

  1988cited by this paper
• The Design of Dynamic Data Structures

  1987cited by this paper
• On the Intersection of Orthogonal Objects

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

  1981cited by this paper
• A unifying look at data structures

  1980cited by this paper
• Multidimensional divide-and-conquer

  1980cited by this paper
• Ubiquitous B-Tree

  1979cited by this paper
• Organization and maintenance of large ordered indexes

  1972cited by this paper
• Noname manuscript No. (will be inserted by the editor) Incremental Computation and Maintenance of Temporal Aggregates �

  year unknowncited by this paper

• An (Almost) Optimal Solution for Orthogonal Point Enclosure Query in ℝ3

  2020cites this paper
• Efficient Queries of Stand-off Annotations for Natural Language Processing on Electronic Medical Records

  2016cites this paper
• Dynamic approach of Range Aggregate queries in Big Data environment

  2016cites this paper
• On Top-k Range Reporting in 2D Space

  2015cites this paper
• Approximate Range Counting Revisited

  2015cites this paper
• I/O-Efficient Bundled Range Aggregation

  2014influential citation
• I / O-Efficient Bundled Range Aggregation Yufei

  2013influential citation
• FIFO indexes for decomposable problems

  2011cites this paper
• Efficient Top-k Queries for Orthogonal Ranges

  2011cites this paper
• New results on two-dimensional orthogonal range aggregation in external memory

  2011influential citation
• Range-Aggregate Queries Involving Geometric Aggregation Operations

  2011cites this paper
• A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time

  2011cites this paper
• RANGE-AGGREGATE QUERY PROBLEMS IN COMPUTATIONAL GEOMETRY

  2011cites this paper
• Range aggregate structures for colored geometric objects

  2010cites this paper
• Algorithms and Data Structures for External Memory

  2008cites this paper
• An optimal dynamic interval stabbing-max data structure?

  2005cites this paper
• Range aggregate processing in spatial databases

  2004cites this paper
• External Memory Geometric Data Structures

  2002cites this paper
• External memory algorithms and data structures: dealing with massive data

  2001cites this paper