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

S Price; PA Flach

doi:10.1007/978-3-540-85928-4_19

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

S Price, PA Flach

Research output: Chapter in Book/Report/Conference proceeding › Conference Contribution (Conference Proceeding)

2 Citations (Scopus)

332 Downloads (Pure)

Abstract

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.

Translated title of the contribution	Querying and Merging Heterogeneous Data by Approximate Joins on Higher-Order Terms
Original language	English
Title of host publication	Inductive Logic Programming
Subtitle of host publication	18th International Conference, ILP 2008 Prague, Czech Republic, September 10-12, 2008 Proceedings
Pages	226 - 243
Number of pages	18
Volume	5194
ISBN (Electronic)	978-3-540-85928-4
DOIs	https://doi.org/10.1007/978-3-540-85928-4_19
Publication status	Published - Sept 2008
Event	18th International Conference, ILP 2008 Prague, Czech Republic, September 10-12, 2008 Proceedings - Prague, United Kingdom Duration: 10 Sept 2008 → 12 Sept 2008

Conference

Conference	18th International Conference, ILP 2008 Prague, Czech Republic, September 10-12, 2008 Proceedings
Country/Territory	United Kingdom
City	Prague
Period	10/09/08 → 12/09/08

Bibliographical note

Editors: F. Zelezny and N. Lavrac
ISBN: 9783540859277
Publisher: Springer-Verlag Berlin Heidelberg
Name and Venue of Conference: Proceedings of 18th International Conference on Inductive Logic Programming, ILP 2008, Prague, Czech Republic
Conference Organiser: Czech Technical University
Other: http://ida.felk.cvut.cz/ilp2008/

Access to Document

10.1007/978-3-540-85928-4_19

ApproxjoinAccepted author manuscript, 219 KB

Handle.net

Persistent link

Cite this

@inproceedings{2e8b918a42dd423395837acd14e8be30,

title = "Querying and Merging Heterogeneous Data by Approximate Joins on Higher-Order Terms",

abstract = "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. ",

author = "S Price and PA Flach",

note = "Editors: F. Zelezny and N. Lavrac ISBN: 9783540859277 Publisher: Springer-Verlag Berlin Heidelberg Name and Venue of Conference: Proceedings of 18th International Conference on Inductive Logic Programming, ILP 2008, Prague, Czech Republic Conference Organiser: Czech Technical University Other: http://ida.felk.cvut.cz/ilp2008/; 18th International Conference, ILP 2008 Prague, Czech Republic, September 10-12, 2008 Proceedings ; Conference date: 10-09-2008 Through 12-09-2008",

year = "2008",

month = sep,

doi = "10.1007/978-3-540-85928-4_19",

language = "English",

isbn = "978-3-540-85927-7",

volume = "5194",

pages = "226 -- 243",

booktitle = "Inductive Logic Programming",

}

Price, S & Flach, PA 2008, Querying and Merging Heterogeneous Data by Approximate Joins on Higher-Order Terms. in Inductive Logic Programming: 18th International Conference, ILP 2008 Prague, Czech Republic, September 10-12, 2008 Proceedings. vol. 5194, pp. 226 - 243, 18th International Conference, ILP 2008 Prague, Czech Republic, September 10-12, 2008 Proceedings, Prague, United Kingdom, 10/09/08. https://doi.org/10.1007/978-3-540-85928-4_19

Querying and Merging Heterogeneous Data by Approximate Joins on Higher-Order Terms. / Price, S ; Flach, PA.
Inductive Logic Programming: 18th International Conference, ILP 2008 Prague, Czech Republic, September 10-12, 2008 Proceedings. Vol. 5194 2008. p. 226 - 243.

Research output: Chapter in Book/Report/Conference proceeding › Conference Contribution (Conference Proceeding)

TY - GEN

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

AU - Price, S

AU - Flach, PA

N1 - Editors: F. Zelezny and N. Lavrac ISBN: 9783540859277 Publisher: Springer-Verlag Berlin Heidelberg Name and Venue of Conference: Proceedings of 18th International Conference on Inductive Logic Programming, ILP 2008, Prague, Czech Republic Conference Organiser: Czech Technical University Other: http://ida.felk.cvut.cz/ilp2008/

PY - 2008/9

Y1 - 2008/9

N2 - 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.

AB - 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.

U2 - 10.1007/978-3-540-85928-4_19

DO - 10.1007/978-3-540-85928-4_19

M3 - Conference Contribution (Conference Proceeding)

SN - 978-3-540-85927-7

VL - 5194

SP - 226

EP - 243

BT - Inductive Logic Programming

T2 - 18th International Conference, ILP 2008 Prague, Czech Republic, September 10-12, 2008 Proceedings

Y2 - 10 September 2008 through 12 September 2008

ER -

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

Abstract

Conference

Bibliographical note

Access to Document

Handle.net

Fingerprint

Cite this