research-article

A framework for semantic link discovery over relational data

Authors:

Oktie Hassanzadeh,

Anastasios Kementsietsidis,

Renée J. Miller,

Min WangAuthors Info & Claims

CIKM '09: Proceedings of the 18th ACM conference on Information and knowledge management

Pages 1027 - 1036

https://doi.org/10.1145/1645953.1646084

Published: 02 November 2009 Publication History

Abstract

Discovering links between different data items in a single data source or across different data sources is a challenging problem faced by many information systems today. In particular, the recent Linking Open Data (LOD) community project has highlighted the paramount importance of establishing semantic links among web data sources. Currently, LOD sources provide billions of RDF triples, but only millions of links between data sources. Many of these data sources are published using tools that operate over relational data stored in a standard RDBMS. In this paper, we present a framework for discovery of semantic links from relational data. Our framework is based on declarative specification of linkage requirements by a user. We illustrate the use of our framework using several link discovery algorithms on a real world scenario. Our framework allows data publishers to easily find and publish high-quality links to other data sources, and therefore could significantly enhance the value of the data in the next generation of web.

References

[1]

A. Arasu, V. Ganti, and R. Kaushik. Efficient Exact Set-Similarity Joins. In Proc. of the Int'l Conf. on Very Large Data Bases (VLDB), pages 918--929, 2006.

Digital Library

[2]

S. Auer, S. Dietzold, J. Lehmann, S. Hellmann, and D. Aumueller. Triplify: Light-Weight Linked Data Publication from Relational Databases. In Int'l World Wide Web Conference (WWW), pages 621--630, 2009.

Digital Library

[3]

R. J. Bayardo, Y. Ma, and R. Srikant. Scaling Up All Pairs Similarity Search. In Int'l World Wide Web Conference (WWW), pages 131--140, Banff, Canada, 2007.

Digital Library

[4]

I. Bhattacharya and L. Getoor. Query-time Entity Resolution. Journal of Artificial Intelligence Research (JAIR), 30:621--657, 2007.

Digital Library

[5]

A. Bilke, J. Bleiholder, C. Böhm, K. Draba, F. Naumann, and M. Weis. Automatic Data Fusion with HumMer. In Proc. of the Int'l Conf. on Very Large Data Bases (VLDB), pages 1251--1254, 2005.

Digital Library

[6]

C. Bizer, T. Heath, and T. Berners-Lee. Linked Data: Principles and State of the Art. In Int'l World Wide Web Conference (WWW), November 2008.

[7]

C. Bizer and A. Seaborne. D2RQ -- Treating Non-RDF Databases as Virtual RDF Graphs. In Proc. of the Int'l Semantic Web Conference (ISWC), November 2004.

[8]

S. Das, E. I. Chong, G. Eadon, and J. Srinivasan. Supporting Ontology-Based Semantic matching in RDBMS. In Proc. of the Int'l Conf. on Very Large Data Bases (VLDB), pages 1054--1065, 2004.

Digital Library

[9]

S. Dill, N. Eiron, D. Gibson, D. Gruhl, R. Guha, A. Jhingran, T. Kanungo, S. Rajagopalan, A. Tomkins, J. A. Tomlin, and J. Y. Zien. SemTag and Seeker: Bootstrapping the Semantic Web via Automated Semantic Annotation. In Int'l World Wide Web Conference (WWW), 2003.

Digital Library

[10]

A. K. Elmagarmid, P. G. Ipeirotis, and V. S. Verykios. Duplicate Record Detection: A Survey. IEEE Transactions on Knowledge and Data Engineering, 19(1):1--16, 2007.

Digital Library

[11]

H. Galhardas, D. Florescu, D. Shasha, E. Simon, and C.-A. Saita. Declarative Data Cleaning: Language, Model, and Algorithms. In Proc. of the Int'l Conf. on Very Large Data Bases (VLDB), pages 371--380, 2001.

Digital Library

[12]

L. Gravano, P. G. Ipeirotis, H. V. Jagadish, N. Koudas, S. Muthukrishnan, and D. Srivastava. Approximate String Joins in a Database (Almost) for Free. In Proc. of the Int'l Conf. on Very Large Data Bases (VLDB), pages 491--500, 2001.

Digital Library

[13]

O. Hassanzadeh. Benchmarking Declarative Approximate Selection Predicates. Master's thesis, University of Toronto, February 2007.

[14]

P. Indyk, R. Motwani, P. Raghavan, and S. Vempala. Locality-Preserving Hashing in Multidimensional Spaces. In ACM Symp. on Theory of Computing (STOC), pages 618--625, 1997.

Digital Library

[15]

A. Kementsietsidis, L. Lim, and M. Wang. Supporting Ontology-based Keyword Search over Medical Databases. In Proceedings of the AMIA 2008 Symposium, pages 409--13. American Medical Informatics Association, 2008.

Cited By

Idrissou Avan Harmelen Fvan den Besselaar PFaron CGhidini C(2021)Network metrics for assessing the quality of entity resolution between multiple datasetsSemantic Web10.3233/SW-20041012:1(21-40)Online publication date: 1-Jan-2021
https://dl.acm.org/doi/10.3233/SW-200410
Selvaraj PBurugari VSumathi DNayak RTripathy R(2019)Ontology based Recommendation System for Domain Specific Seekers2019 Third International conference on I-SMAC (IoT in Social, Mobile, Analytics and Cloud) (I-SMAC)10.1109/I-SMAC47947.2019.9032634(341-345)Online publication date: Dec-2019
https://doi.org/10.1109/I-SMAC47947.2019.9032634
Dong BAggarwal CYu P(2019)The Link Regression Problem in Graph Streams2019 IEEE International Conference on Big Data (Big Data)10.1109/BigData47090.2019.9006225(1088-1095)Online publication date: Dec-2019
https://doi.org/10.1109/BigData47090.2019.9006225
Show More Cited By

