Library of Congress |

Library of Congress

Matches in Library of Congress for { <http://lccn.loc.gov/2001041134> ?p ?o. }

Showing items 1 to 22 of 22 with 100 items per page.

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