Relational database management systems manages the tables with predefined indexes. In RDBMS indexes are created on the basis of attribute values. The Imine indexing scheme is used to index item sets in relational databases. The index creation is performed with out any constraints. IMine provides a complete representation of the original database. The Imine indexing scheme reduces the input/outp...

Caches hide the growing latency of accesses to the main memory from the processor by storing the most recently used data on-chip. To limit the search time through the caches, they are organized in a direct mapped or set-associative way. Such an organization introduces many conflict misses that hamper performance. This paper studies randomizing set index functions, a technique to place the data ...

Randomising set index functions, randomisation functions for short, can significantly reduce conflict misses in data caches by placing cache blocks in a conflict-free manner. XOR-based functions are a broad class of functions that generally exhibit few conflict misses. Topham and González claimed that the sub-class of functions based on division of polynomials over contains those functions that...

Previous fixed point indexes defined for a set-valued map in an infinite-dimensional space have required the values of this map to be convex sets. The corresponding assumption of this paper is that the values be (co-)acyclic sets, i.e., that the reduced Alexander cohomology group of each of these sets be trivial in each dimension. Other assumptions are that the space is locally convex and that ...