Functional approach to data structures and its use in multidimensional searching
SIAM Journal on Computing
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
ACM Computing Surveys (CSUR)
Range queries in OLAP data cubes
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Cubetree: organization of and bulk incremental updates on the data cube
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
An array-based algorithm for simultaneous multidimensional aggregates
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Multidimensional access methods
ACM Computing Surveys (CSUR)
Data cube approximation and histograms via wavelets
Proceedings of the seventh international conference on Information and knowledge management
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
Compressed data cubes for OLAP aggregate query approximation on continuous dimensions
KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
Congressional samples for approximate answering of group-by queries
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Multidimensional divide-and-conquer
Communications of the ACM
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
External memory algorithms and data structures: dealing with massive data
ACM Computing Surveys (CSUR)
Design of Dynamic Data Structures
Design of Dynamic Data Structures
How to evaluate multiple range-sum queries progressively
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Temporal Aggregation over Data Streams Using Multiple Granularities
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Aggregate Processing of Planar Points
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Selectivity Estimation for Spatial Joins with Geometric Selections
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Incremental Computation and Maintenance of Temporal Aggregates
Proceedings of the 17th International Conference on Data Engineering
Hierarchical Prefix Cubes for Range-Sum Queries
VLDB '99 Proceedings of the 25th 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
On the Computation of Multidimensional Aggregates
VLDB '96 Proceedings of the 22th 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
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
pCube: Update-Efficient Online Aggregation with Progressive Feedback and Error Bounds
SSDBM '00 Proceedings of the 12th International Conference on Scientific and Statistical Database Management
Parallel Algorithms for Computing Temporal Aggregates
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
Scalable Algorithms for Large Temporal Aggregation
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Temporal and spatio-temporal aggregations over data streams using multiple time granularities
Information Systems - Special issue: Best papers from EDBT 2002
Journal of Computer Science and Technology
Querying about the Past, the Present, and the Future in Spatio-Temporal Databases
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Approximate Temporal Aggregation
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Spatio-Temporal Aggregation Using Sketches
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Spatio-temporal aggregates over raster image data
Proceedings of the 12th annual ACM international workshop on Geographic information systems
Range Aggregate Processing in Spatial Databases
IEEE Transactions on Knowledge and Data Engineering
Spatiotemporal Aggregate Computation: A Survey
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Knowledge and Data Engineering
Historical spatio-temporal aggregation
ACM Transactions on Information Systems (TOIS)
Optimizing spatial Min/Max aggregations
The VLDB Journal — The International Journal on Very Large Data Bases
Efficient trajectory joins using symbolic representations
Proceedings of the 6th international conference on Mobile data management
A Threshold-Based Algorithm for Continuous Monitoring of k Nearest Neighbors
IEEE Transactions on Knowledge and Data Engineering
Range-aggregate query problems involving geometric aggregation operations
Nordic Journal of Computing
Verifying Completeness of Relational Query Answers from Online Servers
ACM Transactions on Information and System Security (TISSEC)
On computing temporal aggregates with range predicates
ACM Transactions on Database Systems (TODS)
Efficient temporal counting with bounded error
The VLDB Journal — The International Journal on Very Large Data Bases
Continuous Spatiotemporal Trajectory Joins
GeoSensor Networks
Getting qualified answers for aggregate queries in spatio-temporal databases
APWeb/WAIM'07 Proceedings of the joint 9th Asia-Pacific web and 8th international conference on web-age information management conference on Advances in data and web management
Efficient traffic crash and snow complaint GIS system
Proceedings of the 12th Annual International Digital Government Research Conference: Digital Government Innovation in Challenging Times
Sequenced spatiotemporal aggregation for coarse query granularities
The VLDB Journal — The International Journal on Very Large Data Bases
Algorithms for range-aggregate query problems involving geometric aggregation operations
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Spatio-temporal aggregates over streaming geospatial image data
EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
Materialized views for count aggregates of spatial data
ADBIS'12 Proceedings of the 16th East European conference on Advances in Databases and Information Systems
Data structures for range-aggregate extent queries
Computational Geometry: Theory and Applications
Hi-index | 0.00 |
We examine the problem of efficiently computing sum/count/avg aggregates over objects with non-zero extent. Recent work on computing multi-dimensional aggregates has concentrated on objects with zero extent (points) on a multi-dimensional grid, or one-dimensional intervals. However, in many spatial and/or spatio-temporal applications objects have extent in various dimensions, while they can be located anywhere in the application space. The aggregation predicate is typically described by a multi-dimensional box (box-sum aggregation). We examine two variations of the problem. In the simple case an object's value contributes to the aggregation result as a whole as long as the object intersects the query box. More complex is the functional box-sum aggregation introduced in this paper, where objects participate in the aggregation proportionally to the size of their intersection with the query box. We first show that both problems can he reduced to dominance-sum queries. Traditionally dominance-sum queries are addressed in main memory by a static structure, the ECDF-tree. We then propose two extensions, namely the ECDF-B-trees, that make this structure disk-based and dynamic. Finally, we introduce the DA-tree that combines the advantages from each ECDF-B-tree. We run experiments comparing the performance of the ECDF-B-trees, the BA-tree and a traditional R*-tree (which has been augmented to include aggregation information on its index nodes) over spatial datasets. Our evaluation reaffirms that the BA-tree has more robust performance. Compared against the augmented R*-tree, the BA-tree offers drastic improvement in query performance at the expense of some limited extra space.