Equi-depth multidimensional histograms
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Making data structures persistent
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
CIKM '93 Proceedings of the second international conference on Information and knowledge management
Beyond uniformity and independence: analysis of R-trees using the concept of fractal dimension
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A model for the prediction of R-tree performance
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Range queries in OLAP data cubes
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Selectivity estimation in spatial databases
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Approximate computation of multidimensional aggregates of sparse data using wavelets
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Comparison of access methods for time-evolving data
ACM Computing Surveys (CSUR)
Approximating multi-dimensional aggregate range queries over real attributes
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
I/O-efficient dynamic planar point location (extended abstract)
Proceedings of the sixteenth annual symposium on Computational geometry
Efficient computation of temporal aggregates with range predicates
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Progressive approximate aggregate queries with a multi-resolution tree structure
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Efficient aggregation over objects with extent
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient integration and aggregation of historical information
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Cost models for overlapping and multiversion structures
ACM Transactions on Database Systems (TODS)
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
An Efficient Multiversion Access Structure
IEEE Transactions on Knowledge and Data Engineering
Designing Access Methods for Bitemporal Databases
IEEE Transactions on Knowledge and Data Engineering
Indexing Animated Objects Using Spatiotemporal Access Methods
IEEE Transactions on Knowledge and Data Engineering
Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Total
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Incremental Computation and Maintenance of Temporal Aggregates
Proceedings of the 17th International Conference on Data Engineering
CRB-Tree: An Efficient Indexing Scheme for Range-Aggregate Queries
ICDT '03 Proceedings of the 9th International Conference on Database Theory
A Generic Approach to Bulk Loading Multidimensional Index Structures
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Hierarchical Prefix Cubes for Range-Sum Queries
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Dynamic Update Cube for Range-sum Queries
Proceedings of the 27th International Conference on Very Large Data Bases
MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries
Proceedings of the 27th International Conference on Very Large Data Bases
The Buffer Tree: A New Technique for Optimal I/O-Algorithms (Extended Abstract)
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Estimating the Selectivity of Spatial Queries Using the `Correlation' Fractal Dimension
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Selectivity Estimation Without the Attribute Value Independence Assumption
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Efficient OLAP Operations in Spatial Data Warehouses
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Mobiscope: A Scalable Spatial Discovery Service for Mobile Network Resources
MDM '03 Proceedings of the 4th International Conference on Mobile Data Management
An asymptotically optimal multiversion B-tree
The VLDB Journal — The International Journal on Very Large Data Bases
External memory data structures
Handbook of massive data sets
The R-tree: An Improved R*-tree with Materialized Data for Supporting Range Queries on OLAP-Data
DEXA '98 Proceedings of the 9th International Workshop on Database and Expert Systems Applications
PISA: Performance Models for Index Structures with and without Aggregated Data
SSDBM '99 Proceedings of the 11th International Conference on Scientific and Statistical Database Management
IEEE Transactions on Knowledge and Data Engineering
Range-aggregate query problems involving geometric aggregation operations
Nordic Journal of Computing
Aggregate similarity queries in relevance feedback methods for content-based image retrieval
Proceedings of the 2008 ACM symposium on Applied computing
On computing temporal aggregates with range predicates
ACM Transactions on Database Systems (TODS)
Tree-based partition querying: a methodology for computing medoids in large spatial datasets
The VLDB Journal — The International Journal on Very Large Data Bases
Probabilistic Threshold Range Aggregate Query Processing over Uncertain Data
APWeb/WAIM '09 Proceedings of the Joint International Conferences on Advances in Data and Web Management
Self-tuning management of update-intensive multidimensional data in clusters of workstations
The VLDB Journal — The International Journal on Very Large Data Bases
Proceedings of the 2005 conference on Software Engineering: Evolution and Emerging Technologies
STAH-TREE: Quality Tests of Hybrid Index for Spatio-Temporal Aggregation
Proceedings of the 2008 conference on New Trends in Multimedia and Network Information Systems
On the Power of the Semi-Separated Pair Decomposition
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Materialized aR-Tree in Distributed Spatial Data Warehouse
Intelligent Data Analysis - Analysis of Symbolic and Spatial Data
Modified R-MVB tree and BTV algorithm used in a distributed spatio-temporal data warehouse
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Authenticated Index Structures for Aggregation Queries
ACM Transactions on Information and System Security (TISSEC)
Selection of structures with grid optimization, in multiagent data warehouse
IDEAL'10 Proceedings of the 11th international conference on Intelligent data engineering and automated learning
Efficient top-k queries for orthogonal ranges
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Range-aggregate queries involving geometric aggregation operations
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Privacy-aware collection of aggregate spatial data
Data & Knowledge Engineering
New results on two-dimensional orthogonal range aggregation in external memory
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Aggregation and analysis of spatial data by means of materialized aggregation tree
ADVIS'04 Proceedings of the Third international conference on Advances in Information Systems
Algorithms for range-aggregate query problems involving geometric aggregation operations
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
ACM Transactions on Database Systems (TODS)
Rectangle-efficient aggregation in spatial data streams
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Efficient external memory structures for range-aggregate queries
Computational Geometry: Theory and Applications
On the power of the semi-separated pair decomposition
Computational Geometry: Theory and Applications
Range-aggregate queries for geometric extent problems
CATS '13 Proceedings of the Nineteenth Computing: The Australasian Theory Symposium - Volume 141
Colored top-K range-aggregate queries
Information Processing Letters
Data structures for range-aggregate extent queries
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
A range aggregate query returns summarized information about the points falling in a hyper-rectangle (e.g., the total number of these points instead of their concrete ids). This paper studies spatial indexes that solve such queries efficiently and proposes the aggregate Point-tree (aP-tree), which achieves logarithmic cost to the data set cardinality (independently of the query size) for two-dimensional data. The aP-tree requires only small modifications to the popular multiversion structural framework and, thus, can be implemented and applied easily in practice. We also present models that accurately predict the space consumption and query cost of the aP-tree and are therefore suitable for query optimization. Extensive experiments confirm that the proposed methods are efficient and practical.