1. Kriegel, H.-P., Pfeifle, M., Pötke, M., Seidl, T.: A Cost Model for Interval Sequence Intersection Queries on RI-Trees. Technical Report, University of Munich (2003)
2. Kriegel, H.-P., Pfeifle, M., Pötke, M., Seidl, T.: A Cost Model for Interval Intersection Queries on RI-Trees. In: Proc. 14th Int. Conf. on Scientific and Statistical Database Management (SSDBM), pp. 131–141 (2002)
3. Kriegel, H.-P., Pötke, M., Seidl, T.: Managing Intervals Efficiently in Object-Relational Databases. In: Proc. 26th Int. Conf. on Very Large Databases (VLDB), pp. 407–418 (2000)
4. Lecture Notes in Computer Science;H.-P. Kriegel,2001
5. Lomet, D.: B-tree Page Size When Caching is Considered. ACM SIGMOD Record 27(3), 28–32 (1998)