• Heap
    • records are in no particular order
    • insert can simple add record to the last sector
    • find, findnext, nearest neighbor scan the entire files
  • Ordered
    • records are sorted by a selected field
    • findnext can simply pick up physically next record
    • find, insert, delete may use binary search, is is very efficient
    • nearest neighbor processed as a range query
Heap

Última modificación: Thursday, 24 de November de 2005, 15:17