Sciweavers

269 search results - page 16 / 54
» Indexing text data under space constraints
Sort
View
ALGORITHMICA
2000
161views more  ALGORITHMICA 2000»
13 years 9 months ago
Binary Searching with Nonuniform Costs and Its Application to Text Retrieval
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
Gonzalo Navarro, Ricardo A. Baeza-Yates, Eduardo F...
KDD
2005
ACM
194views Data Mining» more  KDD 2005»
14 years 10 months ago
Web object indexing using domain knowledge
Web object is defined to represent any meaningful object embedded in web pages (e.g. images, music) or pointed to by hyperlinks (e.g. downloadable files). Users usually search for...
Muyuan Wang, Zhiwei Li, Lie Lu, Wei-Ying Ma, Naiya...
SIGMOD
2012
ACM
203views Database» more  SIGMOD 2012»
12 years 10 days ago
Optimizing index for taxonomy keyword search
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
Bolin Ding, Haixun Wang, Ruoming Jin, Jiawei Han, ...
VLDB
1993
ACM
138views Database» more  VLDB 1993»
14 years 1 months ago
Searching Large Lexicons for Partially Specified Terms using Compressed Inverted Files
There are many advantages to be gained by storing the lexicon of a full text database in main memory. In this paper we describe how to use a compressed inverted file index to sear...
Justin Zobel, Alistair Moffat, Ron Sacks-Davis
ICDT
2003
ACM
91views Database» more  ICDT 2003»
14 years 3 months ago
Reformulation of XML Queries and Constraints
We state and solve the query reformulation problem for XML publishing in a general setting that allows mixed (XML and relational) storage for the proprietary data and exploits redu...
Alin Deutsch, Val Tannen