Storage and Querying of Large Persistent Arrays

The scientic and analytical applications today are increasingly becoming data in-\ud tensive. Many such applications deal with data that is multidimensional in nature.\ud Traditionally, relational database systems have been used by many data intensive\ud application, and relational paradigm has proved to be both natural and ecient.\ud However, for multidimensional data, when the number of dimensions becomes large,\ud relational databases are inecient both in terms of storage and query response time.\ud In this thesis, we explore linearised storage, and indexed and skiplist based retrieval\ud on persistent arrays. The application programs are provided with a logical view of\ud multidimensional array. The techniques have been implemented in a home-grown\ud database management system called MuBase