CS764 Project Report - Linear Hashing in MINIREL

Weiqing Huang

Computer Sciences Department
University of Wisconsin
Madison, WI 73706
whuang@cs.wisc.edu

May 12, 1995

=0 pt

• Introduction
• External Interface
  • LinearHashingFile
    • LinearHashingFile(Status& status, const char* name, const int length,const AttrType type, const int N = 1)
      LinearHashingFile(Status& status, const char * name)
    • ~LinearHashingFile()
    • Status destroyFile(void)
    • Status insert(const void* value, const RID rid)
    • Status Delete(const void* value, const RID rid)
    • IndexFileScan * new_scan(const void* value)
    • void PrintHeader()
      void PrintBucket()
      void PrintBucket(int BucNum)
      
  • LinearHashingScan
    • ~LinearHashingScan()
    • Status get_next(RID& rid)
    • Status delete_current()
  • Downward interfaces
• Internal Design
  • Algorithm
  • Data Structure
  • Create/Open index
  • Destroy index
  • Directory handling
  • Insert records
  • Delete records
  • Open an exact match scan
  • Get the next record satisfies the scan
  • Delete the currently scanned record
  • Concurrency Control
  • Recovery
• Accomplishments
• Testing
• Retrospective
• Appendix
• References
• About this document ...