Skip to main content
Article thumbnail
Location of Repository

Efficient Processing of 3-Sided Range Queries with Probabilistic Guarantees

By A. Kaporis, K. Tsakalidis, A. N. Papadopoulos, K. Tsichlas and S. Sioutas


This work studies the problem of 2-dimensional searching for the 3-sided range query of the form [a, b] × (−∞, c] in both main and external memory, by considering a variety of input distributions. A dynamic linear main memory solution is proposed, which answers 3-sided queries in O(log n + t) worst case time and scales with O(log log n) expected with high probability update time, under continuous µ-random distributions of the x and y coordinates, where n is the current number of stored points and t is the size of the query output. Our expected update bound constitutes a considerable improvement over the O(log n) update time bound achieved by the classic Priority Search Tree of McCreight [23], as well as over the Fusion Priority log

Year: 2011
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.