Browsing by Author "Tuck Choy TAN"

Now showing 1 - 2 of 2
  • No Thumbnail Available
    Item
    Bitmap R-trees
    (1999-05-01T00:00:00Z) Chuan Heng ANG; Tuck Choy TAN
    Bitmap R-tree is a variant of R-tree in which bitmaps are used for the description of the internal and the external regions of the objects in addition to the use of minimum bounding rectangles. The proposed scheme increases the chance of trivial acceptance and rejection of data objects, and reduces unnecessary disk accesses in query processing. It has been shown that with the bitmaps as filters, the reference to the object data file can be cut down by as much as 60%.
  • No Thumbnail Available
    Item
    Filtered Linear Hashing
    (1999-05-01T00:00:00Z) Chuan Heng ANG; Tuck Choy TAN
    Filtered linear hashing is a combination of linear hashing and filtered hashing. It expands the file gracefully as linear hashing, and organizes the overflow buckets with the use of a filter buffer to ensure that any bucket can be retrieved in one disk access. At a load factor of 0.7, the cost of file creation is reduced by 15% as opposed to linear hashing, with higher cost saving for larger load factors.