A Lower Bound on the Complexity of Orthogonal Range Queries.

Michael L. Fredman: A Lower Bound on the Complexity of Orthogonal Range Queries. J. ACM 28(4): 696-705(1981)

@article{DBLP:journals/jacm/Fredman81,
  author    = {Michael L. Fredman},
  title     = {A Lower Bound on the Complexity of Orthogonal Range Queries},
  journal   = {J. ACM},
  volume    = {28},
  number    = {4},
  year      = {1981},
  pages     = {696-705},
  ee        = {db/journals/jacm/Fredman81.html, http://doi.acm.org/10.1145/322276.322281},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

BibTeX

Online Edition

Citation Page BibTeX

Referenced by

Chung Keung Poon: Orthogonal Range Queries in OLAP. ICDT 2001: 361-374
Dan E. Willard: Quasilinear Algorithms for Processing Relational Calculus Expressions. PODS 1990: 243-257
Jeffrey D. Ullman: Principles of Database and Knowledge-Base Systems, Volume II. Computer Science Press 1989, ISBN 0-7167-8162-X
Contents
Dan E. Willard: Efficient Processing of Relational Calculus Expressions Using Range Query Theory. SIGMOD Conference 1984: 164-175

BibTeX