作者: Beng Chin Ooi , Kian-Lee Tan , Cheng Hian Goh
DOI:
关键词:
摘要: We propose and evaluate two indexing schemes for improving the efficiency of data retrieval in high-dimensional databases that are incomplete. These novel search keys may contain missing attribute values. The first is a multi-dimensional index structure, called Bitstring-augmented R-tree (BR-tree), whereas second comprises family multiple one-dimensional one-attribute (MOSAIC) indexes. Our results show both can be superior over exhaustive search. Experimental suggest BRtrees have lower update storage costs able to support range queries more efficiently under most circumstances, when compared MOSAIC scheme. However, contrary conventional wisdom, structure outperforms BR-tree time point queries, as well incomplete dimension-unrestricted distributions.