Approximate Membership Localization (AML) for web-based join

Zhixu Li*, Laurianne Sitbon, Liwei Wang, Xiaofang Zhou, Xiaoyong Du

*Corresponding author for this work

Research output: Chapter in Book/Conference Proceeding/ReportConference Paper published in a bookpeer-review

2 Citations (Scopus)

Abstract

In this paper, we propose a search-based approach to join two tables in the absence of clean join attributes. Non-structured documents from the web are used to express the correlations between a given query and a reference list. To implement this approach, a major challenge we meet is how to efficiently determine the number of times and the locations of each clean reference from the reference list that is approximately mentioned in the retrieved documents. We formalize the Approximate Membership Localization (AML) problem and propose an efficient partial pruning algorithm to solve it. A study using real-word data sets demonstrates the effectiveness of our search-based approach, and the efficiency of our AML algorithm.

Original languageEnglish
Title of host publicationCIKM'10 - Proceedings of the 19th International Conference on Information and Knowledge Management and Co-located Workshops
Pages1321-1324
Number of pages4
DOIs
Publication statusPublished - 2010
Externally publishedYes
Event19th International Conference on Information and Knowledge Management and Co-located Workshops, CIKM'10 - Toronto, ON, Canada
Duration: 26 Oct 201030 Oct 2010

Publication series

NameInternational Conference on Information and Knowledge Management, Proceedings

Conference

Conference19th International Conference on Information and Knowledge Management and Co-located Workshops, CIKM'10
Country/TerritoryCanada
CityToronto, ON
Period26/10/1030/10/10

Keywords

  • AML
  • Approximate join
  • Approximate membership location
  • Web-based join

Fingerprint

Dive into the research topics of 'Approximate Membership Localization (AML) for web-based join'. Together they form a unique fingerprint.

Cite this