Abstract
This chapter presents a new indexing scheme, the Subspace Coding Method (SCM), that offers high performance similarity retrieval. Indices in the R-tree family generate tree structure using MBRs (Minimum bounding rectangles) or MBSs (Minimum bounding spheres). Our proposed method is based on tree structure using MBRs (i.e. the R-tree, the R*-tree, the X-tree and so on), and newly introduced the notion of VBR (Virtual Bounding Rectangle). VBRs are rectangles which contain and approximate MBRs. Importantly, the notion of VBR is orthogonal to any other method in the field of spatial search and is introduced into any spatial indices using MBRs. Furthermore, we have introduced the Subspace Coding Method, which can compactly represent VBR. The performance evaluation shows the superiority of our method for high-dimensional data.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
