Sciweavers

3891 search results - page 226 / 779
» Query Models
Sort
View
KDD
2008
ACM
128views Data Mining» more  KDD 2008»
16 years 6 months ago
Bypass rates: reducing query abandonment using negative inferences
We introduce a new approach to analyzing click logs by examining both the documents that are clicked and those that are bypassed--documents returned higher in the ordering of the ...
Atish Das Sarma, Sreenivas Gollapudi, Samuel Ieong
SSDBM
2006
IEEE
122views Database» more  SSDBM 2006»
16 years 14 days ago
Probabilistic Ranking Queries on Gaussians
In many modern applications, there are no exact values available to describe the data objects. Instead, the feature values are considered to be uncertain. This uncertainty is mode...
Christian Böhm, Alexey Pryakhin, Matthias Sch...
IJWIS
2007
181views more  IJWIS 2007»
15 years 6 months ago
Answering queries over incomplete data stream histories
Streams of data often originate from many distributed sources. A distributed stream processing system publishes such streams of data and enables queries over the streams. This allo...
Alasdair J. G. Gray, Werner Nutt, M. Howard Willia...
SIGMOD
2011
ACM
267views Database» more  SIGMOD 2011»
14 years 9 months ago
A latency and fault-tolerance optimizer for online parallel query plans
We address the problem of making online, parallel query plans fault-tolerant: i.e., provide intra-query fault-tolerance without blocking. We develop an approach that not only achi...
Prasang Upadhyaya, YongChul Kwon, Magdalena Balazi...
SIGMOD
2004
ACM
160views Database» more  SIGMOD 2004»
16 years 6 months ago
Extending Query Rewriting Techniques for Fine-Grained Access Control
Current day database applications, with large numbers of users, require fine-grained access control mechanisms, at the level of individual tuples, not just entire relations/views,...
Shariq Rizvi, Alberto O. Mendelzon, S. Sudarshan, ...