1. Agrawal R, Gehrke J, Gunopulos D, Raghavan P (1998) Automatic subspace clustering of high dimensional data for data mining applications. In: Proc. ACM SIGMOD int’l conf. on management of data, Seattle, WA, June 1998, pp 94–105
2. Barbara W, DuMouchel W, Faloutsos C, Haas PJ, Hellerstein JM, Ioannidis Y, Jagadish HV, Johnson T, Ng R, Poosala V, Ross KA, Sevcik KC (1997) The New Jersey data reduction report. Data Eng Bull 20(4):3–42, December
3. Beckmann N, Kriegel H-P, Schneider R, Seeger B (1990) The R*-tree: an efficient and robust access method for points and rectangles. In: Proc. ACM SIGMOD int’l conf. on management of data, Atlantic City, NJ, May 1990, pp 322–331
4. Bergman LD, Castelli V, Li C-S, Smith JR (2000) SPIRE: a digital library for scientific information. Int J Digit Libr 3(1):85–99
5. Bohm C (2000) A cost model for query processing in high-dimensional data space. ACM Trans Database Syst 25(2):129–178