Binding in information processing

The concept of binding, as used in programming systems, is analyzed and defined in a number of contexts. The attributes of variables to be bound and the phases of binding are enumerated. The definition is then broadened to cover general issues in information systems. Its applicability is demonstrated in a wide range of system design and implementation issues. A number of Database Management Systems are categorized according to the terms defined. A first-order quantitative model is developed and compared with current practice. The concepts and the model are considered helpful when used as a tool for the global design phase of large information systems.

[1]  Ronald L. Rivest,et al.  On self-organizing sequential search heuristics , 1976, CACM.

[2]  Philip A. Bernstein,et al.  What does Boyce-Codd Normal Form Do? , 1980, VLDB.

[3]  Donald E. Knuth.  The art of computer programming: fundamental algorithms , 1969 .

[4]  Charles W. Bachman,et al.  The evolution of storage structures , 1972, CACM.

[5]  Walter A. Burkhard,et al.  Hashing and trie algorithms for partial match retrieval , 1976, TODS.

[6]  Jonathan J. King.  Modelling concepts for reasoning about access to knowledge , 1980, Workshop on Data Abstraction, Databases and Conceptual Modelling.

[7]  A. Komaroff,et al.  The variability and inaccuracy of medical data , 1979, Proceedings of the IEEE.

[8]  Dennis McLeod,et al.  The semantic data model: a modelling mechanism for data base applications , 1978, SIGMOD Conference.

[9]  E. F. Codd,et al.  Further Normalization of the Data Base Relational Model , 1971, Research Report / RJ / IBM / San Jose, California.

[10]  P. Wegner.  Programming Languages, Information Structures, and Machine Organization. , 1968 .

[11]  William James Van Melle,et al.  A domain-independent system that aids in constructing knowledge-based consultation programs , 1980 .

[12]  Hector Garcia-Molina,et al.  Read-only transactions in a distributed database , 1982, TODS.

[13]  Ramez Elmasri,et al.  Properties of relationships and their representation , 1899, AFIPS '80.

[14]  Mario Schkolnick,et al.  The Optimal Selection of Secondary Indices for Files , 1975, Inf. Syst..

[15]  Leo R. Gotlieb.  Computing joins of relations , 1975, SIGMOD '75.

[16]  Mark Elson,et al.  Concepts of programming languages , 1973 .

[17]  Samuel Jerrold Kaplan,et al.  Cooperative responses from a portable natural language data base query system. , 1979 .

[18]  Gary G. Hendrix,et al.  Expanding the Utility of Semantic Networks Through Partitioning , 1975, IJCAI.

[19]  Edward A. Feustel,et al.  On The Advantages of Tagged Architecture , 1973, IEEE Transactions on Computers.

[20]  Gio Wiederhold,et al.  Structured organization of clinical data bases , 1899 .

[21]  Erik Sandewall,et al.  Programming in an Interactive Environment: the ``Lisp'' Experience , 1978, CSUR.

[22]  C. McGeeW..  The information management system IMS/VS , 1977 .

[23]  Diane C. P. Smith,et al.  Database abstractions: aggregation and generalization , 1977, TODS.

[24]  Ramez Elmasri,et al.  The Structural Model for Database Design , 1979, ER.

[25]  Irving L. Traiger,et al.  System R: relational approach to database management , 1976, TODS.

[26]  Randall Davis,et al.  An overview of production systems , 1975 .

[27]  Gio Wiederhold,et al.  Structured organization of clinical data bases , 1899, AFIPS '75.

[28]  Hans Hermes,et al.  Introduction to mathematical logic , 1973, Universitext.

[29]  Donald E. Knuth,et al.  The Art of Computer Programming, Volume I: Fundamental Algorithms, 2nd Edition , 1997 .

[30]  Peter P. Chen.  The entity-relationship model: toward a unified view of data , 1975, VLDB '75.

[31]  Elliott Irving Organick,et al.  Programming language structures , 1978 .

[32]  Nils J. Nilsson,et al.  SEMANTIC NETWORK REPRESENTATIONS IN RULE-BASED INFERENCE SYSTEMS1 , 1978 .

[33]  O DudaRichard,et al.  Semantic network representations in rule-based inference systems , 1977 .

[34]  Jerome A. Feldman,et al.  An ALGOL-based associative language , 1969, CACM.

[35]  Philip A. Bernstein,et al.  Concurrency Control in Distributed Database Systems , 1986, CSUR.

[36]  Eugene Wong,et al.  Canonical structure in attribute based file organization , 1971, CACM.

[37]  Joseph W Smith,et al.  JOSS — II: Design philosophy , 1970 .

[38]  A. Church.  The calculi of lambda-conversion , 1941 .

[39]  Ronald Fagin,et al.  Extendible hashing—a fast access method for dynamic files , 1979, ACM Trans. Database Syst..

[40]  Jack B. Dennis,et al.  Virtual memory, processes, and sharing in Multics , 1967, CACM.