CS - 1996 - 05 Range Searching 1

CS - 1996 - 05 Range Searching 1 Pankaj

Searching Information Servers Based on Customized Pro lesTechnical Report USC - CS - 96 - 636

We investigate the eeect of using customized prooles to help searching relevant servers in Internet. Our experiments demonstrate that the use of customized prooles with latent semantic indexing (LSI) technique can improve the performance of Internet searching.

Range Searching Range Searching

Orthogonal Range Searching for Text Indexing

Text indexing, the problem in which one desires to preprocess a (usually large) text for future (shorter) queries, has been researched ever since the suffix tree was invented in the early 70’s. With textual data continuing to increase and with changes in the way it is accessed, new data structures and new algorithmic methods are continuously required. Therefore, text indexing is of utmost impor...

Distributed k-d trees§

In this paper we present a generalization of the k-d tree data structure suitable for an efficient management and querying in a distributed framework. We present optimal searching algorithm for exact, partial, and range search queries. Optimality is in the sense that (1) only servers that could have k-dimensional points related to a query reply to it and that (2) the client issuing the query ca...