Data structures and algorithms 3: multi-dimensional searching and computational geometry
Data structures and algorithms 3: multi-dimensional searching and computational geometry
Lower bounds for dynamic range query problems that permit subtraction
International Colloquium on Automata, Languages and Programming on Automata, languages and programming
Space-time tradeoffs for orthogonal range queries
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Lower bounds for orthogonal range searching: I. The reporting case
Journal of the ACM (JACM)
On the Average Number of Maxima in a Set of Vectors and Applications
Journal of the ACM (JACM)
A Lower Bound on the Complexity of Orthogonal Range Queries
Journal of the ACM (JACM)
Design of Dynamic Data Structures
Design of Dynamic Data Structures
Space-time tradeoff for answering range queries (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
On determinism versus non-determinism and related problems
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Applications of the fusion tree method to computational geometry and searching
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
How hard is halfspace range searching?
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Dominance range-query: the one-reporting case
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Can visibility graphs be represented compactly?
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Lower bounds for union-split-find related problems on random access machines
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
ACM Computing Surveys (CSUR)
Lower bounds for off-line range searching
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Range queries in OLAP data cubes
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Fast and scalable layer four switching
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
On a model of indexability and its bounds for range queries
Journal of the ACM (JACM)
Sublinear-time approximation of Euclidean minimum spanning tree
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
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
CRB-Tree: An Efficient Indexing Scheme for Range-Aggregate Queries
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Irregularities of Distribution, Derandomization, and Complexity Theory
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Managing and analyzing massive data sets with data cubes
Handbook of massive data sets
Dynamic orthogonal range queries in OLAP
Theoretical Computer Science - Database theory
An efficient k nearest neighbors searching algorithm for a query line
Theoretical Computer Science
Dynamic multidimensional data cubes
Multidimensional databases
Space efficient dynamic orthogonal range reporting
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
A new framework for addressing temporal range queries and some preliminary results
Theoretical Computer Science
Lower bounds for 2-dimensional range counting
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Computational Geometry: Theory and Applications
Approximate range searching: The absolute model
Computational Geometry: Theory and Applications
A fast and progressive algorithm for skyline queries with totally- and partially-ordered domains
Journal of Systems and Software
NetShield: massive semantics-based vulnerability signature matching for high-speed networks
Proceedings of the ACM SIGCOMM 2010 conference
Counting inversions, offline orthogonal range counting, and related problems
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Algorithms and theory of computation handbook
Orthogonal range searching on the RAM, revisited
Proceedings of the twenty-seventh annual symposium on Computational geometry
Approximate covering detection among content-based subscriptions using space filling curves
Journal of Parallel and Distributed Computing
| Hi-index | 0.01 |
Lower bounds on the complexity of orthogonal range searching in thestatic case are established. Specifically, we consider the followingdominance search problem: Given a collection ofn weighted points ind-space and a query pointq, compute the cumulative weight ofthe points dominated (in all coordinates) byq. It is assumed that the weights arechosen in a commutative semigroup and that the query time measures onlythe number of arithmetic operations needed to compute the answer. It isproved that if m units of storage areavailable, then the query time is at least proportional to (logn/log(2m/n))d–1in both the worst and average cases. This lower bound is provably tightfor m =&OHgr;(n(logn)d–1+&egr;) and any fixed &egr; 0. A lower bound of &OHgr;(n/loglogn)d)on the time required for executing ninserts and queries is also established. —Author's Abstract