Data structures and algorithms 3: multi-dimensional searching and computational geometry
Data structures and algorithms 3: multi-dimensional searching and computational geometry
Adding range restriction capability to dynamic data structures
Journal of the ACM (JACM)
Space-time tradeoffs for orthogonal range queries
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Algorithms for clustering data
Algorithms for clustering data
Computing partial sums in multidimensional arrays
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
The design and analysis of spatial data structures
The design and analysis of spatial data structures
Lower bounds for orthogonal range searching: part II. The arithmetic model
Journal of the ACM (JACM)
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
Statistical and scientific databases
Statistical and scientific databases
Implementing data cubes efficiently
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
OLAP, relational, and multidimensional database systems
ACM SIGMOD Record
Partial-sum queries in OLAP data cubes using covering codes
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
ACM Computing Surveys (CSUR)
Data Structures for Range Searching
ACM Computing Surveys (CSUR)
Multidimensional divide-and-conquer
Communications of the ACM
TBSAM: An Access Method for Efficient Processing of Statistical Queries
IEEE Transactions on Knowledge and Data Engineering
On the Data Model and Access Method of Summary Data Management
IEEE Transactions on Knowledge and Data Engineering
Modeling Multidimensional Databases
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
ICDE '97 Proceedings of the Thirteenth International Conference on 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
Including Group-By in Query Optimization
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Aggregate-Query Processing in Data Warehousing Environments
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Eager Aggregation and Lazy Aggregation
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
SPRINT: A Scalable Parallel Classifier for Data Mining
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Storage Estimation for Multidimensional Aggregates in the Presence of Hierarchies
VLDB '96 Proceedings of the 22th 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
Partial-sum queries in OLAP data cubes using covering codes
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Dynamic assembly of views in data cubes
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Automatic subspace clustering of high dimensional data for data mining applications
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Wavelet-based histograms for selectivity estimation
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Data cube approximation and histograms via wavelets
Proceedings of the seventh international conference on Information and knowledge management
Partial-Sum Queries in OLAP Data Cubes Using Covering Codes
IEEE Transactions on Computers
Approximate computation of multidimensional aggregates of sparse data using wavelets
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Browsing large digital library collections using classification hierarchies
Proceedings of the eighth international conference on Information and knowledge management
An adaptive view element framework for multi-dimensional data management
Proceedings of the eighth international conference on Information and knowledge management
Multidimensional Index Structures in Relational Databases
Journal of Intelligent Information Systems - Data warehousing and knowledge discovery
Using wavelet decomposition to support progressive and approximate range-sum queries over data cubes
Proceedings of the ninth international conference on Information and knowledge management
Applying the golden rule of sampling for query estimation
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Improving min/max aggregation over spatial objects
Proceedings of the 9th ACM international symposium on Advances in geographic information systems
Efficient aggregation over objects with extent
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
How to evaluate multiple range-sum queries progressively
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
Analysis of pre-computed partition top method for range top-k queries in OLAP data cubes
Proceedings of the eleventh international conference on Information and knowledge management
The RD-Tree: a structure for processing partial-MAX/MIN Queries in OLAP
Information Sciences—Applications: An International Journal
View Maintenance and Analytical Processing at Data Warehouses
DNIS '00 Proceedings of the International Workshop on Databases in Networked Information Systems
EDBT '00 Proceedings of the 7th International Conference on Extending Database Technology: Advances in Database Technology
ProPolyne: A Fast Wavelet-Based Algorithm for Progressive Evaluation of Polynomial Range-Sum Queries
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Orthogonal Range Queries in OLAP
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Optimal Range Max Datacube for Fixed Dimensions
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Hierarchical Prefix Cubes for Range-Sum Queries
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Hierarchical Compact Cube for Range-Max Queries
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
A Data Warehousing Architecture for Enabling Service Provisioning Process
Proceedings of the 27th 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
Querying and Clustering Very Large Data Sets Using Dynamic Bucketing Approach
WAIM '02 Proceedings of the Third International Conference on Advances in Web-Age Information Management
Compressed Datacubes for fast OLAP Applications
DaWaK '99 Proceedings of the First International Conference on Data Warehousing and Knowledge Discovery
Implementation of Multidimensional Index Structures for Knowledge Discovery in Relational Databases
DaWaK '99 Proceedings of the First International Conference on Data Warehousing and Knowledge Discovery
Space-Efficient Data Cubes for Dynamic Environments
DaWaK 2000 Proceedings of the Second International Conference on Data Warehousing and Knowledge Discovery
Efficient Execution of Range-Aggregate Queries in Data Warehouse Environments
ER '01 Proceedings of the 20th International Conference on Conceptual Modeling: Conceptual Modeling
PODDP '98 Proceedings of the 4th International Workshop on Principles of Digital Document Processing
DROLAP - A Dense-Region Based Approach to On-Line Analytical Processing
DEXA '99 Proceedings of the 10th International Conference on Database and Expert Systems Applications
Range-Max/Min Query in OLAP Data Cube
DEXA '00 Proceedings of the 11th International Conference on Database and Expert Systems Applications
View Selection in OLAP Environment
DEXA '00 Proceedings of the 11th International Conference on Database and Expert Systems Applications
Range Top/Bottom k Queries in OLAP Sparse Data Cubes
DEXA '01 Proceedings of the 12th International Conference on Database and Expert Systems Applications
Adaptive Method for Range Top- k Queries in OLAP Data Cubes
DEXA '02 Proceedings of the 13th International Conference on Database and Expert Systems Applications
Variable Sized Partitions for Range Query Algorithms
DEXA '02 Proceedings of the 13th International Conference on Database and Expert Systems Applications
Flexible Data Cubes for Online Aggregation
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Managing and analyzing massive data sets with data cubes
Handbook of massive data sets
Handbook of massive data sets
Wavelet-based relative prefix sum methods for range sum queries in data cubes
CASCON '02 Proceedings of the 2002 conference of the Centre for Advanced Studies on Collaborative research
Dynamic orthogonal range queries in OLAP
Theoretical Computer Science - Database theory
Multi-resolution algorithms for building spatial histograms
ADC '03 Proceedings of the 14th Australasian database conference - Volume 17
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
Transmitting Datacubes over Congested Networks
ITCC '00 Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00)
Dynamic multidimensional data cubes
Multidimensional databases
Incremental computation and maintenance of temporal aggregates
The VLDB Journal — The International Journal on Very Large Data Bases
A Wavelet Framework for Adapting Data Cube Views for OLAP
IEEE Transactions on Knowledge and Data Engineering
Evaluating holistic aggregators efficiently for very large datasets
The VLDB Journal — The International Journal on Very Large Data Bases
Space-efficient cubes for OLAP range-sum queries
Decision Support Systems
Arranging fact table records in a data warehouse to improve query performance
Computers and Operations Research
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
A compression method for prefix-sum cubes
Information Processing Letters
Divide-and-Approximate: A Novel Constraint Push Strategy for Iceberg Cube Mining
IEEE Transactions on Knowledge and Data Engineering
Wire length as a circuit complexity measure
Journal of Computer and System Sciences
Optimizing spatial Min/Max aggregations
The VLDB Journal — The International Journal on Very Large Data Bases
Automatic Subspace Clustering of High Dimensional Data
Data Mining and Knowledge Discovery
Proceedings of the 8th ACM international workshop on Data warehousing and OLAP
Integrating DCT and DWT for approximating cube streams
Proceedings of the 14th ACM international conference on Information and knowledge management
Improving range-sum query evaluation on data cubes via polynomial approximation
Data & Knowledge Engineering
Exploring spatial datasets with histograms
Distributed and Parallel Databases
Summarizing level-two topological relations in large spatial datasets
ACM Transactions on Database Systems (TODS)
DADA: a data cube for dominant relationship analysis
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Parallel data cube storage structure for range sum queries and dynamic updates
Journal of Computer Science and Technology
Spatio-temporal data warehouses using an adaptive cell-based approach
Data & Knowledge Engineering
Histogram-by: A grouping operator for continuous domains
Data & Knowledge Engineering
Extending the data warehouse for service provisioning data
Data & Knowledge Engineering - Special issue: ER 2003
Approximate range---sum query answering on data cubes with probabilistic guarantees
Journal of Intelligent Information Systems
An OLAP system for network-constrained moving objects
Proceedings of the 2007 ACM symposium on Applied computing
Progressive ranking of range aggregates
Data & Knowledge Engineering
Exploiting versions for on-line data warehouse maintenance in MOLAP servers
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Approximate Query Processing in Cube Streams
IEEE Transactions on Knowledge and Data Engineering
Multiscale histograms: summarizing topological relations in large spatial datasets
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Hierarchical bin buffering: Online local moments for dynamic external memory arrays
ACM Transactions on Algorithms (TALG)
Verifying Completeness of Relational Query Answers from Online Servers
ACM Transactions on Information and System Security (TISSEC)
Histograms based on the minimum description length principle
The VLDB Journal — The International Journal on Very Large Data Bases
Parity-based inference control for multi-dimensional range sum queries
Journal of Computer Security
DAWN: an efficient framework of DCT for data with error estimation
The VLDB Journal — The International Journal on Very Large Data Bases
Efficient temporal counting with bounded error
The VLDB Journal — The International Journal on Very Large Data Bases
Plot Query Processing with Wavelets
SSDBM '08 Proceedings of the 20th international conference on Scientific and Statistical Database Management
A Temporal Dominant Relationship Analysis Method
ADMA '08 Proceedings of the 4th international conference on Advanced Data Mining and Applications
Approximate Range-Sum Queries over Data Cubes Using Cosine Transform
DEXA '08 Proceedings of the 19th international conference on Database and Expert Systems Applications
A Robust Sampling-Based Framework for Privacy Preserving OLAP
DaWaK '08 Proceedings of the 10th international conference on Data Warehousing and Knowledge Discovery
Experimenting the Query Performance of a Grid-Based Sensor Network Data Warehouse
Globe '08 Proceedings of the 1st international conference on Data Management in Grid and Peer-to-Peer Systems
Multiple-Objective Compression of Data Cubes in Cooperative OLAP Environments
ADBIS '08 Proceedings of the 12th East European conference on Advances in Databases and Information Systems
H-IQTS: a semantics-aware histogram for compressing categorical OLAP data
IDEAS '08 Proceedings of the 2008 international symposium on Database engineering & applications
Data Transformation Services over Grids with Real-Time Bound Constraints
OTM '08 Proceedings of the OTM 2008 Confederated International Conferences, CoopIS, DOA, GADA, IS, and ODBASE 2008. Part I on On the Move to Meaningful Internet Systems:
Efficient data structures for range-aggregate queries on trees
Proceedings of the 12th International Conference on Database Theory
Supporting asynchronous update for distributed data cubes
Journal of Network and Computer Applications
Multidimensional data structures and techniques for efficient decision making
MCBE'09 Proceedings of the 10th WSEAS international conference on Mathematics and computers in business and economics
Enabling OLAP in mobile environments via intelligent data cube compression techniques
Journal of Intelligent Information Systems
Efficient Online Aggregates in Dense-Region-Based Data Cube Representations
DaWaK '09 Proceedings of the 11th International Conference on Data Warehousing and Knowledge Discovery
Region-based online promotion analysis
Proceedings of the 13th International Conference on Extending Database Technology
Journal of Intelligent Information Systems
A secure multiparty computation privacy preserving OLAP framework over distributed XML data
Proceedings of the 2010 ACM Symposium on Applied Computing
Approximate aggregate queries with guaranteed error bounds
RSFDGrC'03 Proceedings of the 9th international conference on Rough sets, fuzzy sets, data mining, and granular computing
ISMIS'08 Proceedings of the 17th international conference on Foundations of intelligent systems
Event-based lossy compression for effective and efficient OLAP over data streams
Data & Knowledge Engineering
Index structures for data warehouses
Index structures for data warehouses
International Journal of Wireless and Mobile Computing
Authenticated Index Structures for Aggregation Queries
ACM Transactions on Information and System Security (TISSEC)
ADBIS'10 Proceedings of the 14th east European conference on Advances in databases and information systems
Efficient online aggregates in dense-region-based data cube representations
Transactions on large-scale data- and knowledge-centered systems II
Efficient online aggregates in dense-region-based data cube representations
Transactions on large-scale data- and knowledge-centered systems II
Context-sensitive ranking for document retrieval
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Journal of Computer and System Sciences
Summarizing spatial relations – a hybrid histogram
APWeb'05 Proceedings of the 7th Asia-Pacific web conference on Web Technologies Research and Development
Processing multiple aggregation queries in geo-sensor networks
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
An efficient algorithm for computing range-groupby queries
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
Ag-Tree: a novel structure for range queries in data warehouse environments
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
DaWaK'06 Proceedings of the 8th international conference on Data Warehousing and Knowledge Discovery
An effective algorithm to extract dense sub-cubes from a large sparse cube
DaWaK'06 Proceedings of the 8th international conference on Data Warehousing and Knowledge Discovery
Progressive ranking of range aggregates
DaWaK'05 Proceedings of the 7th international conference on Data Warehousing and Knowledge Discovery
Exploiting temporal correlation in temporal data warehouses
DASFAA'05 Proceedings of the 10th international conference on Database Systems for Advanced Applications
Spatio-temporal aggregates over streaming geospatial image data
EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
Non-linear data stream compression: foundations and theoretical results
HAIS'12 Proceedings of the 7th international conference on Hybrid Artificial Intelligent Systems - Volume Part I
Proceedings of the VLDB Endowment
Incrementally maintaining run-length encoded attributes in column stores
Proceedings of the 16th International Database Engineering & Applications Sysmposium
DaWaK'07 Proceedings of the 9th international conference on Data Warehousing and Knowledge Discovery
Exploiting data access for dynamic fragmentation in data warehouse
International Journal of Intelligent Information and Database Systems
Optimal splitters for temporal and multi-version databases
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Quality and efficiency for kernel density estimates in large data
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
| Hi-index | 0.00 |
A range query applies an aggregation operation over all selected cells of an OLAP data cube where the selection is specified by providing ranges of values for numeric dimensions. We present fast algorithms for range queries for two types of aggregation operations: SUM and MAX. These two operations cover techniques required for most popular aggregation operations, such as those supported by SQL.For range-sum queries, the essential idea is to precompute some auxiliary information (prefix sums) that is used to answer ad hoc queries at run-time. By maintaining auxiliary information which is of the same size as the data cube, all range queries for a given cube can be answered in constant time, irrespective of the size of the sub-cube circumscribed by a query. Alternatively, one can keep auxiliary information which is 1/bd of the size of the d-dimensional data cube. Response to a range query may now require access to some cells of the data cube in addition to the access to the auxiliary information, but the overall time complexity is typically reduced significantly. We also discuss how the precomputed information is incrementally updated by batching updates to the data cube. Finally, we present algorithms for choosing the subset of the data cube dimensions for which the auxiliary information is computed and the blocking factor to use for each such subset.Our approach to answering range-max queries is based on precomputed max over balanced hierarchical tree structures. We use a branch-and-bound-like procedure to speed up the finding of max in a region. We also show that with a branch-and-bound procedure, the average-case complexity is much smaller than the worst-case complexity.