1. A world-wide database for travellers records information on 500,000 restaurants, 100 restaurant chains, and 1000 restaurant districts.

    Some, but certainly not all, of the restaurants belong to chains. Some, but certainly not all, of the restaurants are in restaurant districts.

    The fields stored should include RestName, Address, TC (whether the restaurant is in town or in the country), Cuisine (e.g., Afghanistani, Greek, Hamburger), PriceRange (low/medium/high), ChainName and HeadQuarters of the chain, District, City of the district, and South, West, North and East streets bounding the district.

    The database should be able to answer queries such as ``Find all restaurants in Montréal [ Address] serving medium-priced Lebanese food'', or ``Find the district with the most low-priced restaurants'', or ``Find all the districts which have a McDonald's''. Other queries should also be possible: the files should be designed for flexibility.

    Furthermore, the agency maintaining the database should be able to add new restaurants, districts and chains.

    Using the categories on which the course is based, and making appropriate calculations approximately, design files to support the above matching. Calculate file sizes, and estimate the time to do the match. Assume a disk with 2 sec. (microseconds) transfer time per byte and 20 msec. (milliseconds) average seek time.