A Structure Based on B+ Trees to Represent a Large Number of k-Multisets Stored in Non-volatile Memory
摘要
The article concerns database issues, including the model of physical data composition for self-organising data structures. It is assumed that these structures will be used to represent the k-multiset and store large numbers of B+ trees in non-volatile memory. The work presents the results achieved as part of a research project on the definition of the database metamodel. It is dedicated to the issues of modelling structures based on very elementary concepts, i.e. sets of tuples storing data and structures storing the connections between these tuples.