Range aggregate processing in spatial databases

No abstract is available for this paper.

• Publication year

  2004

• Venue

  IEEE Transactions on Knowledge and Data Engineering

• Publication date

  2004-12-01

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1109/TKDE.2004.93
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Mobiscope: A Scalable Spatial Discovery Service for Mobile Network Resources

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

  2003cited by this paper
• CRB-Tree: An Efficient Indexing Scheme for Range-Aggregate Queries

  2003cited by this paper
• Efficient aggregation over objects with extent

  2002cited by this paper
• Efficient integration and aggregation of historical information

  2002cited by this paper
• Cost models for overlapping and multiversion structures

  2002cited by this paper
• Dynamic Update Cube for Range-sum Queries

  2001cited by this paper
• MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries

  2001cited by this paper
• Progressive approximate aggregate queries with a multi-resolution tree structure

  2001cited by this paper
• Indexing Animated Objects Using Spatiotemporal Access Methods

  2001cited by this paper
• External Memory Data Structures

  2001cited by this paper
• Efficient OLAP Operations in Spatial Data Warehouses

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

  2001cited by this paper
• Approximating multi-dimensional aggregate range queries over real attributes

  2000cited by this paper
• PISA: Performance models for Index Structures with and without Aggregated data

  1999influential reference
• Comparison of access methods for time-evolving data

  1999cited by this paper
• Selectivity estimation in spatial databases

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

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

  1999cited by this paper
• Indexing Animated Objects

  1999cited by this paper
• Relative prefix sums: an efficient approach for querying dynamic OLAP data cubes

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

  1999cited by this paper
• Designing Access Methods for Bitemporal Databases

  1998cited by this paper
