| Popis: |
In this paper, we propose an efficient iconic indexing strategy called bit-pattern-based matrix (BP matrix) for symbolic pictures, in which each spatial relationship between any two objects along the x-axis (or y-axis) is represented as a binary-bit pattern, and is recorded in a matrix. There are 12 bits in each bit pattern. When the bits in a certain subset of those 12 bits are set to 1, they denote a certain spatial relationship. Bit-wise-and/bit-wise-or operations are used for query processing; therefore, they are efficient enough as compared to the previous approaches. From our simulation, we show that the proposed BP matrix strategy requires shorter time for query processing than the generalized prime-number-based matrix strategy. |
Full Text from ScienceDirect