Database Exploration Using Join Paths
- 1 April 2008
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1331-1333
Abstract
Complex database schemas are challenging to explore and query, due to the exponentially many sequences of join edges in the schema graph, not all of which result in valid join paths. The problem becomes even more difficult when tables exhibit structural heterogeneity, i.e., different join paths are meaningful for different subsets of tuples in the same table. In this paper, we propose effective ways to identify meaningful join paths in complex schemas, and to compute the probability with which different destination tables are reached via join paths from a given source table.Keywords
This publication has 6 references indexed in Scilit:
- Rapid Identification of Column HeterogeneityIEEE International Conference on Data Mining (ICDM), 2006
- Contextual search and name disambiguation in email using graphs2006
- Graph-based synopses for relational selectivity estimation2006
- Effective keyword search in relational databases2006
- Efficient discovery of functional and approximate dependencies using partitions2002
- Mining database structure; or, how to build a data quality browser2002