• The R/sub a/*-tree: an improved R*-tree with materialized data for supporting range queries on OLAP-data

  1998cited by this paper
• NATIONAL CENTER FOR GEOGRAPHIC INFORMATION AND ANALYSIS

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

  1997cited by this paper
• Selectivity Estimation Without the Attribute Value Independence Assumption

  1997cited by this paper
• A Generic Approach to Bulk Loading Multidimensional Index Structures

  1997cited by this paper
• An Efficient Multiversion Access STructure

  1997cited by this paper
• A model for the prediction of R-tree performance

  1996cited by this paper
• Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals

  1996cited by this paper
• Estimating the Selectivity of Spatial Queries Using the 'Correlation' Fractal Dimension

  1995cited by this paper
• The Buffer Tree: A New Technique for Optimal I/O-Algorithms (Extended Abstract)

  1995cited by this paper
• Access Methods for Bi-Temporal Databases

  1995influential reference
• Beyond uniformity and independence: analysis of R-trees using the concept of fractal dimension

  1994influential reference
• On packing R-trees

  1993cited by this paper
• The R*-tree: an efficient and robust access method for points and rectangles

  1990cited by this paper
• Equi-depth multidimensional histograms

  1988cited by this paper
• Faloutsos: "the r+- tree: a dynamic index for multidimensional objects

  1987cited by this paper
• The R+-Tree: A Dynamic Index for Multi-Dimensional Objects

  1987cited by this paper
• Making data structures persistent

  1986cited by this paper
• R-trees: a dynamic index structure for spatial searching

  1984cited by this paper
• On random 2–3 trees

  1978cited by this paper
• The VLDB Journal c ○ Springer-Verlag 1996 An asymptotically optimal multiversion B-tree

  year unknowninfluential reference
• A Comparison of Access Methods for Temporal Data Title a Comparison of Access Methods for Temporal Data Individual Participants

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

  year unknowncited by this paper

• Efficient Concurrent Updates to Persistent Randomized Binary Search Trees

  2025cites this paper
• Maximizing the Optimality Streak of Deferred Data Structuring (a.k.a. Database Cracking)

  2025cites this paper
• Efficient Approximate Range Aggregation Over Large-Scale Spatial Data Federation

  2023influential citation
• Aggregating over Dominated Points by Sorting, Scanning, Zip and Flat Maps

  2023cites this paper
• Efficient Approximate Range Aggregation over Large-scale Spatial Data Federation (Extended Abstract)

  2022cites this paper
• Bit-Oriented Sampling for Aggregation on Big Data

  2021cites this paper
• Estimating the Size of Union of Sets in Streaming Models

  2021cites this paper
• DARS: Diversity and Distribution-Aware Region Search

  2020cites this paper
• Conditional MaxRS Query for Evolving Spatial Data

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

  2020cites this paper
• Finding Most Popular Indoor Semantic Locations Using Uncertain Mobility Data

  2019influential citation
• An Efficient Top-k Spatial Join Query Processing Algorithm on Big Spatial Data

  2019cites this paper
• Finding Most Popular Indoor Semantic Locations Using Uncertain Mobility Data

  2019cites this paper
• Monitoring best region in spatial data streams in road networks

  2019cites this paper
• Spatiotemporal Data Warehouses

  2018cites this paper
• Searching for the closest-pair in a query translate

  2018cites this paper
• Colored range closest-pair problem under general distance functions

  2018cites this paper
• Recommendation in location-based social networks based on spatio-temporal data

  2017cites this paper
• Class-based Conditional MaxRS Query in Spatial Data Streams

  2017cites this paper
• Approximate Geometric MST Range Queries

  2015cites this paper
• An Efficient Index Structure for Range Count Query Based on Improved B-tree

  2015cites this paper
• Space Reduction for Contextual Transaction Trust Computation in E-Commerce and E-Service Environments

  2015cites this paper
• Finding top-k relevant groups of spatial web objects

  2015cites this paper
• K-Nearest Neighbor Temporal Aggregate Queries

  2015cites this paper
• Range Aggregation With Set Selection

  2014cites this paper
• The approaches to contextual transaction trust computation in e-Commerce environments

  2014cites this paper
• Context-aware transaction trust computation in e-commerce environments

  2014influential citation
• Euler histogram tree: a spatial data structure for aggregate range queries on vehicle trajectories

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

  2014cites this paper
• A Database Perspective on Large Scale High-Dimensional Indexing

  2014cites this paper
• A Novel Model for Contextual Transaction Trust Computation with Fixed Storage Space in E-Commerce and E-Service Environments

  2013cites this paper
• Efficient external memory structures for range-aggregate queries

  2013influential citation
• 2 8 N ov 2 01 3 ReputationPro : The Efficient Approaches to CTT Computation in E-Commerce Environments

  2013influential citation
• Efficient Range Reporting of Convex Hull

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

  2013influential citation
• Range-Aggregate Queries for Geometric Extent Problems

  2013cites this paper
• Algorithms for continuous queries: A geometric approach

  2013cites this paper
• Algorithm for Processing k-Nearest Join Based on R-Tree in MapReduce

  2013cites this paper
• A Spatial Database Index Method Based on Doubletree Structure

  2013cites this paper
• Colored top-K range-aggregate queries

  2013cites this paper
• Rectangle-efficient aggregation in spatial data streams

  2012influential citation
• Stochastic skylines

  2012cites this paper
• Processing and Notifying Range Top-k Subscriptions

  2012cites this paper
• Top-K range-aggregate queries on categorical data

  2012cites this paper
• Multidimensional Analysis of Atypical Events in Cyber-Physical Data

  2012cites this paper
• Efficient Contextual Transaction Trust Computation in E-commerce Environments

  2012cites this paper
• Multidimensional Sensor Data Analysis in Cyber-Physical System: An Atypical Cube Approach

  2012cites this paper
• Cyber Physical Systems Using Sensor Technologies

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

  2012cites this paper
• MRFM: An Efficient Approach to Spatial Join Aggregate

  2012cites this paper
• Efficient Computation of Range Aggregates against Uncertain Location-Based Queries

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

  2011cites this paper
• Computational Methods for Spatial OLAP

  2011cites this paper
• Privacy-aware collection of aggregate spatial data

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

  2011cites this paper
• Range-Aggregate Queries Involving Geometric Aggregation Operations

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

  2011influential citation
• Stochastic skyline operator

  2011influential citation
• Data Structures for Range-Aggregation over Categories

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

  2010cites this paper
• Authenticated Index Structures for Aggregation Queries

  2010cites this paper
• Selection of Structures with Grid Optimization, in Multiagent Data Warehouse

  2010cites this paper
• Zaawansowane hurtownie danych

  2009cites this paper
• On the power of the semi-separated pair decomposition

  2009cites this paper
• Self-tuning management of update-intensive multidimensional data in clusters of workstations

  2009cites this paper
• Probabilistic Threshold Range Aggregate Query Processing over Uncertain Data

  2009influential citation
• Spatio-Temporal Data Warehouses

  2009cites this paper
• Safety and Domain Independence

  2009cites this paper
• Data Structures for Range Aggregation by Categories

  2009cites this paper
• Tree-based partition querying: a methodology for computing medoids in large spatial datasets

  2008influential citation
• STAH-TREE: Quality Tests of Hybrid Index for Spatio-Temporal Aggregation

  2008cites this paper
• Handbook of Database Security - Applications and Trends

  2008cites this paper
• Multi-Dimensional Grid-Based Clustering of Fuzzy Query Results

  2008cites this paper
• On computing temporal aggregates with range predicates

  2008cites this paper
• Concurrency Control in Distributed MRA Index Structure

  2008cites this paper
• Query and data security in the data outsourcing model

  2008cites this paper
• Data structures for range-aggregate extent queries

  2008cites this paper
• Clustering spatial networks for aggregate query processing: A hypergraph approach

  2008cites this paper
• Aggregate similarity queries in relevance feedback methods for content-based image retrieval

  2008cites this paper
• Modified R-MVB Tree and BTV Algorithm Used in a Distributed Spatio-temporal Data Warehouse

  2007influential citation
• Selection of Indexing Structures in Grid Data Warehouses with Software Agents

  2007cites this paper
• STAH-TREE: Hybrid index for spatio temporal aggregation

  2007cites this paper
• Range-Aggregate Proximity Queries

  2007cites this paper
• Effective Density Queries on ContinuouslyMoving Objects

  2006cites this paper
• Predicted Range Aggregate Processing in Spatio-temporal Databases

  2006cites this paper
• Dynamic authenticated index structures for outsourced databases

  2006cites this paper
• Additively Weighted Voronoi Diagrams for Optimal Sequenced Route Queries

  2006cites this paper
• Spatio-temporal Aggregates over Streaming Geospatial Image Data

  2006cites this paper
• Materialized aR-Tree in Distributed Spatial Data Warehouse

  2006cites this paper
• Range-Aggregate Proximity Detection for Design Rule Checking in VLSI Layouts

  2006cites this paper
• Top-k spatial joins

  2005cites this paper
• Architecture of Parallel Spatial Data Warehouse: Balancing Algorithm and Resumption of Data Extraction

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

  2005influential citation
• Parallel ROLAP Indexing of Continuous Spaces

  2005cites this paper
• Aggregation and Analysis of Spatial Data by Means of Materialized Aggregation Tree

  2004cites this paper