Sciweavers

326 search results - page 49 / 66
» Optimal crawling strategies for web search engines
Sort
View
ICDE
2008
IEEE
119views Database» more  ICDE 2008»
15 years 3 months ago
NGS: a framework for multi-domain query answering
— If we consider a query involving multiple domains, such as “find all database conferences held within six months in locations whose seasonal average temperature is 28◦ C a...
Daniele Braga, Diego Calvanese, Alessandro Campi, ...
84
Voted
WEBDB
2000
Springer
131views Database» more  WEBDB 2000»
15 years 1 months ago
Automatic Classification of Text Databases Through Query Probing
Many text databases on the web are "hidden" behind search interfaces, and their documents are only accessible through querying. Search engines typically ignore the conte...
Panagiotis G. Ipeirotis, Luis Gravano, Mehran Saha...
WSDM
2012
ACM
243views Data Mining» more  WSDM 2012»
13 years 5 months ago
No search result left behind: branching behavior with browser tabs
Today’s Web browsers allow users to open links in new windows or tabs. This action, which we call ‘branching’, is sometimes performed on search results when the user plans t...
Jeff Huang, Thomas Lin, Ryen W. White
EUROSYS
2007
ACM
15 years 6 months ago
Competitive prefetching for concurrent sequential I/O
During concurrent I/O workloads, sequential access to one I/O stream can be interrupted by accesses to other streams in the system. Frequent switching between multiple sequential ...
Chuanpeng Li, Kai Shen, Athanasios E. Papathanasio...
WSDM
2009
ACM
131views Data Mining» more  WSDM 2009»
15 years 4 months ago
Diversifying search results
We study the problem of answering ambiguous web queries in a setting where there exists a taxonomy of information, and that both queries and documents may belong to more than one ...
Rakesh Agrawal, Sreenivas Gollapudi, Alan Halverso...