145 search results - page 25 / 29 » On Using Query Logs for Static Index Pruning |
WALCOM
2007
IEEE
13 years 8 months ago
2007
IEEE
Abstract. Computing visible information, such as a visible surface determination, is a significant problem and has been mainly studied in the fields of computational geometry and...
SIGMOD
2004
ACM
14 years 7 months ago
2004
ACM
Subsequence similarity matching in time series databases is an important research area for many applications. This paper presents a new approximate approach for automatic online s...
CIKM
2004
Springer
14 years 22 days ago
2004
Springer
As the number of available Web pages grows, users experience increasing difficulty finding documents relevant to their interests. One of the underlying reasons for this is that mo...
ICALP
2003
Springer
14 years 17 days ago
2003
Springer
Suppose we have n algorithms, quantum or classical, each computing some bit-value with bounded error probability. We describe a quantum algorithm that uses O( √ n) repetitions of...
SIGMOD
2009
ACM
14 years 7 months ago
2009
ACM
Keyword search in relational databases (RDBs) has been extensively studied recently. A keyword search (or a keyword query) in RDBs is specified by a set of keywords to explore the...