To bridge the gap between users and data, numerous text-to-SQL systems have been
developed that allow users to pose natural language questions over relational databases …

With the increasing amount of data and the need to integrate data from multiple data
sources, one of the challenging issues is to identify near-duplicate records efficiently. In this …

The suffix tree of a string is the fundamental data structure of combinatorial pattern matching.
Weiner (1973), who introduced the data structure, gave an O (n)-time algorithm for building …

Conventional keyword search engines are restricted to a given data model and cannot
easily adapt to unstructured, semi-structured or structured data. In this paper, we propose an …

Our news are saturated with claims of" facts" made from data. Database research has in the
past focused on how to answer queries, but has not devoted much attention to discerning …

Similarity join is a useful primitive operation underlying many applications, such as near
duplicate Web page detection, data integration, and pattern recognition. Traditional similarity …

We witness an unprecedented proliferation of knowledge graphs that record millions of
entities and their relationships. While knowledge graphs are structure-flexible and content …

Empowering users to access databases using simple keywords can relieve the users from
the steep learning curve of mastering a structured query language and understanding …

In this paper, we study the problem of effective keyword search over XML documents. We
begin by introducing the notion of Valuable Lowest Common Ancestor (VLCA) to accurately …

This paper surveys research on enabling keyword search in relational databases. We
present fundamental characteristics and discuss research dimensions, including data …