Abstract

The IP-index [5] is a dynamic indexing technique for large 1-D data sequences which can be used to query implicit values under various interpolation assumptions. This index has been implemented in an object-relational main-memory database (AMOS [3]) and showed good performance [5]. In this report we document the work of implementing the IP-index in an object-oriented and disk-based database system named SHORE [2].

Ling Lin
Engineering Databases and System Laboratory
Department of Computer and Information Science
Linköpings Universitet
Linköping, Sweden

Reference:

[2] Michael J. Carey, David J. Dewitt, Michael J. Franklin, Nancy E. Hall, Mark L. McAuliffe, Jeffrey F. Naughton, Daniel T. Schuh, Marvin H. Solomon, C. K. Tan, Odysseas G. Tsatalos, Seth J. White, Michael J. Zwilling, "Shoring Up Persistent Applications", in Proceeding of the 1994 ACM-SIGMOD Conf. on the Management of Data, Minneapolis, MN, May 1994.

[3] G. Fahl, T. Risch and M. Sköld: "An architecture for Active Mediators", in Proc. Intl. Workshop on Next Generation Information Technologies and Systems, pp. 47-53, Haifa, Israel, 1993.

[5] L. Lin, T. Risch, M. Sköld, D. Badal, "Indexing Values of Time Sequences", in Proceedings of 5th International Conference on Information and Knowledge Management, pp. 223-232, Rockville, Maryland, Nov. 1996.

Ling Lin / linli@ida.liu.se