Mathematics of Information ProcessingMichael Anshel, William Gewirtz American Mathematical Soc., 1986. gada 31. dec. - 233 lappuses These introductory survey lectures, the result of a 1984 AMS Short Course, focus on the algorithmic problems arising in the construction and utilization of large-scale information systems. Addressed to both mathematicians and computer scientists, the lectures require a background in the methodologies of discrete mathematics, in particular the elements of algebra, combinatorics and graph theory, discrete probability, logic and the theory of computation. All of the articles either are of high research value or survey profound themes in current research. They cover the two fundamental aspects of the field, i.e., database systems and communication networks. An overview of database architectures, the theory of data dependencies, and transaction management are provided, respectively, by the articles of Jacobs, Fagin and Vardi, and Garcia-Molina. Chung evaluates problems in the design of communication networks. Miller's discussion of data compression algorithms links current research to classical information theory. Finally, Tuzhilin describes a general framework evolved in the Soviet Union for modelling problems of information processing. |
Saturs
1 | |
THE THEORY OF DATA DEPENDENCIES A SURVEY | 19 |
TRANSACTION MANAGEMENT | 73 |
FUNDAMENTAL DATABASE ISSUES | 91 |
Data Compression Algorithms | 107 |
APPLICATION OF CATEGORY THEORY OF STRUCTURAL SETS TO MODELING OF INFORMATION BASES OF SYSTEMS | 119 |
Citi izdevumi - Skatīt visu
Mathematics of Information Processing Michael Anshel,William Gewirtz Ierobežota priekšskatīšana - 1986 |
Bieži izmantoti vārdi un frāzes
actions acyclic algorithm Arithmetic Coding assigning axiom system Beeri called canonical morphism CATEGORY THEORY complex complex-scheme Compression Computer Science constraints contravariant covariant crash Data Compression database schemes Database Systems decomposition defined delete denoted diameter directed graph disease ds disk edges element base encoding equivalence relation example execution Fagin Figure finite implication first-order logic full dependencies functional information bases Graph Theory hierarchical database hospital hypergraph IEEE Trans implication and finite implication problem input join consistent join dependency language lock M. Y. Vardi mapping Math mathematical morphism multivalued dependencies MVDs nodes NP-hard object output P₁ pair pr₂ Proc programs query R₂ relational database scheme-vector function serializable space of available structural sets subset symbol Symp T₁ T₂ Theorem tion transaction tuples universal relation update values variable scheme vertex vertices X₁ Z₂