Sciweavers

779 search results - page 38 / 156
» Determining Time of Queries for Re-ranking Search Results
Sort
View
SIGIR
2012
ACM
11 years 10 months ago
To index or not to index: time-space trade-offs in search engines with positional ranking functions
Positional ranking functions, widely used in web search engines, improve result quality by exploiting the positions of the query terms within documents. However, it is well known ...
Diego Arroyuelo, Senén González, Mau...
SISAP
2010
IEEE
243views Data Mining» more  SISAP 2010»
13 years 5 months ago
Similarity matrix compression for efficient signature quadratic form distance computation
Determining similarities among multimedia objects is a fundamental task in many content-based retrieval, analysis, mining, and exploration applications. Among state-of-the-art sim...
Christian Beecks, Merih Seran Uysal, Thomas Seidl
IPPS
1997
IEEE
13 years 12 months ago
d-Dimensional Range Search on Multicomputers
The range tree is a fundamental data structure for multidimensional point sets, and as such, is central in a wide range of geometric anddatabaseapplications. Inthis paper, we desc...
Afonso Ferreira, Claire Kenyon, Andrew Rau-Chaplin...
SIGMOD
2003
ACM
146views Database» more  SIGMOD 2003»
14 years 7 months ago
Estimating Compilation Time of a Query Optimizer
A query optimizer compares alternative plans in its search space to find the best plan for a given query. Depending on the search space and the enumeration algorithm, optimizers v...
Ihab F. Ilyas, Jun Rao, Guy M. Lohman, Dengfeng Ga...
TJS
2008
105views more  TJS 2008»
13 years 7 months ago
Using a relational database for scalable XML search
XML is a flexible and powerful tool that enables information and security sharing in heterogeneous environments. Scalable technologies are needed to effectively manage the growing...
Rebecca Cathey, Steven M. Beitzel, Eric C. Jensen,...