Sciweavers

853 search results - page 60 / 171
» Understanding queries in a search database system
Sort
View
ICDE
2006
IEEE
134views Database» more  ICDE 2006»
14 years 1 months ago
Processing High-Volume Stream Queries on a Supercomputer
Scientific instruments, such as radio telescopes, colliders, sensor networks, and simulators generate very high volumes of data streams that scientists analyze to detect and under...
Erik Zeitler, Tore Risch
SIGCOMM
2009
ACM
14 years 2 months ago
SMS-based contextual web search
SMS-based web search is different from traditional web search in that the final response to a search query is limited to a very small number of bytes (typically 1-2 SMS messages...
Jay Chen, Brendan Linn, Lakshminarayanan Subramani...
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
14 years 7 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang
JIDM
2010
160views more  JIDM 2010»
13 years 6 months ago
Evaluation of Conditional Preference Queries
The need for incorporating preference querying in database technology is a very important issue in a variety of applications ranging from e-commerce to personalized search engines....
Fabiola S. F. Pereira, Sandra de Amo
TASLP
2008
122views more  TASLP 2008»
13 years 6 months ago
Challenging Uncertainty in Query by Humming Systems: A Fingerprinting Approach
Robust data retrieval in the presence of uncertainty is a challenging problem in multimedia information retrieval. In query-by-humming (QBH) systems, uncertainty can arise in query...
Erdem Unal, Elaine Chew, Panayiotis G. Georgiou, S...