Range queries

Academic Journals

  1. Dan E. Willard. An Algorithm for Handling Many Relational Calculus Queries Efficiently. Journal of Computer and System Sciences, 65(2):295-331, 2002. details doi pdf
  2. Dan E. Willard. Applications of Range Query Theory to Relational Data Base Join and Selection Operations. Journal of Computer and System Sciences, 52(1):157-169, 1996. details doi pdf

International Conferences

  1. Yakov Nekrich. Space efficient dynamic orthogonal range reporting. In Symposium on Computational Geometry, Pages 306-313, 2005. details download ps
  2. Stephen Alstrup, Gerth St\olting Brodal, Theis Rauhe. New Data Structures for Orthogonal Range Searching. In Proc. 41st Annual Symposium on Foundations of Computer Science (FOCS), Pages 198-2007, Redondo Beach, California, November 2000. details doi pdf
  3. Dan E. Willard. Quasilinear algorithms for processing relational calculus expressions (preliminary report). In PODS '90: Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, Pages 243-257, New York, NY, USA, 1990. details download pdf

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.