3652 search results - page 312 / 731 » A study of query length |
215
Voted
ICDE
1998
IEEE
16 years 5 months ago
1998
IEEE
?Past R-tree studies have focused on the number of nodes visited as a metric of query performance. Since database systems usually include a buffering mechanism, we propose that the...
105
Voted
EDBT
2008
ACM
16 years 3 months ago
2008
ACM
Users often do not require a complete answer to their query but rather only a sample. They expect the sample to be either the largest possible or the most representative (or both)...
144
Voted
STACS
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. Suppose one has access to oracles generating samples from two unknown probability distributions p and q on some N-element set. How many samples does one need to test whet...
131
click to vote
CIKM
2007
Springer
15 years 9 months ago
2007
Springer
In this paper, we study the problem of effective keyword search over XML documents. We begin by introducing the notion of Valuable Lowest Common Ancestor (VLCA) to accurately and ...
128
Voted
SIGIR
2004
ACM
15 years 9 months ago
2004
ACM
Contextual retrieval is a critical technique for facilitating many important applications such as mobile search, personalized search, PC troubleshooting, etc. Despite of its impor...