Introduction to constraint databases
Subtitle: with 112 illustrations
By: Peter Revesz.
Series: Texts in computer science
Publisher: Springer
Published: 2002
Place of publication: New York
Language: eng
Number of pages: 393
Subjects: Constraint databases.
Notes: Includes bibliographical references (p. [370]-389) and index.
Table of contents: title: Machine generated contents note: 1 Infinite Relational Databases 1; title: 1.1 The ViewLevel1; title: 1.2 TheLogical Level4; title: 1.3 Abstract Data Types8; title: 2 Constraint Databases 11; title: 2.1 Constraints11; title: 2.2 The Constraint Data Model20; title: 2.3 Data Abstraction23; title: 3 Relational Algebra and SQL 26; title: 3.1 Relational Algebra26; title: 3.2 SQL34; title: 4 Datalog Queries 40; title: 4.1 Syntax40; title: 4.2 Datalog with Sets45; title: 4.3 Datalog with Boolean Constraints46; title: 4.4 Datalog with Abstract Data Types46; title: 4.5 Semantics48; title: 4.6 Recursive Datalog Queries53; title: 5 Aggregation and Negation Queries 56; title: 5.1 Set Grouping56; title: 5.2 Average, Count, Sum57; title: 5.3 Area and Volume57; title: 5.4 Minimum and Maximum58; title: 5.5 Negation59; title: 5.6 Stratified Datalog Queries59; title: 6 Constraint Automata 62; title: 6.1 Definition of Cnastraint Automata62; title: 6.2 Simplifications of Constraint Automata68; title: 6.3 Analysis of Reachable Configurations73; title: 7 Refinement Queries 79; title: 7.1 The Universal Object Relation Data Model79; title: 7.2 Closed, Open, and Possible Worlds 80; title: 7.3 Syntax82; title: 7.4 Semantics86; title: 7.5 Projection Queries91; title: 7.6 Evaluation of Refinement Queries92; title: 8 Sate Query Languages 97; title: 8.1 SafetyLevels97; title: 8.2 Restriction99; title: 8.3 Safe Aggregation and Negaton Queries 101; title: 8.4 Safe Refinement and Projection Queries101; title: 9 Evaluation of Queries 104; title: 9.1 QuantifierEliminationandSatisfiability105; title: 9.2 Evaluation of Relational Algebra Queries116; title: 9.3 Evaluation of SQL Queries119; title: 9.4 Evaluation of Datalog Queries120; title: 10 Computational Complexity 132; title: 10.1 Complexity Classes and Measures132; title: 10.2 Complexity of Relational Algebra133; title: 10.3 Complexity of Datalog147; title: 10.4 Complexity of Stratified Datalog156; title: 11 Certification 159; title: 11.1 Constant Propagation159; title: 11.2 Variable Independence160; title: 11.3 Monotonicity160; title: 11.4 Acyclicity 161; title: 11.5 Tightening Bounds161; title: 11.6 Tightening Coefficients161; title: 11.7 VectorAdditionSystem162; title: 11.8 Positive Stochastic Matrix Multiplication164; title: 12 Implementation Methods 168; title: 12.1 Evaluation with Gap-Graphs 168; title: 12.2 Evaluation with Matrices174; title: 12.3 Boolean Constraints182; title: 12.4 Optimization of Relational Algebra186; title: 13 Spatiotemporal Databases 195; title: 13.1 Extreme Point Data Models196; title: 13.2 Parametric Extreme Point Data Models198; title: 13.3 Geometric Transformation Data Models206; title: 13.4 Queries208; title: 14 Interoperability 219; title: 14.1 DataInteroperability219; title: 14.2 Query Interoperability235; title: 14.3 Other Types of Interoperability242; title: 15 Approximation by Constraints 246; title: 15.1 Triangulated Irregular Networks247; title: 15.2 Piecewise Linear Approximation of Tune Series 250; title: 15.3 Parametric Triangulated Irregular Networks263; title: 15.4 Parametric Rectangles Appioximation of Raster Movies265; title: 16 Data Visualization 270; title: 16.1 Isometric Color Bands270; title: 16.2 Value-by-Area Cartogram274; title: 16.3 Animation of Moving Objects280; title: 17 Indexing 286; title: 17.1 Minimum Bounding Parametric Rectangles287; title: 17.2 The Parametric R-Tree Index Structure292; title: 17.3 Indexing Constraint Databases298; title: 18 The MLPQ System 302; title: 18.1 The MLPQ Database System Architecture302; title: 18.2 MLPQ Input Files304; title: 18.3 The MLPQ Graphical User Interface307; title: 18.4 Recursive Queries314; title: 19 The DISCO System 319; title: 19.1 DISCO Queries319; title: 19.2 Implementation323; title: 19.3 Using the DISCO System329; title: 19.4 Extensibility of the DISCO System330; title: 20 The PReSTO ystem 332; title: 20.1 PReSTO Input Files332; title: 20.2 The PReSTO Graphical Use Ierface335; title: 20.3 Implementation338; title: 21 Computer Vision ' 343; title: 21.1 Affine Inariance 344; title: 21.2 Affine-nvariant Similarity Measures346; title: 21.3 The Color Ratios Similarity Measure347; title: 22 Bioinformaties 351; title: 22.1 The Genome Map Assembly Problem351; title: 22.2 The Big-Bag Matching Problem352; title: 22.3 AConstraint-AutomataSolution353; title: 23 Environmental Modeling 361; title: 23.1 Preditive Spread ModejinF36?; title: 23.2 Visualization366; title: 23.3 A Deision Suport System366; title: Bibliography 370; title: Index 390.