2514 search results - page 52 / 503 » On the Computation of Approximations of Database Queries |
236
click to vote
SSD
2007
Springer
16 years 12 days ago
2007
Springer
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
256
click to vote
ICDE
2006
IEEE
16 years 7 months ago
2006
IEEE
Graphs have become popular for modeling structured data. As a result, graph queries are becoming common and graph indexing has come to play an essential role in query processing. ...
203
click to vote
BIBE
2003
IEEE
15 years 11 months ago
2003
IEEE
We present a multi-dimensional indexing approach for fast sequence similarity search in DNA and protein databases. In particular, we propose effective transformations of subsequen...
196
click to vote
SIGMOD
2011
ACM
14 years 9 months ago
2011
ACM
An important means of allowing non-expert end-users to pose ad hoc queries — whether over single databases or data integration systems — is through keyword search. Given a set...
207
click to vote
GPC
2007
Springer
16 years 14 days ago
2007
Springer
Sharing huge databases in distributed systems is inherently difficult. As the amount of stored data increases, data localization techniques become no longer sufficient. A more ef...