Finding Hidden Structures in Relational Databases
نویسنده
چکیده
Relational database management systems have been widely used over decades. An important research issue is to find hidden structural information in large relational databases. By hidden structural information we mean the information that cannot be easily found using a traditional query language SQL. In this talk, we discuss how to find hidden structural information in a relational database by viewing a relational database as a large directed graph where nodes represent tuples and edges represent foreign key references between tuples in the database. We discuss how to find trees and communities in such a large graph for user-given keywords. We also discuss how to find frequent and additional keywords associated with the structures identified in a relational database using SQL.
منابع مشابه
Relational Databases Query Optimization using Hybrid Evolutionary Algorithm
Optimizing the database queries is one of hard research problems. Exhaustive search techniques like dynamic programming is suitable for queries with a few relations, but by increasing the number of relations in query, much use of memory and processing is needed, and the use of these methods is not suitable, so we have to use random and evolutionary methods. The use of evolutionary methods, beca...
متن کاملDigitArq: creating and managing a digital archive
In this paper we present the steps followed in a project called DigitArq that aimed at building a centralised repository for archival finding aids. At the O’Porto’s District Archive, finding aids existed in several different formats and media. Migration was used to convert all the finding aids into a single normalised format based on an international standard – EAD/XML. After migration, archiva...
متن کاملA Hidden Markov Model Approach to Keyword-Based Search over Relational Databases
We present a novel method for translating keyword queries over relational databases into SQL queries with the same intended semantic meaning. In contrast to the majority of the existing keyword-based techniques, our approach does not require any a-priori knowledge of the data instance. It follows a probabilistic approach based on a Hidden Markov Model for computing the top-K best mappings of th...
متن کاملHidden Structure: Indirect Measurement of Relational Representation
Structured mental representations underlie much of human cognitive ability. However, research has repeatedly found that people are generally quite poor at spontaneously applying structure acquired from one kind of situation to a dissimilar domain. This would seem to present a serious impediment to learning abstract structures experientially. The current study employs a novel approach designed t...
متن کاملOWL Ontology Extraction from Relational Databases via Database Reverse Engineering
The main purpose of the Semantic Web is driving the evolution of the current Web by enabling users to find, share, and combine information more easily. OWL ontologies play a key role in this effort. It is widely believed that the majority of current Web data sources are powered by relational databases (RDB). Thus developing approaches and tools for extracting OWL ontologies from RDB is helpful ...
متن کامل