Please use this identifier to cite or link to this item:
|Title:||Bitmap R-trees||Authors:||Ang, C.H.
|Issue Date:||2000||Citation:||Ang, C.H.,Tan, S.T.,Tan, T.C. (2000). Bitmap R-trees. Informatica (Ljubljana) 24 (2) : 205-209. ScholarBank@NUS Repository.||Abstract:||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%.||Source Title:||Informatica (Ljubljana)||URI:||http://scholarbank.nus.edu.sg/handle/10635/39218||ISSN:||03505596|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Apr 8, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.