Searching Databases for Semantically-related Schemas

Gauri Shah, Tanveer Syeda-Mahmood

Twenty-Seventh Annual International ACM SIGIR, July 2004, pp. 504-505.

Abstract

In this paper, we address the problem of searching schema databases for semantically-related schemas. We first give a method of finding semantic similarity between pair-wise schemas based on tokenization, part-of-speech tagging, word expansion, and ontology matching. We then address the problem of indexing the schema database through a semantic hash table. Matching schemas in the database are found by hashing the query attributes and recording peaks in the histogram of schema hits. Results indicated a 90% improvement in search performance while maintaining high precision and recall.


Bibtex:
@inproceedings{ShahS2004,
title="Searching Databases for Semantically-related Schemas",
author="Gauri Shah and Tanveer Syeda-Mahmood",
booktitle="Twenty-Seventh Annual ACM SIGIR",
month={25--29~} #jul,
year="2004",
pages="504--505",
address={Sheffield, UK},
}