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

No abstract is available for this paper.

• Publication year

  2003

• Venue

  International Conference on Database Theory

• Publication date

  2003-01-08

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/3-540-36285-1_10
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Γ and B

  2004influential reference
• Implementing I/O-efficient Data Structures Using TPIE

  2002cited by this paper
• Aggregate Processing of Planar Points

  2002cited by this paper
• External Memory Data Structures

  2001cited by this paper
• Efficient computation of temporal aggregates with range predicates

  2001influential reference
• I/O-efficient dynamic planar point location (extended abstract)

  2000influential reference
• Handbook of computational geometry

  2000cited by this paper
• The Dynamic Data Cube

  2000cited by this paper
• Hierarchical Compact Cube for Range-Max Queries

  2000cited by this paper
• Effective Temporal Aggregation Using Point-Based Trees

  1999cited by this paper
• Hierarchical Prefix Cubes for Range-Sum Queries

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

  1999cited by this paper
• Approximate computation of multidimensional aggregates of sparse data using wavelets

  1999cited by this paper
• Multidimensional access methods

  1998cited by this paper
• Range queries in OLAP data cubes

  1997cited by this paper
• Cubetree: organization of and bulk incremental updates on the data cube

  1997cited by this paper
• Implementing data cubes efficiently

  1996cited by this paper
• Spatial Data Structures: Concepts and Design Choices

  1996cited by this paper
• Implementing Data Cubes E ciently

  1996cited by this paper
• The TSQL2 Temporal Query Language

  1995cited by this paper
• Computing temporal aggregates

  1995cited by this paper
• A transparent parallel I/O environment

  1994cited by this paper
• Aggregates in the Temporal Query Language TQuel

  1993cited by this paper
• Segment indexes: dynamic indexing techniques for multi-dimensional interval data

  1991cited by this paper
• Lower bounds for orthogonal range searching: part II. The arithmetic model

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

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

  1988cited by this paper
• On the Equivalence of Some Rectangle Problems

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

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

  year unknowninfluential reference
• The VLDB Journal c ○ Springer-Verlag 1996 An asymptotically optimal multiversion B-tree

  year unknowncited by this paper

• A Bouquet of Results on Maximum Range Sum: General Techniques and Hardness Reductions

  2025cites this paper
• Practical Insertion-Only Convex Hull

  2025cites this paper
• Efficient Concurrent Updates to Persistent Randomized Binary Search Trees

  2025cites this paper
• A top-k spatial join querying processing algorithm based on spark

  2020cites this paper
• An Efficient Top-k Spatial Join Query Processing Algorithm on Big Spatial Data

  2019cites this paper
• Orthogonal Point Location and Rectangle Stabbing Queries in 3-d

  2018cites this paper
• 41 RANGE SEARCHING

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

  2014cites this paper
• Dynamic cubing for hierarchical multidimensional data space

  2014cites this paper
• Range Aggregation With Set Selection

  2014cites this paper
• A General Technique for Top-$k$ Geometric Intersection Query Problems

  2014cites this paper
• Euler histogram tree: a spatial data structure for aggregate range queries on vehicle trajectories

  2014cites this paper
• Approximate MaxRS in Spatial Databases

  2013cites this paper
• Quality and efficiency for kernel density estimates in large data

  2013cites this paper
• ReputationPro: The Efficient Approaches to Contextual Transaction Trust Computation in E-Commerce Environments

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

  2013cites this paper
• A dynamic I/O-efficient structure for one-dimensional top-k range reporting

  2012cites this paper
• An I/O cost optimal and progressive algorithm for computing massive skyline points

  2012cites this paper
• Incrementally maintaining run-length encoded attributes in column stores

  2012influential citation
• Privacy-aware collection of aggregate spatial data

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

  2011influential citation
• Data structures for range-aggregate extent queries

  2008cites this paper
• Efficient temporal counting with bounded error

  2008influential citation
• On computing temporal aggregates with range predicates

  2008cites this paper
• STXXL: standard template library for XXL data sets

  2008cites this paper
• Interactive visual exploration of large relation data

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

  2008cites this paper
• Temporal Aggregation with Range Predicates

  2007cites this paper
• Methods for querying compressed wavefields

  2007cites this paper
• Algorithm engineering for large data sets

  2007cites this paper
• Processing count queries over event streams at multiple time granularities

  2006cites this paper
• Dual Labeling: Answering Graph Reachability Queries in Constant Time

  2006cites this paper
• Historical spatio-temporal aggregation

  2005cites this paper
• Range-Aggregate Query Problems Involving Geometric Aggregation Operations

  2005cites this paper
• Parallel ROLAP Indexing of Continuous Spaces

  2005cites this paper
• Top-k spatial joins

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

  2005cites this paper
• : Standard Template Library for XXL Data Sets

  2005cites this paper
• Range aggregate processing in spatial databases

  2004cites this paper
• Spatio-temporal aggregation using sketches

  2004cites this paper
• Approximate temporal aggregation

  2004cites this paper
• Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting

  2004cites this paper
• Categorical Range Queries in Large Databases

  2003cites this paper
• Categorical Range Queires in Large Databases

  2003cites this paper
• I/O-Efficient Structures for Orthogonal Range-Max and Stabbing-Max Queries

  2003cites this paper
• External Memory Geometric Data Structures

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

  2001cites this paper
• Range Searching

  1996cites this paper