<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Davood Rafiei</string-name>
          <email>drafiei@ualberta.ca</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Arash Dargahi Nobari</string-name>
          <email>dargahi@ualberta.ca</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Soroush Omidvartehrani</string-name>
          <email>s.omidvartehrani@ualberta.ca</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Bases (VLDBW'23) - TaDA'23: Tabular Data Analysis Workshop</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Consequently, performing an equi-join of A and P will</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>Tabular data are made available from diferent sources and this data can be used for exploratory analysis or be integrated with other data sources. However, searching for such data and integrating tables from diferent sources with little information about the schema has been a challenge. Our vision is to develop tools and algorithms to make this process easier. This paper CEUR primary sources of information available to the special- in the formatting of property addresses between the open Joint Workshops at 49th International Conference on Very Large Data ∗Corresponding author.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>presents some of our recent in this direction.</p>
      <p>this by taking an exploratory approach to search with a</p>
      <p>© 2023 Copyright for this paper by its authors. Use permitted under Creative Commons License about the underlying table schemes. BareTQL achieves</p>
    </sec>
    <sec id="sec-2">
      <title>1. A Scenario</title>
      <p>A business intelligence specialist at a bank is in charge of
collecting data on local businesses to assess their market
value, which is used for loan approvals. There are two
ist: property assessments and company profile databases.
Property assessments (referred to as A) are made
available, as part of open government data, by the municipal
government, which conducts these assessments annually
for tax purposes. In addition to property assessments, the
specialist can access two company profile databases that
provide diferent information about the companies. One
database contains details about the properties owned by
each company (referred to as P), while the other focuses
on stock valuations (V). The stock valuations include
the company symbol, number of shares outstanding, and
the share price among other information. The
specialist’s task is to gather the relevant records from these
sources and present them in a clean and concise format
for the loan approval oficers. By consolidating the
property assessment data, company property information,
and stock valuations, the specialist creates a
comprehensive overview of each business, enabling more informed
decision-making during the loan approval process.</p>
    </sec>
    <sec id="sec-3">
      <title>2. Challenges</title>
      <p>The task involves a number of challenges. Firstly, the
open government data consists of an extensive
collection of tables, numbering in the tens of thousands. To
navigate through this vast amount of data, the specialist
requires appropriate search tools to identify the relevant
tables and records. The data does not provide the names</p>
    </sec>
    <sec id="sec-4">
      <title>3. Table Search and Querying</title>
      <p>
        We have developed Bare Table Query Language (in short
BareTQL) an interactive framework for querying large
collections of tables [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Compared to table search
approaches in the literature (e.g. [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]), BareTQL ofers some
distinctive features including (1) the composability and
interoperability of operations with little reliance on the
schema information of the tables being queried, and (2)
the ability to customize search and transform tables. This
is achieved by providing a set of algebraic operators over
a table collection when little is known or can be assumed
BareTQL Dashboard
Transform
&amp; Join
in A can be formatted as “12345 78 Ave NW, Apt#202”,
while the same address in P is represented as “202-12345
78 avenue, NW.” We need to transform one formatting
to the other before a join. Each transformation may be
represented as a sequence of basic string operations such
as substr, split and splitSubstr, and the search for a
transformation may be conducted by searching over the set
of possible transformations and their parameters. The
search space for possible transformations grows
exponentially with the number of basic operations and the
parameters of those operations. In our Common String-based
Transformer (CST) [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], the search space is constrained
based on common text sequences that are observed in
source and target tables. Thanks to its eficient search
algorithm, CST improves upon competitive approaches
such as Auto-join [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] by a few orders of magnitude in
running time.
      </p>
      <p>While string-based transformations are
humanreadable and interpretable, there have two general
limitations: (1) these transformations are syntactic and they
usually miss semantic mappings (e.g. synonyms)
between sources, (2) learning transformations is a
resourceintensive process. Our next work attempts to address
these challenges.
4.2. Transformations in a latent space
focus on what is known already and building on top.</p>
      <p>BareTQL supports four classes of operations as shown
in Figure 1. A keyword search may be used when there
is little information about the tables being queried and
their structures, whereas a table search may be invoked
when the user has a table and wants to find more related
tables. Through a set of table expansion operators, one
can expand a table by adding more rows (xr), adding
more columns (xc) and filling missing values (fill). These
operations may invoke table search to find the relevant
tables, but the relevance ranking can vary for each table
expansion operator. In our given scenario, the
specialist may search open government data for tables using
keywords from property addresses, and filter the results
using follow-up operations. The specialist may also
provide some examples of addresses and their valuations
to find more a more comprehensive list. BareTQL
supports joining tables from diferent sources through the
use of transformations. We next discuss our work on
automatically finding such transformations.</p>
      <p>
        Consider our scenario again where companies in P are
identified by their names, while the same companies
in V are identified by their stock symbols.
Transforming company names to their stock symbols using string
operations is less trivial or meaningful. We have been
recently studying the power of transformer models in
mapping tabular data. In particular, our Deep Tabular
Transformer (DTT) framework [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] learns string-based
transformations in a latent space. To start with a basic
language understanding, a large language model is adopted
for the problem and transformations are learned on top.
      </p>
      <p>
        To train such a model though, one usually needs a large
4. Transforming Tables for Join set of labeled data. Our study shows that string
transformations can be learned from synthetic data which can be
When tables are gathered from multiple sources, they generated in large volumes. DTT employs a decomposer
rarely conform to the same formatting. We study the and an aggregator module to deal with disparity in table
problem of transforming tables for joinability under two sizes and to handle large tables.
settings: (1) each transformation is expressed as a se- Although DTT is not fine-tuned on real-world data,
quence of string operations, and (2) transformations are our experiments indicate that it delivers outstanding
perlearned in a latent space. Unlike previous works relying formance on both real-world and synthetic datasets,
comon similarity functions for matching (e.g., [
        <xref ref-type="bibr" rid="ref3 ref4">3, 4</xref>
        ]), learn- pared to state-of-the-art baseline methods. Furthermore,
ing transformations ofer greater insight into formatting the DTT framework is complex enough to observe
vardiferences and broader application possibilities. ious patterns in the data, while being small enough to
eficiently run on a single GPU.
4.1. Mappings through string operations We are studying ways of improving our mapping
functions while keeping them human-readable and
interpretable.
      </p>
      <p>Consider joining tables in sources A and P in our
scenario based on property addresses. An arbitrary address</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>D.</given-names>
            <surname>Rafiei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Fah</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Lafrance</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Dargahi</surname>
          </string-name>
          <string-name>
            <surname>Nobari</surname>
          </string-name>
          ,
          <string-name>
            <surname>Baretql:</surname>
          </string-name>
          <article-title>An interactive system for searching and extraction of open data tables</article-title>
          ,
          <source>in: 27th International Conference on Intelligent User Interfaces</source>
          ,
          <year>2022</year>
          , pp.
          <fpage>30</fpage>
          -
          <lpage>33</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>O.</given-names>
            <surname>Lehmberg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Ritze</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Ristoski</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Meusel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Paulheim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Bizer</surname>
          </string-name>
          ,
          <article-title>The mannheim search join engine</article-title>
          ,
          <source>Journal of Web Semantics</source>
          <volume>35</volume>
          (
          <year>2015</year>
          )
          <fpage>159</fpage>
          -
          <lpage>166</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>S.</given-names>
            <surname>Chaudhuri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Ganjam</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Ganti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Motwani</surname>
          </string-name>
          ,
          <article-title>Robust and eficient fuzzy match for online data cleaning</article-title>
          ,
          <source>in: Proceedings of the 2003 ACM SIGMOD international conference on Management of data</source>
          ,
          <year>2003</year>
          , pp.
          <fpage>313</fpage>
          -
          <lpage>324</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>J.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Fe</surname>
          </string-name>
          ,
          <article-title>Fast-join: An eficient method for fuzzy token matching based string similarity join</article-title>
          ,
          <source>in: 2011 IEEE 27th International Conference on Data Engineering</source>
          , IEEE,
          <year>2011</year>
          , pp.
          <fpage>458</fpage>
          -
          <lpage>469</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>A. D.</given-names>
            <surname>Nobari</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Rafiei</surname>
          </string-name>
          ,
          <article-title>Eficiently transforming tables for joinability</article-title>
          ,
          <source>in: 2022 IEEE 38th International Conference on Data Engineering (ICDE)</source>
          , IEEE,
          <year>2022</year>
          , pp.
          <fpage>1649</fpage>
          -
          <lpage>1661</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>E.</given-names>
            <surname>Zhu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Chaudhuri</surname>
          </string-name>
          ,
          <article-title>Auto-join: Joining tables by leveraging transformations</article-title>
          ,
          <source>Proceedings of the VLDB Endowment</source>
          <volume>10</volume>
          (
          <year>2017</year>
          )
          <fpage>1034</fpage>
          -
          <lpage>1045</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>A. D.</given-names>
            <surname>Nobari</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Rafiei</surname>
          </string-name>
          ,
          <string-name>
            <surname>Dtt:</surname>
          </string-name>
          <article-title>An example-driven tabular transformer by leveraging large language models</article-title>
          ,
          <year>2023</year>
          . arXiv:
          <volume>2303</volume>
          .
          <fpage>06748</fpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>