Bibliography on data base structures
Pages 3 - 9
References
[1]
Abrams, M. D. Data Structures For Computer Graphics Proc. of Symp. On Data Structures In Programming Languages (ACM-SIGPLAN) 1971
[2]
Altman, E. B., Astrahan, M. M., Fehder, P. L., Senko, M. E. Specifications in a Data Independent Architecture Model Proc. 1972 ACM-SIGFIDET Workshop on Data Description, Access and Control
[3]
Arora, S. R., Dent, W. T. Randomized Binary Search Techniques CACM, Vol. 12 (January 1969)
[4]
Astrahan, M. M., Altman, E. B., Fehder, P. L., Senko, M. E. Concepts of a Data Independent Architecture Model, Proc. 1972 ACM-SIGFIDET Workshop on Data Description, Access and Control
[5]
Bachman, C. W. The Evolution of Storage Structures CACM, Vol 15, No. 7 (July 1972), pp. 628--634
[6]
Bachman, C. W. Data Structure Diagrams Data Base (ACM-SIGBDP Newsletter) Vol. 1 No. 2 (Summer 1969)
[7]
Bachman, C. W. Software For Random Access Processing Datamation (April 1965) pp. 36--41
[8]
Bachman, C. W. Architecture Definition Technique: Its Objectives Theory, Process, Facilities and Practice Proc. 1972 ACM-SIGFIDET Workshop on Data Description, Access and Control
[9]
Bachman, C. W. Integrated Data Store DPMA Quarterly (January 1965)
[10]
Bachman, C. W., et al A General Purpose Programming System for Random Access Memories AFIPS, FJCC, 1964
[11]
Bayer, Rudolf, McCreight, Edward Organization and Maintenance of Large Ordered Indices 1970 ACM SIGFIDET Workshop on Data Description and Access
[12]
Bayer, R. Binary B-Trees for Virtual Memory Proc. 1971 ACM-SIGFIDET Workshop-Data Description, Access and Control, pp. 219--235
[13]
Bayes, A. J. Retrieval Times for a Packed Direct Access Inverted File CACM, Vol. 12 (October 1969)
[14]
Beitz, E. Henry The Interpretation of Structured Stored Data Using Delimiters 1970 ACM SIGFIDET Workshop on Data Description and Access
[15]
Bell, Jr. The Quadratic Quotient Method: A Hash Code Elimination Secondary Clustering CACM, Feb. 1970, pp. 107--109
[16]
Bell, J. R., Kaman, C. H. The Linear Quotient Hash Code CACM, Nov. 1970, pp. 675--677
[17]
Berge, C. The Theory of Graphs And Its Applications Wiley, New York, 1962
[18]
Berry, D. M. Introduction To Oregano Proc. of Symp. On Data Structures In Programming Languages (ACM-SIGPLAN) 1971
[19]
Beyer, J. D. Comments On 'An Improved Hash Code For Scatter Storage' CACM, May 1968. pp. 378
[20]
Bleier, R. E. Treating Hierarchical Data Structures In The SDC Time-shared Data Management System (TDMS) Proc. ACM 22nd National Conference 1967, MDI Publications Wayne, Pa. pp. 41--49
[21]
Bleier, Robert Data Definition Standardization 1970 ACM SICFIDET Workshop on Data Description and Access
[22]
Bloom, B. H. Space/time Trade-offs In Hash Coding With Allowable Errors CACM, July 1970, pp. 422--426
[23]
Bobrow, Robert J. An Experimental Data Management Systems In Data Base Systems, Ed. R. Rustin, Prentice-Hall, 1972 pp. 125--142
[24]
Brewer, Susan Data Base or Data Maze? An Exploration of Entry Points Proc. ACM Conference, 1968, pp. 623--630
[25]
Briandais, P. D. File Searching Using Variable Length Keys Proc. WJCC, 1959, pp. 295--298
[26]
Browne, P. S., Steinauer, D. A Model for Access Control Proc. 1971 ACM-SIGFIDET Workshop-Data Description, Access and Control, pp. 241--262
[27]
Buchholz W. File Organization And Addressing IBM trol Proc. 1971 ACM-SIGFIDET Workshop-Data Description, Access and Control, pp. 241--262
[28]
Buchholz, W. ile Organization And Addressing IBM Systems J., June 1963, pp. 86--111
[29]
Busam, V. A. On The Structure Of Dictionaries For Compilers Proc. of Symp. On Data Structures In Programming Languages (ACM-SIGPLAN) 1971
[30]
Byrnes, C. J. Et Al File Management Systems: A Current Summary Datamation, Nov., 1969
[31]
Canning, R. G. Data Management: File Organization EDP Analyzer, Vol. 5, No. 12, Dec. 1967
[32]
Chapin, N. A Comparison of File Organization Techniques ACM Conference, 1968, pp. 631--638
[33]
Chapin, N. Common File Organization Techniques Compared FJCC, Vol. 35, 1969 pp. 413--322
[34]
Childs, D. L. Feasibility of A Set Theoretical Data Structure = A General Structure Based On A Reconstituted Definition Of A Relation Proc. IFIP Congress 1968 North-Holland Pub. Co. Amsterdam pp. 162--172
[35]
Chow, D. K. Now Balanced File Organization Information and Control Vol. 15, No. 5 (1969), pp. 377--396
[36]
Cleary, J. G., Organick, E. I. A Data Structure Model of B6700 Computer System Proc. Of Symp. On Data Structures In Programming Languages (ACM-SIGPLAN) 1971
[37]
Climenson, W. D. File Organization And Search Techniques Annual Review of Information Science and Technology, Vol. 1, pp. 107--135 John Wiley & Sons, Inc., 1966
[38]
CODASYL Data Base Task Group Report (April 1971) Available from ACM, 1133 Ave. of the Americas, N.Y. 10036
[39]
CODASYL Systems Committee Feature Analysis of Generalized Data Base Management Systems Published by ACM, 1971
[40]
Codd, E. F. A Relational Model of Data for Large Shared Data Banks CACM Vol. 13 (June 1970), pp. 337--387
[41]
Codd, E. F. A Data Base Sublanguage Founded on the Relational Calculus Proc. 1971 ACM-SIGFIDET Workshop On Data Description, Access and Control, pp. 35--68
[42]
Codd, E. F. Normalized Data Base Structure: A Brief Tutorial Proc. 1971 ACM-SIGFIDET Workshop on Data Description, Access and Control
[43]
Codd, E. F. Further Normalization of the Data Base Relational Model In Data Base Systems, Ed. R. Rustin, Prentice-Hall, 1972, pp. 33--64
[44]
Codd, E. F. Relational Completeness of Data Base Sub-languages In Data Base Systems, Ed. Ru. Rustin, Prentice-Hall, 1972, pp. 65--98
[45]
Coffman, Jr., E. G., Eve, J. File Structures Using Hashing Functions CACM, July 1970, pp. 427--436
[46]
Colinday, A. Full Table Quadratic Searching For Scatter Storage CACM, Aug. 1970, pp. 481--482
[47]
Collmeyer, A. J. Implications of Data Independence on the Architecture of Database Management Systems Proc. 1972 ACM-SIGFIDET Workshop on Data Description, Access and Control
[48]
Collmeyer, A. J., Shemer, J. E. Analysis of Retrieval Performance for Selected File Organization Techniques Proc. Fall Join Computer Conference 1970, p. 206
[49]
Daley, R. C. Et Al A General Purpose File System For Secondary Storage FJCC, 1965
[50]
Date, C. J., Hopewell, P. File Definition and Logical Data Independence Proc. 1971 ACM-SIGFIDET Workshop-Data Description, Access and Control, pp. 117--138
[51]
Date, C. J., Hopewell, P. Storage Structure and Physical Data Independence Proc. 1971 ACM-SIGFIDET Workshop-Data Description, Access and Control, pp. 139--168
[52]
Day, A. C. Full Table Quadratic Searching for Scatter Storage CACM, Vol. 13 (August 1970), pp. 481--482
[53]
Dean, Jr., A. L. Data Privacy and Integrity Requirements for Online Data Management Systems Proc. 1971 ACM-SIGFIDET Workshop-Data Description, Access and Control, pp. 279--298
[54]
DeMaine, P. A. D., Rotwitt, Jr., T. Storage Optimization of Tree Structured Files Proc. 1971 ACM-SIGFIDET Workshop-Data Description, Access and Control, pp. 207--218
[55]
Dempsey, J. W., Mullin, J. K. Problems of Building a Hybrid Data Definition Facility 1970 ACM SICFIDET Workshop on Data Description and Access
[56]
Dennis, Jack B. On the Exchange of Information 1970 ACM SICFIDET Workshop on Data Description and Access
[57]
Deuel, Philip On a Storage Mapping Function for Data Structures CACM, Vol. 9 (May 1966)
[58]
D'Imperio, M. E. Data Structures and Their Representation In Storage Annual Review of Automatic Programming, Pergammon Press, 1969
[59]
Dixon, P. J., Sable, J. DM-1 A Generalized Data Management System Proc. AFIPS 1967 Spring Joint Computer Conference, Vol. 30, Washington, D.C., pp. 185--198
[60]
Dodd, G. E. Elements of Data Management Systems Computing Surveys, June 1969
[61]
Dodd, G. G. APL-a Language For Associative Data Handling In PL/1 Proc. AFIPS 1966 Fall Joint Computer Conference, Vol. 29, Washington, D.C., pp. 677--684
[62]
Douglas, C. W. File Organization And Search Techniques Annual Review Of Information Technology, Interscience, 1966
[63]
Earley, Jay On the Semantics of Data Structures In Data Base Systems, Ed R. Rustin, Prentice-Hall, 1972, pp. 23--32
[64]
Earley, Jay Towards an Understanding of Data Structures CACM Vol. 14 (October 1971), pp. 617--627
[65]
Ellis, Max, Nelson, Kenneth A Data Description Language for Hierarchical Data Files 1970 ACM SICFIDET Workshop on Data Description and Access
[66]
Engles, R. W. An Analysis of the April 1971 Data Base Task Group Report Proc. 1971 ACM-SIGFIDET Workshop-Data Description, Access and Control, pp. 69--92
[67]
Everest, G. C., Sibley, E. H. A Critique of the GUIDE--SHARE DBMS Requirements Proc. 1971 ACM-SIGFIDET Workshop-Data Description, Access and Control, pp. 93--112
[68]
Ferguson, W. A., Lipovski, G. J. A Generalized Assembly Language Using Regular Expressions Proc. of Symp. On Data Structures In Programming Languages (ACM-SIGPLAN) 1971
[69]
Ferrari, D. On the Architecture of Data Base Systems Proc. 1971 ACM-SIGFIDET Workshop-Data Description, Access and Control, pp. 113--116
[70]
Fleck, A. C. Towards a Theory of Data Structures Journal of Computer and System Sciences, Vol. 5 (1971) pp. 475--488
[71]
Flores, Ivan Data Structure And Management Prentice-Hall, Englewood Cliffs, New Jersey, 1970
[72]
Floyd, R. W. A Descriptive Language For Symbol Manipulation JACM, Vol. 8, No. 4 Oct. 1961, pp. 579--584
[73]
Fry, J. P., Smith, D. C. P., Taylor, R. W. An Approach to Stored Data Definition and Translation Proc. 1972 ACM-SIGFIDET Workshop on Data Description, Access and Control
[74]
Fry, J. P., Frank, R. L., Hershey III, E. A. A Development Model for Data Translation Proc. 1972 ACM-SIGFIDET Workshop on Data Description, Access and Control
[75]
Ghosh, Sakti P. File Organization: The Consecutive Retrieval Property CACM, Vol. 15, No. 9 (September 1972), pp. 802--808
[76]
Ghosh, S. P. On the Problem of Query-Oriented Filing Schemes Using Discrete Mathematics Proc. IFIP Congress 1968, Edinburgh, Scotland, pp. 74--79
[77]
Ghosh, S. P., Organization of Records with Unequal Multiple Valued Attributes and Combinatorial Queries of Order 2 Information Sciences Vol. 1, No. 4 (1969), pp. 363--380
[78]
Ghosh, S. P., Senko, M. E. File Organization: On the Selection of Random Access Index Points for Sequential Files JACM, Vol. 16, No. 4 (October 1969), pp. 569--579)
[79]
Goldstein, Robert C., Strnad, Alois, J. The MacAIMS Data Management System 1970 ACM SICFIDET Workshop on Data Description and Access
[80]
Gurk, Herbert M., Minker, Jack Storage Requirements for Information Handling Centers JACM, Vol. 17, No. 1 (January 1970), pp. 65--77
[81]
Hanan, M., Palermo, F. P. An Application Of Coding Theory To A File Address Problem IBM J. REs. Devel., April 1963, pp. 127--129
[82]
Harary, F. Norman, Cartwright, D. Structural Models: An Introduction To The Theory Of Directed Graphs Wiley, New York, 1965
[83]
Hawryszkiewycz, I. T., Dennis, J. B. An Approach to Proving the Correctness of Data Base Operations Proc. 1972 ACM-SIGFIDET Workshop on Data Description, Access and Control
[84]
Heath, I. J. Unacceptable File Operations in a Relational Data Data Base Proc. 1971 ACM-SIGFIDET Workshop-Data Description, Access and Control
[85]
Heising, W. P. Note On Random Addressing Techniques IBM Systems J., June 1963, pp. 112--116
[86]
Henry, W. R. Hierarchial Structure For Data Management IBM Systems Journal, Vol. 8, No. 1, 1969
[87]
Hobbs, L. C. Review and Survey of Mass Memories AFIPS Books, 1963
[88]
Honien, Liu A File Management System For A Large Corporate Information System Data Bank FJCC, 1968
[89]
Hsiao, David, Harary, Frank A Formal System For Information Retrieval From Files Communications Of The ACM, Vol. 13, No. 2 Feb. 1970, pp. 67--73
[90]
IBM Introduction To IBM/360 Direct Access Storage Devices And Organization Methods C20-1649, IBM Corp. White Plains, N.Y., 1966
[91]
IBM Information Management System/360 Application Description Manual IBM Corporation H20-0524, July 1968
[92]
IBM Customer Information Control System (CICS) General Information Manual IBM Corporation GH20-1028
[93]
IBM System/360 Generalized Information System (Basic) Application Description Manual IBM Corporation GH20-0574
[94]
IBM System/360 Generalized Information System Application Description Manual IBM Corporation GH20-0574
[95]
IBM IBM System/360 Operating System: Data Management Form C28-6537-2, IBM Thomas J. Watson Research Center, New York 1966
[96]
Johnson, L. R. An Indirect Chaining Method For Addressing On Secondary Keys CACM, May 1961, pp. 218--222
[97]
Johnston, J. B. The Contour Model of Block Structured Processes Proc. of Symp. On Data Structures In Programming Languages (ACM-SIGPLAN), 1971
[98]
Katzan, H. Jr. Representation And Manipulation of Data Structures In APL Proc. of Symp. On Data Structures In Programming Languages (ACM-SIGPLAN), 1971
[99]
Knott, G. D. Expandable Open Addressing Hash Table Storage and Retrieval Proc. 1971 ACM-SIGFIDET Workshop-Data Description, Access and Control, pp. 187--206
[100]
Knuth, D. E. The Art of Computer Programming, Vol. 1 Fundamental Algorithms Addison-Wesley, Reading, Massachusetts, 1968
[101]
Koch, H. S., Gotterer, M. S. An Independent Data Definition Facility for COBOL and FORTRAN Proc. 1972 ACM-SIGFIDET Workshop on Data Description, Access and Control
[102]
Lamport, L. Comments On Bell's Quadratic Quotient Method For Hash Code Searching CACM, Sept. 1970, pp. 573--574
[103]
Landauer, W. I. The Balanced Tree And Its Utilization In Information Retrieval IEEE Trans. on Electronic Computers, Vol. EC-12, No. 6, December 1963
[104]
Landauer, W. I. A Growing Tree For Descriptor Language Translation Proceedings of Symposium on Symbolic Languages In Data Processing, 1962
[105]
Lang, C. A., Gray, J. C. ASP = A Ring Implemented Associative Structure Package CACM, Vol. 11 (August 1968)
[106]
Lefkovitz, D. File Structures For On-line Systems Spartan Books, N.Y., 1969
[107]
Levien, R. E., Maron, M. E. A Computer System for Inference Execution and Data Retrieval CACM, Vol. 10 (November 1967)
[108]
Lindsay, R. K., Pratt, T. W., Shavor, K. M. An Experimental Syntax Directed Data Structures Language The Rand Corp., Paper P-3112, Santa Monica, 1965
[109]
Lipovski, G. J. On Data Structures In Associative Memories Proc. of Symp. on Data Structures In Programming Languages (ACM-SIGPLAN) 1971
[110]
Liu, Ho Nien A Data Base System Defined to Support a Large Information System Proc. 1971 ACM-SIGFIDET Workshop-Data Description, Access and Control, pp. 349--372
[111]
Lorie, R. A., Symonds, A. M. A Relational Access Method for Interactive Applications In Data Base Systems, Ed. R. Rustin, Prentice-Hall, 1972
[112]
Lowe, T. C. The Influence of Data-base Characteristics And Usage On Direct Access File Organization JACM 15,4 (Cot. 1968), pp. 535--548
[113]
Luccio, Fabrizio Weighted Increment Linear Search for Scatter Tables CACM, Vol. 15, No. 12 (December 1972), pp. 1045--1047
[114]
Lum, V. Y. Multi-Attribute Retrieval with Combined Indexes CACM, Vol. 13 (November 1970)
[115]
Lum, V. Y., Yuen, P. S. T., Dodd, M. Key-to-Address Transform Techniques: A Fundamental Performance Study on Large Existing Formatted Files CACM, Vol. 14 (April 1971)
[116]
Madnick, S. E. Design Strategies for File Systems: A Working Model FILE/68 International Seminar on File Organization, Helsingor, Denmark, November 1968
[117]
Madnick, S. E. A Modular Approach To File System Design SJCC, 1969
[118]
Madnick, S. E. Design Strategies for File Systems MIT Project MAC M. S. Thesis Report TR-78 (October 1970)
[119]
Maron, M. E. A Computer System For Inference Execution And Data Retrieval Comm. ACM 10, 11 (Nov. 1967) pp. 715--721
[120]
Martin, Johannes, J. Information Compressing Procedures for Storing Binary Relations 1970 ACM SICFIDET Workshop on Data Description and Access
[121]
Martin, L. D. A Model For File Structure Determination For Large On-line Data Files In Proc. Of The File 68 International Seminar On File Organization Copenhagen, 1968, pp. 793--834
[122]
Martin, W. A. Ness, D. N. Optimizing Binary Trees Grown with a Storing Algorithm, CACM Vol. 15 (February 1972), pp. 88--93
[123]
Maurer, W. D. An Improved Hash Code For Scatter Storage CACM, Jan. 1968, pp. 35--38
[124]
McCarthy, John LISP 1.5, Programmers Manual MIT Press, Mass., 1962
[125]
McGee, W. Some Current Issues in Data Description Proc. 1972 ACM-SIGFIDET Workshop on Data Description, Access and Control
[126]
McGee W. C. File Structures For Generalized Data Management IFIP, 1968 F68-F73
[127]
McGee, W. C. Generalized File Processing In Annual Review In Automatic Programming 5, 13 Pergamon Press, New York 1969, pp. 77--149
[128]
McGowan, C., Wegner, P. The Equivalence Of Sequential And Associative Information Structure Models Proc. of Symp. On Data Structures In Programming Languages (ACM-SIGPLAN) 1971
[129]
McIlroy, M. D. A Variant Method Of File Searching CACM Jan. 1963, p. 101
[130]
Mealy, George Another Look At Data FJCC, Vol. 31, 1967, pp. 525--534
[131]
Minker, Jack Generalized Data Management Systems = Some Perspectives National Bureau of Standards, Technical Report, pp. 69--101, 1969
[132]
Minsky, N. Rotating Storage Devices as 'Partially Associative Memories' Proc. 1972 ACM-SIGFIDET Workshop-Data Description, Access and Control
[133]
Moehrke, D. P. Evolution of Data Base Management at A. O. Smith Proc. 1971 ACM-SIGFIDET Workshop-Data Description, Access and Control, pp. 299--324
[134]
Morris, J. B., Wells, Mark B. Generalized Data Structures In MADCAP Proc. Of Symp. On Data Structures In Programming Languages (ACM-SIGPLAN)
[135]
Morris, R. Scatter Storage Techniques CACM, Jan. 1968, pp. 38--44
[136]
Mullin, James K. Retrieval-Update Speed Tradeoffs Using Combined Indices CACM, Vol. 14 (December 1971)
[137]
Nelson, T. H. A File Structure for the Complex, the Changing and the Indeterminate ACM National Conference Preceedings, August 1965
[138]
Nelson, D. B., Pick, R. A., Andrews, K. B. GIM-1 = A Generalized Information Management Language and Computer System Proceedings Spring Joint Computer Conference, 1967
[139]
Nievergelt, J. Binary Search Trees and File Organization Proc. 1972 ACM-SIGFIDET Workshop-Data Description, Access and Control
[140]
Nijssen, G. M. Efficient Batch Updating of a Random File Proc. 1971 ACM-SIGFIDET Workshop-Data Description, Access and Control, pp. 173--186
[141]
Nijssen, G. M. Indexed Sequential Versus Random IFIP IAG Journal, Vol. 4, 1971, No. 1, pp. 29--37
[142]
Olle, T. William Recent CODASYL Reports on Data Base Management In Data Base Systems, Ed R. Rustin, Prentice-Hall, 1972, pp. 175--184
[143]
Olle, T. W. Data Structures and Storage Structures for Generalized File Processing FILE/68 International Seminar on File Organization, Denmark, 1968
[144]
Olson, C. A. Random Access File Organization for Indirectly Addressed Records Proc. ACM 24th National Conference 1969, pp. 539--549
[145]
Owens, Jr., R. C. Evaluation of Access Authorization Characteristics of Derived Data Sets Proc. 1971 ACM-SIGFIDET Workshop-Data Description, Access and Control, pp. 263--278
[146]
Parker, J. L., Jervis, B. An Approach for a Working Relational Data System Proc. 1972 ACM-SIGFIDET Workshop on Data Description, Access and Control
[147]
Parker, J. L. File Structures and Access Methods for a Geographic Information Retrieval System Proc. 1972 ACM-SIGFIDET Workshop on Data Description, Access and Control
[148]
Parker, J. L. Information Retrieval with Large-Scale Geographic Data Bases Proc. 1971 ACM-SIGFIDET Workshop-Data Description, Access and Control, pp. 325--348
[149]
Peterson, W. W. Addressing For Random Access Storage IBM J. Res. Devel., April 1957, pp. 130--146
[150]
Perlis, A. J. A Format Language CACM, Vol. 7, No. 2, 1964, pp. 89 ff.
[151]
Plagman, B. K., Altshuler, G. An Integrated Corporate Data Base Concept and Its Application Proc. 1972 ACM-SIGFIDET Workshop on Data Description, Access and Control
[152]
Price, C. E. Table Lookup Techniques ACM Computing Surveys, Vol. 3, No. 2 (June 1971), pp. 49--66
[153]
Prywes, N. S. Browsing In An Automated Library Through Remote Access Computer Augmentation Of Human Reasoning, September 1965
[154]
Prywes, N. S. Man-computer Problem Solving With Multilist Proc. IEEE -4, 12 (Dec. 1966), 1788--1801
[155]
Prywes, N. S., Hsiao, D. A System To Manage An Information System In Proc. Of The FID/IFIP Joint Conference On Mechanized Information Storage, Retrieval and Dissemination, Rome, Italy, 1967, p. 637--660
[156]
Radke, C. E. The Use Of Quadratic Residue CACM, Feb. 1970, pp. 103--105
[157]
Ray-Chaudhuri, D. K. Combinatorial Information Retrieval Systems for Files SIAM J. Appl. Math. Vol. 16, No. 5 (1968), pp. 973--992
[158]
Rosenberg, Arnold Data Graphs and Addressing Schemes Journal of Computer and System Sciences, Vol. 5 (1971), pp. 193--238
[159]
Rosenberg, Arnold Symmetries in Data Graphs SIAM Journal of Computing, Vol. 1 (1972) pp. 40--65
[160]
Rosenberg, Arnold Addressable Data Graphs JACM Vol. 19 (1972) pp. 309--340
[161]
Rosenberg, Arnold Exploiting Addressability in Data Graphs IBM T. J. Watson Research Center Report RC 3618 (November 18, 1971)
[162]
Rosenberg, Arnold Quasi-Addressable Data Graphs IBM T. J. Watson Research Center Report RC 3742 (February 25, 1972)
[163]
Rosenberg, Arnold Suffixes of Addressable Data Graphs IBM T. J. Watson Research Center Report RC 3843 (May 8, 1972)
[164]
Salton, Gerard Automatic Information Organization and Retrieval McGraw-Hill Book Company, New York, 1968
[165]
Schay, G., Raver A Method For Key-To-Address-Transformation IBM J. Res. Devel., April 1963, pp. 121--126
[166]
Schay, G., Spruth, W. O. Analysis of a File Addressing Method CACM, 1962, pp. 459--462
[167]
Schecter, G. Information Retrieval: A Critical View Thompson Books, Washington, D.C., 1967
[168]
Schwartz, Jacob T. Abstract and Concrete Problems in the Theory of Files In Data Base Systems, Ed. R. Rustin, Prentice-Hall, 1972, pp. 1--22
[169]
Senko, M. E. Details of a Scientific Approach to Information Systems In Data Base Systems, Ed. R. Rustin, Prentice-Hall, 1972
[170]
Shemer, J., Collmeyer, A. J. Data Base Sharing: A Study of Interference, Roadblock and Deadlock In Data Base Systems, Ed. R. Rustin, Prentice-Hall, 1972
[171]
Shemer, J. E. Access Methods: A Brief Overview for the 1971 ACM SIGFIDET Workshop Proc. 1971 ACM-SIGFIDET Workshop-Data Description, Access and Control, pp. 169--172
[172]
Schneiderman, Ben Polynomial Search Software Practice and Experience Vol. 3, No. 1 (January-March 1973), pp. 5--8
[173]
Shoshani, A. J., Bernstein, A. J. Synchronization in a Parallel-Accessed Data Base CACM, Vol. 12 (November 1969)
[174]
Sibley, Edgar H., Taylor, Robert W. Data Definition and Mapping Language Univ. of Michigan, Dept of Industrial Engineering ISDOS Project Working Paper Number 53
[175]
Smith, D. C. P. Translation Using the Stored Data Definition and Translation Task Group Language Proc. 1972 ACM-SIGFIDET Workshop on Data Description, Access and Control
[176]
Srinivasan, C. V. On the Design of Data Structures for Given Algorithms Department of Computer Science, Rutgers University, 1970
[177]
Srinivasan, C. V. A Mechanism to Model Data Structure Design Problems Department of Computer Science, Rutgers University, 1970
[178]
Standish, T. A. A Data Definition Facility for Programming Languages Carnegie Institute of Technology, Pittsburgh, Pennsylvania, 1967
[179]
Strnad, A. L. The Relational Approach to the Management of Data Bases Proc. IFIP Congress 1971, North-Holland Press
[180]
Sundeen, D. H. Overview of Data Management Systems Applications Proc. 1972 ACM-SIGFIDET Workshop on Data Description, Access and Control Sussenguth, E. H. The Use of Tree Structures for Processing Files Comm. ACM, May 1963
[181]
Symonds, Andrew J., Lorie, Raymond, A. A Schema for Describing a Relational Data Base 1970 ACM SICFIDET Workshop on Data Description and Access
[182]
Tainiter, M. Addressing for Random-Access Storage with Multiple Bucket Capacities JACM, 1963, pp. 307--313
[183]
Taylor, R. W. Generalized Data Base Management System Data Structures and Their Mapping to Physical Storage Univ. of Michigan, Ph.D. Dissertation, 1971
[184]
Taylor, S. M., Weston, P. E. Cylinders: A Relational Data Structure Proc. of Symp. On Data Structures In Programming Languages (ACM-SIGPLAN) 1971
[185]
Toyoda, Tezuka, Kasahara Analysis of the Address Assignment Problem for Clustered Keys JACM, Oc. 1966, pp. 526--532
[186]
Ullman, J. D. The Design of Hashing Functions Tech. Report No. 85, Elect. Eng. Dept. Princeton Univ., Sept. 1970, 19 pages
[187]
Van Dam, A. Et Al A Compact Data Structure For Storing, Retrieving, and Manipulating Line Drawings SJCC, Thompson Books, 1967 Trans. On Electronic Computers of IEEE, December, 1963
[188]
Van Dam, A. Data and Storage Structures in Interactive Graphs Proc. of Symp. on Data Structures in Programming Languages (ACM-SIGPLAN) 1971
[189]
Vance, David, Heller, Jack Structure and Content of a Museum Data Bank Computers and the Humanities, Vol. 6, No. 2 (November 1971), pp. 67--84
[190]
Walk, K. Modelling of Storage Properties of Higher Level Languages Proc. of Symp on Data Structures in Programming Languages (ACM-SIGPLAN) 1971
[191]
Wegner, P. Data Structures in Programming Languages Proc. of Symp. on Data Structures in Programming Languages (ACM-SIGPLAN) 1971
[192]
Weizenbaum, J. Symmetric List Processor Comm. ACM 6, Sept. 1963, pp. 524--544
[193]
Wile, D. S., Geschke, C. M. Efficient Data Accessing in the Programming Language BLISS Proc. of Symp on Data Structures in Programming Languages (ACM-SIGPLAN) 1971
[194]
Wilkes, M. V. A System of Data Organization Based on Associatively Accessed Tables Proc. of Symp. on Data Structures in Programming Languages (ACM-SIGPLAN) 1971
[195]
Wong, Eugene, Chiang, T. C. Canonical Structure in Attribute Based File Organization CACM, Vol. 14 (September 1971)
Index Terms
- Bibliography on data base structures
Recommendations
Compressed data structures for annotated web search
WWW '12: Proceedings of the 21st international conference on World Wide WebEntity relationship search at Web scale depends on adding dozens of entity annotations to each of billions of crawled pages and indexing the annotations at rates comparable to regular text indexing. Even small entity search benchmarks from TREC and INEX ...
Populating knowledge base with collective entity mentions: a graph-based approach
ASONAM '14: Proceedings of the 2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and MiningPopulating a knowledge base with new entity mentions extracted from unstructured text can help enhance its coverage and freshness. It naturally consists of two subtasks, namely, fine-grained entity classification and entity linking. Existing studies ...
Entity disambiguation for knowledge base population
COLING '10: Proceedings of the 23rd International Conference on Computational LinguisticsThe integration of facts derived from information extraction systems into existing knowledge bases requires a system to disambiguate entity mentions in the text. This is challenging due to issues such as non-uniform variations in entity names, mention ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Spring 1974
14 pages
Copyright © 1974 Author.
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 April 1974
Published in SIGMIS Volume 6, Issue 1
Check for updates
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 118Total Downloads
- Downloads (Last 12 months)56
- Downloads (Last 6 weeks)7
Reflects downloads up to 09 Dec 2024
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in