1. The document discusses three primary methods for storing data in a database: sequential storage, index tables, and direct/hashed key storage. 2. Sequential storage stores each row in a predefined order, allowing for fixed data retrieval but slowing down finding arbitrary rows. Index tables use pointers to link key values to data, allowing for faster random access but requiring reorganizing indexes on data changes. 3. Direct/hashed key storage converts key values into storage locations using a hashing function, allowing very fast random access but no sequential retrieval and potential collisions from multiple keys hashing to the same location.