Index Terms

A framework for semantic link discovery over relational data
1. Information systems
  1. Data management systems
    1. Database design and models
      1. Relational database model
    2. Query languages
      1. Relational database query languages

Recommendations

A declarative framework for semantic link discovery over relational data
WWW '09: Proceedings of the 18th international conference on World wide web

In this paper, we present a framework for online discovery of semantic links from relational data. Our framework is based on declarative specification of the linkage requirements by the user, that allows matching data items in many real-world scenarios. ...
Collaborative semantic association discovery from linked data
IRI'09: Proceedings of the 10th IEEE international conference on Information Reuse & Integration

The efforts of publishing and interlinking structured data on the Semantic Web will result in a global network of databases, or the Linked Data, which provides huge potential for discovering hidden relationships. We present a multi-agent framework for ...
A domain independent framework for extracting linked semantic data from tables
Search Computing

Vast amounts of information is encoded in tables found in documents, on the Web, and in spreadsheets or databases. Integrating or searching over this information benefits from understanding its intended meaning and making it explicit in a semantic ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

CIKM '09: Proceedings of the 18th ACM conference on Information and knowledge management

November 2009

2162 pages

ISBN:9781605585123

DOI:10.1145/1645953

General Chairs:
David Cheung
University of Hong Kong, Hong Kong
,
Il-Yeol Song
Drexel University, USA
,
Program Chairs:
Wesley Chu
UCLA, USA
,
Xiaohua Hu
Drexel University, USA
,
Jimmy Lin
University of Maryland, USA

Copyright © 2009 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 02 November 2009

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

CIKM '09

Sponsor:

CIKM '09: Conference on Information and Knowledge Management

November 2 - 6, 2009

Hong Kong, China

Acceptance Rates

Overall Acceptance Rate 1,861 of 8,427 submissions, 22%

Upcoming Conference

CIKM '25

Sponsor:
sigir
sigir

The 34th ACM International Conference on Information and Knowledge Management

November 10 - 14, 2025

Seoul , Republic of Korea

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

40
Total Citations
View Citations
742
Total Downloads

Downloads (Last 12 months)10
Downloads (Last 6 weeks)1

Reflects downloads up to 30 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Idrissou Avan Harmelen Fvan den Besselaar PFaron CGhidini C(2021)Network metrics for assessing the quality of entity resolution between multiple datasetsSemantic Web10.3233/SW-20041012:1(21-40)Online publication date: 1-Jan-2021
https://dl.acm.org/doi/10.3233/SW-200410
Selvaraj PBurugari VSumathi DNayak RTripathy R(2019)Ontology based Recommendation System for Domain Specific Seekers2019 Third International conference on I-SMAC (IoT in Social, Mobile, Analytics and Cloud) (I-SMAC)10.1109/I-SMAC47947.2019.9032634(341-345)Online publication date: Dec-2019
https://doi.org/10.1109/I-SMAC47947.2019.9032634
Dong BAggarwal CYu P(2019)The Link Regression Problem in Graph Streams2019 IEEE International Conference on Big Data (Big Data)10.1109/BigData47090.2019.9006225(1088-1095)Online publication date: Dec-2019
https://doi.org/10.1109/BigData47090.2019.9006225
Sekhavat YParsons J(2019)CDI: Configurable Data Integration Using Property Precedence RelationsJournal on Data Semantics10.1007/s13740-019-00101-7Online publication date: 18-Feb-2019
https://doi.org/10.1007/s13740-019-00101-7
Vidhya KGeetha T(2018)Entity resolution framework using rough set blocking for heterogeneous web of dataJournal of Intelligent & Fuzzy Systems10.3233/JIFS-1794634:1(659-675)Online publication date: 12-Jan-2018
https://doi.org/10.3233/JIFS-17946
Miller R(2018)Open data integrationProceedings of the VLDB Endowment10.14778/3229863.324049111:12(2130-2139)Online publication date: 1-Aug-2018
https://dl.acm.org/doi/10.14778/3229863.3240491
Lu WDai HZhang ZWu CZhuang Y(2018)Active instance matching with pairwise constraints and its application to Chinese knowledge base constructionKnowledge and Information Systems10.1007/s10115-017-1076-755:1(171-214)Online publication date: 1-Apr-2018
https://dl.acm.org/doi/10.1007/s10115-017-1076-7
Idrissou Avan Harmelen Fvan den Besselaar P(2018)Network Metrics for Assessing the Quality of Entity Resolution Between Multiple DatasetsKnowledge Engineering and Knowledge Management10.1007/978-3-030-03667-6_10(147-162)Online publication date: 31-Oct-2018
https://doi.org/10.1007/978-3-030-03667-6_10
Idrissou AHoekstra Rvan Harmelen FKhalili Avan den Besselaar P(2017)Is my:sameAs the same as your:sameAs?Proceedings of the 9th Knowledge Capture Conference10.1145/3148011.3148029(1-8)Online publication date: 4-Dec-2017
https://dl.acm.org/doi/10.1145/3148011.3148029
Burdick DFagin RKolaitis PPopa LTan W(2016)A Declarative Framework for Linking EntitiesACM Transactions on Database Systems10.1145/289474841:3(1-38)Online publication date: 18-Jul-2016
https://dl.acm.org/doi/10.1145/2894748
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents