Indexing Incomplete Databases

摘要: Incomplete databases, that is, databases are missing data, present in many research domains. It is important to derive techniques access these efficiently. We first show known indexing for multi-dimensional data search break down terms of performance when indexed attributes contain data. This paper utilizes two popularly employed techniques, bitmaps and quantization, correctly efficiently answer queries the presence Query execution interval evaluation formalized structures based on whether considered be a query match or not. The Bitmap indexes quantization evaluated compared over variety analysis parameters real synthetic sets. Insights into conditions which use each technique provided.