2514 search results - page 75 / 503 » On the Computation of Approximations of Database Queries |
163
click to vote
PAMI
2011
15 years 1 months ago
2011
—Subspaces offer convenient means of representing information in many pattern recognition, machine vision, and statistical learning applications. Contrary to the growing populari...
158
click to vote
EDBT
2009
ACM
16 years 1 months ago
2009
ACM
We study the problem of estimating selectivity of approximate substring queries. Its importance in databases is ever increasing as more and more data are input by users and are in...
185
click to vote
SIGMOD
1999
ACM
15 years 10 months ago
1999
ACM
Selectivity estimation of queries is an important and wellstudied problem in relational database systems. In this paper, we examine selectivity estimation in the context of Geogra...
166
click to vote
DEXA
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. In this paper we examine the problem of indexing time sequences in order to answer inverse queries. An inverse query computes all the time points at which the sequence co...
196
click to vote
CIKM
2000
Springer
15 years 10 months ago
2000
Springer
—As databases increasingly integrate different types of information such as multimedia, spatial, time-series, and scientific data, it becomes necessary to support efficient retri...