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
Range queries in OLAP data cubes
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Range queries in dynamic OLAP data cubes
Data & Knowledge Engineering
Data Warehousing, Data Mining, and Olap
Data Warehousing, Data Mining, and Olap
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
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
The X-tree: An Index Structure for High-Dimensional Data
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Relative Prefix Sums: An Efficient Approach for Querying Dynamic OLAP Data Cubes
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
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
Optimal Range Max Datacube for Fixed Dimensions
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Space-efficient cubes for OLAP range-sum queries
Decision Support 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
A compression method for prefix-sum cubes
Information Processing Letters
Optimizing spatial Min/Max aggregations
The VLDB Journal — The International Journal on Very Large Data Bases
Parallel data cube storage structure for range sum queries and dynamic updates
Journal of Computer Science and Technology
Verifying Completeness of Relational Query Answers from Online Servers
ACM Transactions on Information and System Security (TISSEC)
Efficient temporal counting with bounded error
The VLDB Journal — The International Journal on Very Large Data Bases
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
What-if analysis in MOLAP environments
FSKD'09 Proceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 2
Summarizing spatial relations – a hybrid histogram
APWeb'05 Proceedings of the 7th Asia-Pacific web conference on Web Technologies Research and Development
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
| Hi-index | 0.00 |