NDLI: On schema matching with opaque column names and data values

Please wait, while we are loading the content...

Improving the efficiency of database-system teaching

Querying structured text in an XML database

Distributed top-k monitoring

Spreadsheets in RDBMS for OLAP

Winnowing: local algorithms for document fingerprinting

ViST: a dynamic index method for querying XML data by tree structures

Rondo: a programming platform for generic model management

Extended wavelets for multiple measures

Chain: operator scheduling for memory minimization in data stream systems

Capturing both types and constraints in data integration

Efficient similarity search and classification via rank aggregation

Mapping data in peer-to-peer systems: semantics and algorithmic issues

Factorizing complex predicates in queries to exploit indexes

A theory of redo recovery

Stream processing of XPath queries with predicates

Location-based spatial queries

The design of an acquisitional query processor for sensor networks

Composing XSL transformations with XML publishing views

Adaptive filters for continuous queries over distributed data streams

Using sets of feature vectors for similarity search on voxelized CAD objects

On relational support for XML publishing: beyond sorting and tagging

Multi-dimensional clustering: a new data layout scheme in DB2

Integration of electronic tickets and personal guide system for public transport using mobile terminals

WinMagic: subquery elimination using window aggregation

CMVF: a novel dimension reduction scheme for efficient indexing in a large image database

PeerDB: peering into personal databases

Transparent mid-tier database caching in SQL server

QXtract: a building block for efficient information extraction from text databases

STREAM: the stanford stream data manager (demonstration description)

LockX: a system for efficiently querying secure XML

A system for watermarking relational databases

Panel: querying networked databases

The Lowell report

Data quality and data cleaning: an overview

XQuery: a query language for XML

XRANK: ranked keyword search over XML documents

Approximate join processing over data streams

QC-trees: an efficient summary structure for semantic OLAP

Information sharing across private databases

XPRESS: a queriable compression for XML data

On schema matching with opaque column names and data values

Spectral bloom filters

Processing set expressions over continuous update streams

Exchanging intensional XML data

Robust and efficient fuzzy match for online data cleaning

Extracting structured data from Web pages

Estimating compilation time of a query optimizer

Formal semantics and analysis of object queries

XPath queries on streaming data

Hardware acceleration for spatial selections and joins

Cache-and-query for wide area sensor databases

Dynamic XML documents with distribution and replication

A framework for diagnosing changes in evolving data streams

QCluster: relevance feedback using adaptive clustering for content-based image retrieval

A comprehensive XQuery to SQL translation using dynamic interval encoding

Gigascope: a stream database for network applications

SOCQET: semantic OLAP with compressed cube and summarization

GridDB: a relational interface for the grid

DBCache: middle-tier database caching for highly scalable e-business architectures

PIX: exact and approximate phrase matching in XML

Aurora: a data stream management system

TREX: DTD-conforming XML to XML transformations

Query by humming: in action with its technology revealed

Data grid management systems

Rights protection for relational data

D(k)-index: an adaptive structural summary for graph-structured data

Statistical schema matching across web query interfaces

Scientific data repositories: designing for a moving target

A characterization of the sensitivity of query optimization to storage access cost parameters

An optimal and progressive algorithm for skyline queries

Dynamic sample selection for approximate query processing

Abstracts of invited industrial track presentations

IrisNet: Internet-scale resource-intensive sensor services

Rainbow: multi-XQuery optimization using materialized XML views

PLASTIC: reducing query optimization overheads through plan recycling

Containment join size estimation: models and methods

Contorting high dimensional data for efficient main memory KNN processing

Evaluating probabilistic queries over imprecise data

TelegraphCQ: continuous dataflow processing

TIMBER: a native system for querying XML

IPSOFACTO: a visual correlation tool for aggregate network traffic data

Efficient processing of joins on set-valued attributes

ROLEX: relational on-line exchange with XML

BIRN-M: a semantic mediator for solving real-world neuroscience problems

Temporal coalescing with now granularity, and incomplete information

Warping indexes with envelope transforms for query by humming

On schema matching with opaque column names and data values

Content Provider	ACM Digital Library
Author	Kang, Jaewoo Naughton, Jeffrey F.
Abstract	Most previous solutions to the schema matching problem rely in some fashion upon identifying "similar" column names in the schemas to be matched, or by recognizing common domains in the data stored in the schemas. While each of these approaches is valuable in many cases, they are not infallible, and there exist instances of the schema matching problem for which they do not even apply. Such problem instances typically arise when the column names in the schemas and the data in the columns are "opaque" or very difficult to interpret. In this paper we propose a two-step technique that works even in the presence of opaque column names and data values. In the first step, we measure the pair-wise attribute correlations in the tables to be matched and construct a dependency graph using mutual information as a measure of the dependency between attributes. In the second stage, we find matching node pairs in the dependency graphs by running a graph matching algorithm. We validate our approach with an experimental study, the results of which suggest that such an approach can be a useful addition to a set of (semi) automatic schema matching techniques.
Starting Page	205
Ending Page	216
Page Count	12
File Format	PDF
ISBN	158113634X
DOI	10.1145/872757.872783
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2003-06-09
Publisher Place	New York
Access Restriction	Subscribed
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in