Expressions for batched searching of sequential and hierarchical files
ACM Transactions on Database Systems (TODS)
The BANG file: A new kind of grid file
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Comments on batched searching of sequential and tree-structured files
ACM Transactions on Database Systems (TODS)
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The Grid File: An Adaptable, Symmetric Multikey File Structure
ACM Transactions on Database Systems (TODS)
A unifying model of physical databases
ACM Transactions on Database Systems (TODS)
Differential files: their application to the maintenance of large databases
ACM Transactions on Database Systems (TODS)
Batched searching of sequential and tree structured files
ACM Transactions on Database Systems (TODS)
Equivalence of Relational Algebra and Relational Calculus Query Languages Having Aggregate Functions
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
The Quadtree and Related Hierarchical Data Structures
ACM Computing Surveys (CSUR)
Operating system support for database management
Communications of the ACM
Approximating block accesses in database organizations
Communications of the ACM
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Efficient Algorithms for Maintenance of Large Database
Proceedings of the Fourth International Conference on Data Engineering
Simple Random Sampling from Relational Databases
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
A Mechanism for Managing the Buffer Pool in a Relational Database System Using the Hot Set Model
VLDB '82 Proceedings of the 8th International Conference on Very Large Data Bases
Statistical Databases: Characteristics, Problems, and some Solutions
VLDB '82 Proceedings of the 8th International Conference on Very Large Data Bases
Physical database support for scientific and statistical database management
SSDBM'86 Proceedings of the 3rd international workshop on Statistical and scientific database management
Range queries in OLAP data cubes
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
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
Partial-Sum Queries in OLAP Data Cubes Using Covering Codes
IEEE Transactions on Computers
CubiST: a new algorithm for improving the performance of ad-hoc OLAP queries
Proceedings of the 3rd ACM international workshop on Data warehousing and OLAP
Efficient Aggregation Algorithms for Compressed Data Warehouses
IEEE Transactions on Knowledge and Data Engineering
Aggregation Algorithms for Very Large Compressed Data Warehouses
VLDB '99 Proceedings of the 25th 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
CubiST++: Evaluating Ad-Hoc CUBE Queries Using Statistics Trees
Distributed and Parallel Databases
A physical storage for efficient statistical query processing
SSDBM'1994 Proceedings of the 7th international conference on Scientific and Statistical Database Management
Index structures for data warehouses
Index structures for data warehouses
| Hi-index | 0.00 |
The domain of statistical and scientific databases is targeted here, and the class of aggregate queries which are very often encountered in this domain is considered. Such a query is aimed at retrieving some aggregate characteristics of the raw data. The tree-based statistics access method (TBSAM), which provides support for the efficient processing of aggregate queries, is presented. It is related to the B/sup tree and also processes the B/sup tree's efficient update properties. Complementing TBSAM is the provision of a grouped update algorithm for minimizing expensive indexed database updates.