1091 search results - page 83 / 219 » Approximation in Databases |
125
Voted
SIGMOD
1998
ACM
15 years 6 months ago
1998
ACM
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 ...
105
click to vote
DASFAA
2009
IEEE
15 years 9 months ago
2009
IEEE
In Deep Web data integration, some Web database interfaces express exclusive predicates of the form Qe = Pi(Pi ∈ P1, P2, . . . , Pm), which permits only one predicate to be selec...
232
Voted
ICDE
2008
IEEE
16 years 3 months ago
2008
IEEE
Abstract-- We present an original graph embedding to speedup distance-range and k-nearest neighbor queries on static and/or dynamic objects located on a (weighted) graph. Our metho...
109
click to vote
SSD
1993
Springer
15 years 6 months ago
1993
Springer
Consider a polyhedron that is triangulated into tetrahedra in two different ways. This paper presents an algorithm, and hints for implementation, for finding the volumes of the i...
112
Voted
IDA
1998
Springer
15 years 2 months ago
1998
Springer
A fast and simple algorithm for approximately calculating the principal components (PCs) of a data set and so reducing its dimensionality is described. This Simple Principal Compo...