A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf
.
Efficient algorithms to execute complex similarity queries in RDBMS
2004
Journal of the Brazilian Computer Society
Search operations in large sets of complex objects usually rely on similarity-based criteria, due to the lack of other general properties that could be used to compare the objects, such as the total order relationship, or even the equality relationship between pairs of objects, commonly used with data in numeric or short texts domains. Therefore, similarity between objects is the core criterion to compare complex objects. There are two basic operators for similarity queries: Range Query and
doi:10.1590/s0104-65002004000100002
fatcat:jeloa5lyybdwzfdz4ajgk25ina