Sciweavers

166 search results - page 2 / 34
» Extending the Search Strategy in a Query Optimizer
Sort
View
SIGIR
2005
ACM
15 years 3 months ago
Optimization strategies for complex queries
Previous research into the efficiency of text retrieval systems has dealt primarily with methods that consider inverted lists in sequence; these methods are known as term-at-a-tim...
Trevor Strohman, Howard R. Turtle, W. Bruce Croft
PVLDB
2010
103views more  PVLDB 2010»
14 years 8 months ago
Fast Optimal Twig Joins
In XML search systems twig queries specify predicates on node values and on the structural relationships between nodes, and a key operation is to join individual query node matche...
Nils Grimsmo, Truls Amundsen Bjørklund, Mag...
104
Voted
INFOSCALE
2007
ACM
14 years 11 months ago
Mining query logs to optimize index partitioning in parallel web search engines
Large-scale Parallel Web Search Engines (WSEs) needs to adopt a strategy for partitioning the inverted index among a set of parallel server nodes. In this paper we are interested ...
Claudio Lucchese, Salvatore Orlando, Raffaele Pere...
77
Voted
AAAI
2010
14 years 11 months ago
Optimal Strategies for Reviewing Search Results
Web search engines respond to a query by returning more results than can be reasonably reviewed. These results typically include the title, link, and snippet of content from the t...
Jeff Huang, Anna Kazeykina
91
Voted
ISMB
1996
14 years 11 months ago
Compact Encoding Strategies for DNA Sequence Similarity Search
Determining whether two DNA sequences are similar is an essential component of DNA sequence analysis. Dynamic programming is the algorithm of choice if computational time is not t...
David J. States, Pankaj Agarwal