Adding Range Restriction Capability to Dynamic Data Structures.

@article{DBLP:journals/jacm/WillardL85,
  author    = {Dan E. Willard and
               George S. Lueker},
  title     = {Adding Range Restriction Capability to Dynamic Data Structures},
  journal   = {J. ACM},
  volume    = {32},
  number    = {3},
  year      = {1985},
  pages     = {597-617},
  ee        = {db/journals/jacm/WillardL85.html, http://doi.acm.org/10.1145/3828.3839},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Online Edition

Referenced by

1. Chung Keung Poon: Orthogonal Range Queries in OLAP. ICDT 2001: 361-374
2. Ching-Tien Ho, Rakesh Agrawal, Nimrod Megiddo, Ramakrishnan Srikant: Range Queries in OLAP Data Cubes. SIGMOD Conference 1997: 73-88
3. Dan E. Willard: Quasilinear Algorithms for Processing Relational Calculus Expressions. PODS 1990: 243-257
4. Jeffrey D. Ullman: Principles of Database and Knowledge-Base Systems, Volume II. Computer Science Press 1989, ISBN 0-7167-8162-X
   Contents
5. Dan E. Willard: Good Worst-Case Algorithms for Inserting and Deleting Records in Dense Sequential Files. SIGMOD Conference 1986: 251-260