Sciweavers

19 search results - page 1 / 4
» A linear lower bound on index size for text retrieval
Sort
View
SODA
2001
ACM
87views Algorithms» more  SODA 2001»
13 years 6 months ago
A linear lower bound on index size for text retrieval
Most information-retrieval systems preprocess the data to produce an auxiliary index structure. Empirically, it has been observed that there is a tradeoff between query response t...
Erik D. Demaine, Alejandro López-Ortiz
INFOSCALE
2007
ACM
13 years 6 months ago
Query-driven indexing for scalable peer-to-peer text retrieval
We present a query-driven algorithm for the distributed indexing of large document collections within structured P2P networks. To cope with bandwidth consumption that has been ide...
Gleb Skobeltsyn, Toan Luu, Ivana Podnar Zarko, Mar...
ERCIMDL
1997
Springer
106views Education» more  ERCIMDL 1997»
13 years 8 months ago
Scalable Text Retrieval for Large Digital Libraries
It is argued that digital libraries of the future will contain terabyte-scale collections of digital text and that full-text searching techniques will be required to operate over c...
David Hawking
PKC
2010
Springer
126views Cryptology» more  PKC 2010»
13 years 8 months ago
Multi-query Computationally-Private Information Retrieval with Constant Communication Rate
A fundamental privacy problem in the client-server setting is the retrieval of a record from a database maintained by a server so that the computationally bounded server remains ob...
Jens Groth, Aggelos Kiayias, Helger Lipmaa
IFIPTCS
2000
13 years 8 months ago
An Index for Two Dimensional String Matching Allowing Rotations
We present an index to search a two-dimensional pattern of size m m in a two-dimensional text of size n n, even when the pattern appears rotated in the text. The index is based on ...
Kimmo Fredriksson, Gonzalo Navarro, Esko Ukkonen