Sciweavers

3652 search results - page 47 / 731
» A study of query length
Sort
View
PVLDB
2010
189views more  PVLDB 2010»
13 years 6 months ago
Slicing Long-Running Queries
The ability to decompose a complex, long-running query into simpler queries that produce the same result is useful for many scenarios, such as admission control, resource manageme...
Nicolas Bruno, Vivek R. Narasayya, Ravishankar Ram...
CBMS
2006
IEEE
14 years 1 months ago
Telederm: Enhancing Dermatological Diagnosis for Rural and Remote Communities
This paper describes techniques used in a Web-based decision support system to enhance dermatological diagnosis for rural and remote communities. We proposed a technique to improv...
Monica H. Ou, Geoff A. W. West, Mihai Lazarescu, C...
SOFSEM
2010
Springer
14 years 4 months ago
Continuous Processing of Preference Queries in Data Streams
Preference queries have received considerable attention in the recent past, due to their use in selecting the most preferred objects, especially when the selection criteria are con...
Maria Kontaki, Apostolos N. Papadopoulos, Yannis M...
SIGIR
2009
ACM
14 years 2 months ago
What queries are likely to recur in web search?
We study the recurrence dynamics of queries in Web search by analysing a large real-world query log dataset. We find that query frequency is more useful in predicting collective ...
Dell Zhang, Jinsong Lu
ICDT
2007
ACM
117views Database» more  ICDT 2007»
14 years 1 months ago
Preferentially Annotated Regular Path Queries
In this paper, we introduce preferential regular path queries. These are regular path queries whose symbols are annotated with preference weights for “scaling” up or down the i...
Gösta Grahne, Alex Thomo, William W. Wadge