2514 search results - page 29 / 503 » On the Computation of Approximations of Database Queries |
126
click to vote
EDBT
2008
ACM
16 years 6 months ago
2008
ACM
Index trees created using distance based indexing are difficult to maintain online since the distance function involved is often costly to compute. This problem is intensified whe...
162
click to vote
GEOINFORMATICA
1998
15 years 5 months ago
1998
The issue of ®nding similar 3-D surface segments arises in many recent applications of spatial database systems, such as molecular biology, medical imaging, CAD, and geographic i...
154
click to vote
GCB
2004
Springer
15 years 11 months ago
2004
Springer
: The main contribution of this paper is a novel approach for fast searching in huge structural databases like the PDB. The data structure is based on an adaption of the generalize...
288
click to vote
ICDE
2002
IEEE
16 years 7 months ago
2002
IEEE
Obtaining fast and good quality approximations to data distributions is a problem of central interest to database management. A variety of popular database applications including,...
162
click to vote
ICDT
2003
ACM
15 years 11 months ago
2003
ACM
In an on-line statistical database, the query system should leave unanswered queries asking for sums that could lead to the disclosure of confidential data. To check that, every su...