Dynamic 3-sided Planar Range Queries with Expected Doubly Logarithmic Time

Details Dynamic 3-sided Planar Range Queries with Expected Doubly Logarithmic Time Dynamic 3-sided Planar Range Queries with Expected Doubly Logarithmic Time

2012-01-12

arxiv.org/abs/1201.2702v1

Computer Science

Data Structures and Algorithms

Scientific paper

This work studies the problem of 2-dimensional searching for the 3-sided range query of the form $[a, b]\times (-\infty, c]$ in both main and external memory, by considering a variety of input distributions. We present three sets of solutions each of which examines the 3-sided problem in both RAM and I/O model respectively. The presented data structures are deterministic and the expectation is with respect to the input distribution.

Affiliated with

Also associated with

No associations

Rating

Dynamic 3-sided Planar Range Queries with Expected Doubly Logarithmic Time does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Dynamic 3-sided Planar Range Queries with Expected Doubly Logarithmic Time, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamic 3-sided Planar Range Queries with Expected Doubly Logarithmic Time will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-468164