2514 search results - page 117 / 503 » On the Computation of Approximations of Database Queries |
159
click to vote
WOLLIC
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Database design aims to find a database schema that permits the efficient processing of common types of queries and updates on future database instances. Full first-ord...
310
click to vote
VLDB
2002
ACM
16 years 6 months ago
2002
ACM
Our aim is to develop new database technologies for the approximate matching of unstructured string data using indexes. We explore the potential of the suffix tree data structure i...
142
click to vote
ERCIMDL
2007
Springer
16 years 18 days ago
2007
Springer
We introduce a model of uncertainty where documents are not uniquely identified in a reference network, and some links may be incorrect. It generalizes the probabilistic approach ...
181
click to vote
ICDE
2010
IEEE
16 years 6 months ago
2010
IEEE
K Nearest Neighbor search has many applications including data mining, multi-media, image processing, and monitoring moving objects. In this paper, we study the problem of KNN over...
159
click to vote
DEXAW
2005
IEEE
16 years 1 days ago
2005
IEEE
For several reasons a database may not satisfy certain integrity constraints (ICs). However, most likely most of the information in it is still consistent with the ICs; and could ...