Sciweavers

360 search results - page 19 / 72
» Dynamic Sample Selection for Approximate Query Processing
Sort
View
SSD
2001
Springer
111views Database» more  SSD 2001»
14 years 27 days ago
Querying Mobile Objects in Spatio-Temporal Databases
In dynamic spatio-temporal environments where objects may continuously move in space, maintaining consistent information about the location of objects and processing motion-speciï¬...
Kriengkrai Porkaew, Iosif Lazaridis, Sharad Mehrot...
SIGMOD
1998
ACM
96views Database» more  SIGMOD 1998»
14 years 21 days ago
Wavelet-Based Histograms for Selectivity Estimation
Query optimization is an integral part of relational database management systems. One important task in query optimization is selectivity estimation, that is, given a query P, we ...
Yossi Matias, Jeffrey Scott Vitter, Min Wang
JMLR
2002
115views more  JMLR 2002»
13 years 8 months ago
PAC-Bayesian Generalisation Error Bounds for Gaussian Process Classification
Approximate Bayesian Gaussian process (GP) classification techniques are powerful nonparametric learning methods, similar in appearance and performance to support vector machines....
Matthias Seeger
SIGIR
2012
ACM
11 years 11 months ago
Time-sensitive query auto-completion
Query auto-completion (QAC) is a common feature in modern search engines. High quality QAC candidates enhance search experience by saving users time that otherwise would be spent ...
Milad Shokouhi, Kira Radinsky
ICDE
2003
IEEE
161views Database» more  ICDE 2003»
14 years 9 months ago
Structural Join Order Selection for XML Query Optimization
Structural join operations are central to evaluating queries against XML data, and are typically responsible for consuming a lion's share of the query processing time. Thus, ...
Yuqing Wu, Jignesh M. Patel, H. V. Jagadish