MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • Singapore-MIT Alliance (SMA)
  • Computer Science (CS)
  • View Item
  • DSpace@MIT Home
  • Singapore-MIT Alliance (SMA)
  • Computer Science (CS)
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Keyword Join: Realizing Keyword Search for Information Integration

Author(s)
Yu, Bei; Liu, Ling; Ooi, Beng Chin; Tan, Kian Lee
Thumbnail
DownloadCS012.pdf (230.7Kb)
Metadata
Show full item record
Abstract
Information integration has been widely addressed over the last several decades. However, it is far from solved due to the complexity of resolving schema and data heterogeneities. In this paper, we propose out attempt to alleviate such difficulty by realizing keyword search functionality for integrating information from heterogeneous databases. Our solution does not require predefined global schema or any mappings between databases. Rather, it relies on an operator called keyword join to take a set of lists of partial answers from different data sources as input, and output a list of results that are joined by the tuples from input lists based on predefined similarity measures as integrated results. Our system allows source databases remain autonomous and the system to be dynamic and extensible. We have tested our system with real dataset and benchmark, which shows that our proposed method is practical and effective.
Date issued
2006-01
URI
http://hdl.handle.net/1721.1/30263
Series/Report no.
Computer Science (CS)
Keywords
keyword join, keyword query, data integration, database

Collections
  • Computer Science (CS)

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.