Sciweavers

166 search results - page 16 / 34
» Mixing Querying and Navigation in MIX
Sort
View
CIKM
1994
Springer
15 years 1 months ago
TID Hash Joins
TID hash joins are a simple and memory-efficient method for processing large join queries. They are based on standard hash join algorithms but only store TID/key pairs in the hash...
Robert Marek, Erhard Rahm
SIGMOD
2005
ACM
187views Database» more  SIGMOD 2005»
15 years 9 months ago
A Generic Framework for Monitoring Continuous Spatial Queries over Moving Objects
This paper proposes a generic framework for monitoring continuous spatial queries over moving objects. The framework distinguishes itself from existing work by being the first to ...
Haibo Hu, Jianliang Xu, Dik Lun Lee
SIGIR
2009
ACM
15 years 4 months ago
Multiple approaches to analysing query diversity
In this paper we examine user queries with respect to diversity: providing a mix of results across different interpretations. Using two query log analysis techniques (click entrop...
Paul Clough, Mark Sanderson, Murad Abouammoh, Serg...
90
Voted
TREC
2004
14 years 10 months ago
SJTU at TREC 2004: Web Track Experiments
: This is the first year our lab to participate in Trec. We participate in Mixed-Query task for the Web track. All the runs we submitted are based on the modified Okapi weighting s...
Yiming Lu, Jian Hu, Fanyuan Ma
VLDB
2004
ACM
97views Database» more  VLDB 2004»
15 years 2 months ago
Progressive Optimization in Action
Progressive Optimization (POP) is a technique to make query plans robust, and minimize need for DBA intervention, by repeatedly re-optimizing a query during runtime if the cardina...
Vijayshankar Raman, Volker Markl, David E. Simmen,...