Let D be a collection of D documents, which are strings over an alphabet of size σ, of total length n. We describe a data structure that uses linear space and and reports k most relevant documents that contain a query pattern P , which is a string of length p packed in p/ logσ n words, in time O(p/ logσ n+k). This is optimal in the RAM model in the general case where logD = Θ(log n), and involv...

Abstra t. Musi sequen es an be treated as texts in order to perform musi retrieval tasks on them. However, the text sear h problems that result from this modeling are unique to musi retrieval. Up to date, several approa hes derived from lassi al string mat hing have been proposed to ope with the new sear h problems, yet ea h problem had its own algorithms. In this paper we show that a te hnique...

With the exponential rise in the volume of database there is a demand for faster and timely retrieval of data.Early data retrieval (IR) systems used straightforward tools of word matching, and the texts to be searched were small.But in the present situation, due to giant volume of knowledge sources ,which too is in numerous forms, there is a requirement of additional Economical retrieval techni...

<p>Homogeneous and heterogeneous data retrieval problem refers that these requested items are retrieved on the basis of broadcast at some channels such access latency all is minimized. The has an important study significance in MIMO (Multiple Input Multiple Output) wireless communication. Almost researches focused proposing schemes for solving signal antenna or multiple antennae based hom...