String similarity search and join are two important operations in data cleaning and
integration, which extend traditional exact search and exact join operations in databases by …

The analysis of biological information from protein sequences is important for the study of
cellular functions and interactions, and protein fold recognition plays a key role in the …

String similarity join is an essential operation in data integration. The era of big data calls for
scalable algorithms to support large-scale string similarity joins. In this paper, we study …

Data integration aims to integrate data in different sources and provide users with a unified
view. However, data integration cannot be completely addressed by purely automated …

Jaro-Winkler distance is a measurement to measure the similarity between two strings.
Since Jaro-Winkler distance performs well in matching personal and entity names, it is …

Inclusion dependencies (INDs) are a well-known type of data dependency, specifying that
the values of one column are contained in those of another column. INDs can be used for …

Since many graph data are often noisy and incomplete in real applications, it has become
increasingly important to retrieve graphs in the graph database that approximately match the …

As a newly emerging network model, heterogeneous information networks (HINs) have
received growing attention. Many data mining tasks have been explored in HINs, including …

In this paper, we address a similarity search problem for spatial trajectories in road networks.
In particular, we focus on the subtrajectory similarity search problem, which involves finding …

We study the string similarity search problem with edit-distance constraints, which, given a
set of data strings and a query string, finds the similar strings to the query. Existing …