Relational database schemas must be semantically enriched to reflect knowledge about the data, as needed by many applications. One technique is the analysis of the database extension, extracting existing data dependencies. In this paper, new algorithms to extract functional and inclusion dependencies are presented; they are designed to minimize the number of disk accesses.