Flach, PA

Price, S

English

Integrating heterogeneous data from sources as diverse as web pages, digital libraries, knowledge bases, the Semantic Web and databases is an open problem. The ultimate aim of our work is to be able to query such heterogeneous data sources as if their data were conveniently held in a single relational database. Pursuant to this aim, we propose a generalisation of joins from the relational database model to enable joins on arbitrarily complex structured data in a higher-order representation. By incorporating kernels and distances for structured data, we further extend this model to support approximate joins of heterogeneous data. We demonstrate the flexibility of our approach in the publications domain by evaluating example approximate queries on the CORA data sets, joining on types ranging from sets of co-authors through to entire publications.Integrating heterogeneous data from sources as diverse as web pages, digital libraries, knowledge bases, the Semantic Web and databases is an open problem. The ultimate aim of our work is to be able to query such heterogeneous data sources as if their data were conveniently held in a single relational database. Pursuant to this aim, we propose a generalisation of joins from the relational database model to enable joins on arbitrarily complex structured data in a higher-order representation. By incorporating kernels and distances for structured data, we further extend this model to support approximate joins of heterogeneous data. We demonstrate the flexibility of our approach in the publications domain by evaluating example approximate queries on the CORA data sets, joining on types ranging from sets of co-authors through to entire publications

Explore Bristol Research

A formulation of the simple theory of types.

A latent Dirichlet model for unsupervised entity resolution. In:

A.: Joint deduplication of multiple record types in relational data. In:

A.: SPARQLQuery Language for RDF.

An Introduction to Database Systems.

C.L.: Autonomous citation matching. In:

Combining bayesian networks with higher-order data representations. In:

Distance between herbrand interpretations: A measure for approximations to a target concept.

Distance induction in ﬁrst order logic.

Extending k-means clustering to ﬁrst-order representations.

F.: Induction of optimal semantic semi-distances for clausal knowledge bases.

Kernel Methods for Pattern Analysis.

Kernels and distances for structured data.

Kernels over relational algebra structures. In:

Logic and Learning.

Measuring similarity between ontologies. In:

Multi-relational record linkage.

O.: The Semantic Web.

Relational clustering for multi-type entity resolution. In:

The Relational Model for Database Management, Version 2.

The structure of scientiﬁc collaboration networks.

U.,Horv´ ath, T.,Wrobel,S.: Termcomparisons inﬁrst-ordersimilaritymeasures.

Querying and Merging Heterogeneous Data by Approximate Joins on Higher-Order Terms

https://research-information.bris.ac.uk/files/9581171/approxjoin.pdf

Querying and Merging Heterogeneous Data by Approximate Joins on Higher-Order Terms

Abstract

Similar works

Full text

Available Versions

Explore Bristol Research