Sciweavers

3225 search results - page 323 / 645
» Query Optimization by Stored Queries
Sort
View
CIKM
2004
Springer
16 years 2 days ago
Approximating the top-m passages in a parallel question answering system
We examine the problem of retrieving the top-m ranked items from a large collection, randomly distributed across an n-node system. In order to retrieve the top m overall, we must ...
Charles L. A. Clarke, Egidio L. Terra
BIOCOMP
2007
15 years 8 months ago
Quality-Based Similarity Search for Biological Sequence Databases
Low-Complexity Regions (LCRs) of biological sequences are the main source of false positives in similarity searches for biological sequence databases. We consider the problem of ï...
Xuehui Li, Tamer Kahveci
SIGMOD
2010
ACM
159views Database» more  SIGMOD 2010»
15 years 5 months ago
Histograms reloaded: the merits of bucket diversity
Virtually all histograms store for each bucket the number of distinct values it contains and their average frequency. In this paper, we question this paradigm. We start out by inv...
Carl-Christian Kanne, Guido Moerkotte
WWW
2011
ACM
15 years 1 months ago
OXPath: little language, little memory, great value
Data about everything is readily available on the web—but often only accessible through elaborate user interactions. For automated decision support, extracting that data is esse...
Andrew Jon Sellers, Tim Furche, Georg Gottlob, Gio...
VLDB
1994
ACM
148views Database» more  VLDB 1994»
15 years 10 months ago
Fast Incremental Indexing for Full-Text Information Retrieval
Full-text information retrieval systems have traditionally been designed for archival environments. They often provide little or no support for adding new documents to an existing...
Eric W. Brown, James P. Callan, W. Bruce Croft