This Article 
 Bibliographic References 
 Add to: 
January-February 1997 (vol. 9 no. 1)
pp. 1-2

[1] D.S. Batory, "Index Coding: A Compression Technique for Large Statistical Databases," Proc. Third Int'l Workshop Statistical Data Management, 1983.
[2] D. Comer, "The Ubiquitous B-Tree," ACM Computing Surveys, vol. 11, no. 2, pp. 121-137, 1979.
[3] C.J. Date, An Introduction to Database Systems, second edition. Reading, Mass.: Addison-Wesley, 1975.
[4] R.C. Goldstein and A.D. Strnad, "The MacAIMS Data Management System," Proc. ACM SIGFIDET Workshop on Data Description and Access,Houston, Tex., 1970.
[5] G. Held, Data Compression, third edition. New York: John Wiley and Sons, 1991.
[6] D.E. Knuth, The Art of Computer Programming.Reading, Mass.: Addison-Wesley, 1982.
[7] B. Liskob and S. Zilles, "Programming with Abstract Data Types," ACM SigPlan Notices, vol. 9, no. 4, pp. 50-59, 1974.
[8] H. Lorin, Sorting and Sort Systems.Reading, Mass.: Addison-Wesley, 1975.
[9] J. Ong, D. Fogg, and M. Stonebraker, "Implementation of Data Abstraction in the Relational Database System INGRES," ACM SIGMOD Record, no. 2, pp. 1-14, Spring 1984.
[10] S. Osborn and IT. Heaven, "The Design of a Relational Database System with Abstract Data types for Domains," ACM Trans. Database Systems, vol. 11, no. 3, pp. 357-373, 1986.
[11] A. Shoshani, "Statistical Databases: Characteristics, Problems, and Some Solutions," Trans. Very Large Data Bases, pp. 208-221, 1982.
[12] J.A. Storer, Data Compression: Methods and Theory.Rockville, Md.: Computer Science Press, 1988.
[13] C. Wagner and R.C. Goldstein, "EBASEA Database System for Research and Teaching," Univ. of British Columbia Faculty of Commerce Working Paper No. 1151, Nov. 1985.

Farokh B. Bastani, "Editorial: Acknowledging TKDE's Fine Past, and Looking to an Even Better Future," IEEE Transactions on Knowledge and Data Engineering, vol. 9, no. 1, pp. 1-2, Jan.-Feb. 1997, doi:10.1109/TKDE.1997.10000
Usage of this product signifies your acceptance of the Terms of Use.