Implementing Subscripted Identifiers in Scientific Databases
暂无分享，去创建一个
[1] R. Orlandic. Design, Analysis and Applications of Compact 0-Complete Trees , 1989 .
[2] Per-Åke Larson,et al. Dynamic hash tables , 1988, CACM.
[3] Don S. Batory,et al. On searching transposed files , 1978, ACM Trans. Database Syst..
[4] S. H. Son,et al. ADAMS interface language , 1989, C3P.
[5] Arie Shoshani,et al. Statistical Databases: Characteristics, Problems, and some Solutions , 1982, VLDB.
[6] John L. Pfaltz,et al. Analysis of Compact 0-Complete Trees: A New Access Method to Large Databases , 1989, FCT.
[7] Linda G. Shapiro,et al. Data Structures and Their Implementation , 1980 .
[8] John L. Pfaltz,et al. Compact 0-Complete Trees , 1988, VLDB.
[9] Yi Lin,et al. The ADAMS database language , 1989 .
[10] Arie Shoshani,et al. Characteristics of Scientific Databases , 1984, VLDB.
[11] Ronald Fagin,et al. Extendible hashing—a fast access method for dynamic files , 1979, ACM Trans. Database Syst..
[12] David J. DeWitt,et al. Efficient Support of Statistical Operations , 1985, IEEE Transactions on Software Engineering.
[13] Thomas A. Standish. Data Structure Techniques , 1980 .
[14] Mostafa A. Bassiouni,et al. Data Compression in Scientific and Statistical Databases , 1985, IEEE Transactions on Software Engineering.