Sciweavers

3652 search results - page 127 / 731
» A study of query length
Sort
View
SIGIR
2009
ACM
14 years 2 months ago
Effective query expansion for federated search
While query expansion techniques have been shown to improve retrieval performance in a centralized setting, they have not been well studied in a federated setting. In this paper, ...
Milad Shokouhi, Leif Azzopardi, Paul Thomas
ICC
2007
IEEE
14 years 2 months ago
Speed Up Queries in Unstructured Peer-to-Peer Networks
—Unstructured peer-to-peer networks have gained a lot of popularity due to their resilience to network dynamics. The core operation in such networks is to efficiently locate res...
Zhan Zhang, Yong Tang, Shigang Chen
CIKM
2007
Springer
14 years 2 months ago
"I know what you did last summer": query logs and user privacy
We investigate the subtle cues to user identity that may be exploited in attacks on the privacy of users in web search query logs. We study the application of simple classifiers ...
Rosie Jones, Ravi Kumar, Bo Pang, Andrew Tomkins
DEXA
2005
Springer
80views Database» more  DEXA 2005»
14 years 1 months ago
Optimizing I/O Costs of Multi-dimensional Queries Using Bitmap Indices
Bitmap indices are efficient data structures for processing complex, multi-dimensional queries in data warehouse applications and scientific data analysis. For high-cardinality at...
Doron Rotem, Kurt Stockinger, Kesheng Wu
ADC
2004
Springer
87views Database» more  ADC 2004»
14 years 1 months ago
On the Computation of Approximations of Database Queries
Reflective Relational Machines were introduced by S. Abiteboul, C. Papadimitriou and V. Vianu in 1994, as variations of Turing machines which are suitable for the computation of ...
Flavio Antonio Ferrarotti, Jose Maria Turull Torre...