Dynamic orthogonal range queries in OLAP.
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2080483
- Range queries in dynamic OLAP data cubes
- New Data Structures for Orthogonal Range Queries
- Efficient OLAP query processing in distributed data warehouses.
- scientific article; zbMATH DE number 1756663
- scientific article; zbMATH DE number 1756676
- scientific article; zbMATH DE number 1945878
Cites work
- scientific article; zbMATH DE number 2080471 (Why is no real title available?)
- scientific article; zbMATH DE number 2080483 (Why is no real title available?)
- A Functional Approach to Data Structures and Its Use in Multidimensional Searching
- A Lower Bound on the Complexity of Orthogonal Range Queries
- A unifying look at data structures
- Adding range restriction capability to dynamic data structures
- Efficiency of a Good But Not Linear Set Union Algorithm
- Efficient dynamic range searching using data replication
- Efficient worst-case data structures for range searching
- Fast Algorithms for Finding Nearest Common Ancestors
- Filtering Search: A New Approach to Query-Answering
- Lower bounds for orthogonal range searching: I. The reporting case
- Lower bounds for orthogonal range searching: part II. The arithmetic model
- Multidimensional binary search trees used for associative searching
- Multidimensional divide-and-conquer
- New Data Structures for Orthogonal Range Queries
- On the Complexity of Maintaining Partial Sums
- Optimal Retrieval Algorithms for Small Region Queries
- Partial-sum queries in OLAP data cubes using covering codes
- Quad trees: A data structure for retrieval by composite keys
- Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees
Cited in
(10)- The RD-tree: A structure for processing Partial-MAX/MIN queries in OLAP
- OPTIMAL RANGE MAX DATACUBE FOR FIXED DIMENSIONS
- Array range queries
- On space efficient two dimensional range minimum data structures
- scientific article; zbMATH DE number 1945878 (Why is no real title available?)
- scientific article; zbMATH DE number 2080471 (Why is no real title available?)
- scientific article; zbMATH DE number 2080483 (Why is no real title available?)
- scientific article; zbMATH DE number 1756663 (Why is no real title available?)
- Opportunistic data structures for range queries
- Online aggregation on data cubes without auxiliary information
This page was built for publication: Dynamic orthogonal range queries in OLAP.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1401285)
