# Overview A file used to store the rows of a database, typically in no particular order. The [[Database Index]] would be used to find the location of a row in the heap file. # Key Considerations # Pros - Efficient for updating data in-place, as long as the new data isn't larger (i.e., can fit in the same location as the current row) # Cons - Less efficient for reads compared to an approach that uses a [[Clustered Index]], since there is an extra hop from the index to the data with the row # Use Cases # Related Topics