Kumar Ramaiyer

Learn More
Given a collection S of n line segments in the plane, the planar point location problem is to construct a data structure that can efficiently determine for a given query point p the first segment(s) in S intersected by vertical rays emanating out from p. It is well known that linear-space data structures can be constructed so as to achieve O(logn) query(More)
We present a method for maintaining biased search trees so as to support fast finger updates (i.e., updates in which one is given a pointer to the part of the tree being changed). We illustrate the power of such biased finger trees by showing how they can be used to derive an optimal <italic>O</italic>(<italic>n</italic>log<italic>n</italic>) algorithm for(More)
The rate at which we can acquire astronomical data out-strips our ability to manipulate and interpret it using standard techniques. Future digital astronomical surveys will enter the terabyte regime. In addition, the actual data themselves will be complex, comprising images and spectra, as well as the traditional measured attributes. We describe here an(More)
In preparation for the Sloan Digital Sky Survey (SDSS), a multi-color digital mapping of the northern sky, we have developed a prototype system using simulated astronomical data. The system uses an object-oriented database to store the data, a client-server model for data communication , and supports diierent types of geometric queries. The prototype system(More)
Kumar Ramaiyert Dept. of Computer Science Johns Hopkins University Baltimore, MD 21218-2694 kumarlDcs . j hu. edu We present a. method for maintaining biased search trees so as to support fast finger updates (i.e., updates in which one is given a pointer to the part of the hee being changed). We illustrate the power of such biased finger trees by showing(More)
  • 1