Let \mathcalD 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 reports k most …

The increasing performance and wider spread use of automated semantic annotation and
entity linking platforms has empowered the possibility of using semantic information in …

Most of the fastest-growing string collections today are repetitive, that is, most of the
constituent documents are similar to many others. As these collections keep growing, a key …

Given a collection of strings, document listing refers to the problem of finding all the strings
(or documents) where a given query string (or pattern) appears. Index data structures that …

Sequence representations supporting not only direct access to their symbols, but also
rank/select operations, are a fundamental building block in many compressed data …

Digital world is coming, were data as become big data with ever increase in large volume of
digital information available in terms of text documents. This tends for data extraction …

We present two compact representations of rasters, which are used in GIS to represent
temperatures, elevations, and other spatial attributes, that support queries on the positions …

Due to very fast growth of information in the last few decades, getting precise information in
real time is becoming increasingly difficult. Search engines such as Google and Yahoo are …

Document retrieval structures index a collection of string documents, to retrieve those that
are relevant to query strings p: document listing retrieves all documents where p appears; …

We present a fast and compact index for top-k document retrieval on general string
collections, in which given a string pattern, the index returns the k documents where it …