1091 search results - page 26 / 219 » Approximation in Databases |
205
click to vote
ICDE
2003
IEEE
16 years 1 months ago
2003
IEEE
XML data integration tools are facing a variety of challenges for their efficient and effective operation. Among these is the requirement to handle a variety of inconsistencies or...
171
click to vote
VLDB
2002
ACM
16 years 9 hour ago
2002
ACM
We propose a new data structure to search in metric spaces. A metric space is formed by a collection of objects and a distance function de ned among them, which satis es the trian...
IDEAS
2007
IEEE
15 years 6 months ago
2007
IEEE
There is an increasing need for an XML query engine that not only searches for exact matches to a query but also returns “query-like” structures. We have designed and develope...
117
click to vote
SSDBM
2007
IEEE
15 years 6 months ago
2007
IEEE
We present a fast algorithm for computing approximate quantiles in high speed data streams with deterministic error bounds. For data streams of size N where N is unknown in advanc...
100
click to vote
PR
1998
14 years 11 months ago
1998
This paper describes a method for optimizing the cost matrix of any approximate string matching algorithm based on the Levenshtein distance. The method, which uses genetic algorit...