We use Patricia tries to represent textual and spatial data, and present a range search algorithm for reporting all k-d records from a set of size n intersecting a query rectangle. Data and queriesâ€¦ (More)

Patricia tries are explored for indexing combined text and spatial data. A combined text and spatial data range search algorithm is presented for reporting all data from a set of size n intersectingâ€¦ (More)

A k-nearest neighbor search algorithm for the Pyramid technique is presented. The Pyramid technique divides d-dimensional data space into 2d pyramids. Given a query point q, we initialize the radiusâ€¦ (More)

We use Patricia tries to answer 2-approximate orthogonal range search on a set of n random points and rectangles in k-dimensional space. Given n k-dimensional random points or rectangles and aâ€¦ (More)

We use tries to represent combined text and spatial data, and present a range search algorithm for reporting all 2-d points and rectangles from a set of size intersecting a query rectangle. Data andâ€¦ (More)

We present two new d-dimensional data structures, called the PKD-tree and the PKD+-tree, respectively. They are explored for indexing combined text and point data in low and high dimensional dataâ€¦ (More)

Vesicles form spontaneously in a aqueous mixture of sodium bis(2-ethylhexyl) sulfosuccinate (Aerosol OT) and lauryl sulfonate betaine (LSB). Different from catanionic vesicles, the formation orâ€¦ (More)

A decreasing radius k-nearest neighbor search algorithm for the mapping-based indexing schemes is presented. We implement the algorithm in the Pyramid technique and the iMinMax(Î¸), respectively. Theâ€¦ (More)