Grahne (22 results)

Softcover. Condition: Bon. Ancien livre de bibliothèque. Légères traces d'usure sur la couverture. Edition 1991. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Good. Former library book. Slight signs of wear on the cover. Edition 1991. Ammareal gives back up to 15% of this item's net price to charity organizations.

Paperback. Condition: Very Good. Dust Jacket Condition: No Dust Jacket. Lecture Notes in Computer Science 554; Ex-Library. Previous owner's sticker on the front cover. Ink stamp on half-title page. Small pen inscription on title page. Library catalogue sticker inside front cover. Faintly bumped spine foot and rubbed corners. Foot of page block slightly grubby and marked due to age. Sound, clean book with tight binding. ADG. Ex-Library.

Condition: As New. Unread book in perfect condition.

Condition: New. In.

Condition: New. In.

PF. Condition: New.

Paperback. Condition: New.

Condition: New.

Condition: New.

Condition: As New. Unread book in perfect condition.

Condition: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher | In a relational database the information is recorded as rowsin tables. However, in many practical situations theavailable information is incomplete and the values for somecolumns are missing. Yet few existing database managementsystems allow the user to enter null values in the database.This monograph analyses the problems raised by allowing nullvalues in relational databases. The analysis coverssemantical, syntactical, and computational aspects.Algorithms for query evaluation, dependency enforcement andupdates in the presence of null values are also given.The analysis of the computational complexity of thealgorithms suggests that from a practical point of view thedatabase should be stored as Horn tables, which aregeneralizations of ordinary relations, allowing null valuesand Horn clause-like restrictions on these null values. Horntables efficiently support a large class of queries,dependencies and updates.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - In a relational database the information is recorded as rowsin tables. However, in many practical situations theavailable information is incomplete and the values for somecolumns are missing. Yet few existing database managementsystems allow the user to enter null values in the database.This monograph analyses the problems raised by allowing nullvalues in relational databases. The analysis coverssemantical, syntactical, and computational aspects.Algorithms for query evaluation, dependency enforcement andupdates in the presence of null values are also given.The analysis of the computational complexity of thealgorithms suggests that from a practical point of view thedatabase should be stored as Horn tables, which aregeneralizations of ordinary relations, allowing null valuesand Horn clause-like restrictions on these null values. Horntables efficiently support a large class of queriesdependencies and updates.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - The papers in this volume represent the technical program of the 8th Biennial Workshop on Data Bases and Programming Languages (DBPL 2001), that was held during September 8 10, 2001, in Frascati, located on the beautiful hills surrounding Rome, in an area favored by the ancient Roman patricians who built their summer residences there. DBPL 2001 continued the tradition of - cellence initiated by its predecessors in Rosco , Finist` ere (1987), Salishan, O- gon (1989), Nafplion, Argolida (1991), Manhattan, New York (1993), Gubbio, Umbria (1995), Estes Park, Colorado (1997), and Kinloch Rannoch, Scotland (1999). Databases grew out of a separation between physical and logical data, thus enabling high-level query languages. Database query languages have evolved in expressive power and structural capabilities. Programming languages have seen a development from assembly languages to high-level declarative paradigms. Thus the two areas approach each other as they mature. Earlier successful cro- fertilizationsbetweenthe eldsincludethecombinationofrelationaltheory,type theory and object-oriented languages, resulting in object-oriented databases, object-relational databases and persistent programming languages. The com- nation of database logic programming and constraint programming p- duceddeductiveandconstraintdatabases.Recently,withtheemergenceofse- structured data models, there is a renewed synergy between databases and p- gramminglanguages,inparticularinthedesignoflanguagestomanipulateXML data. The DBPL 2001 Program Co-Chairs were Giorgio Ghelli (Pisa) and G osta Grahne(Montr eal).TheProgramCommitteeMemberswereCatrielBeeri(Je- salem),DiegoCalvanese(Rome),RichardConnor(Glasgow),AlonHalevy(Se- tle), Leonid Libkin (Toronto), Gianni Mecca (Potenza), Frank Neven (Limburg), Benjamin Pierce (Philadelphia), Chris Ramming (Menlo Park), J er ome Sim eon (Murray Hill), Victor Vianu (San Diego), and Philip Wadler (Basking Ridge).

Taschenbuch. Condition: Neu. The Problem of Incomplete Information in Relational Databases | Gösta Grahne | Taschenbuch | viii | Englisch | 1991 | Springer | EAN 9783540549192 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

Taschenbuch. Condition: Neu. Database Programming Languages | 8th International Workshop, DBPL 2001, Frascati, Italy, September 8-10, 2001. Revised Papers | Gosta Grahne (u. a.) | Taschenbuch | Einband - flex.(Paperback) | Englisch | 2002 | Springer | EAN 9783540440802 | Verantwortliche Person für die EU: Springer Nature Customer Service Center GmbH, Europaplatz 3, 69115 Heidelberg, productsafety[at]springernature[dot]com | Anbieter: preigu.

M. mehr. Abb. 64 S. OBr. Rücken etwas berieben. St. u. Sign. a. Umschl. (Acta path. et microbiol. Scand. Suppl. 131). Sprache: Englisch 0 gr.

Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -In a relational database the information is recorded as rowsin tables. However, in many practical situations theavailable information is incomplete and the values for somecolumns are missing. Yet few existing database managementsystems allow the user to enter null values in the database.This monograph analyses the problems raised by allowing nullvalues in relational databases. The analysis coverssemantical, syntactical, and computational aspects.Algorithms for query evaluation, dependency enforcement andupdates in the presence of null values are also given.The analysis of the computational complexity of thealgorithms suggests that from a practical point of view thedatabase should be stored as Horn tables, which aregeneralizations of ordinary relations, allowing null valuesand Horn clause-like restrictions on these null values. Horntables efficiently support a large class of queries,dependencies and updates. 172 pp. Englisch.

Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The papers in this volume represent the technical program of the 8th Biennial Workshop on Data Bases and Programming Languages (DBPL 2001), that was held during September 8 10, 2001, in Frascati, located on the beautiful hills surrounding Rome, in an area favored by the ancient Roman patricians who built their summer residences there. DBPL 2001 continued the tradition of - cellence initiated by its predecessors in Rosco , Finist` ere (1987), Salishan, O- gon (1989), Nafplion, Argolida (1991), Manhattan, New York (1993), Gubbio, Umbria (1995), Estes Park, Colorado (1997), and Kinloch Rannoch, Scotland (1999). Databases grew out of a separation between physical and logical data, thus enabling high-level query languages. Database query languages have evolved in expressive power and structural capabilities. Programming languages have seen a development from assembly languages to high-level declarative paradigms. Thus the two areas approach each other as they mature. Earlier successful cro- fertilizationsbetweenthe eldsincludethecombinationofrelationaltheory,type theory and object-oriented languages, resulting in object-oriented databases, object-relational databases and persistent programming languages. The com- nation of database logic programming and constraint programming p- duceddeductiveandconstraintdatabases.Recently,withtheemergenceofse- structured data models, there is a renewed synergy between databases and p- gramminglanguages,inparticularinthedesignoflanguagestomanipulateXML data. The DBPL 2001 Program Co-Chairs were Giorgio Ghelli (Pisa) and G osta Grahne(Montr eal).TheProgramCommitteeMemberswereCatrielBeeri(Je- salem),DiegoCalvanese(Rome),RichardConnor(Glasgow),AlonHalevy(Se- tle), Leonid Libkin (Toronto), Gianni Mecca (Potenza), Frank Neven (Limburg), Benjamin Pierce (Philadelphia), Chris Ramming (Menlo Park), J er ome Sim eon (Murray Hill), Victor Vianu (San Diego), and Philip Wadler (Basking Ridge). 360 pp. Englisch.

Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. In a relational database the information is recorded as rowsin tables. However, in many practical situations theavailable information is incomplete and the values for somecolumns are missing. Yet few existing database managementsystems allow.

Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Invited Contribution.- Typechecking for Semistructured Data.- Semistructured Data.- Optimization Properties for Classes of Conjunctive Regular Path Queries.- View-Based Query Answering and Query Containment over Semistructured Data.- Model-Checking Based Da.

Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Invited Contribution.- Typechecking for Semistructured Data.- Semistructured Data.- Optimization Properties for Classes of Conjunctive Regular Path Queries.- View-Based Query Answering and Query Containment over Semistructured Data.- Model-Checking Based Data Retrieval.- OLAP and Data Mining.- A Temporal Query Language for OLAP: Implementation and a Case Study.- Attribute Metadata for Relational OLAP and Data Mining.- On Monotone Data Mining Languages.- XML.- Reasoning about Keys for XML.- TAX: A Tree Algebra for XML.- A Rule-Based Querying and Updating Language for XML.- Spatial Databases.- Linear Approximation of Semi-algebraic Spatial Databases Using Transitive Closure Logic, in Arbitrary Dimension.- A Theory of Spatio-temporal Database Queries.- Systems, Schema Integration, Index Concurrency.- An Application-Specific Database.- A Model Theory for Generic Schema Management.- View Serializable Updates of Concurrent Index Structures.- User Languages.- SQL4X: A Flexible Query Language for XML and Relational Databases.- ERX-QL: Querying an Entity-Relationship DB to Obtain XML Documents.- Rules.- Optimising Active Database Rules by Partial Evaluation and Abstract Interpretation.- Simulation of Advanced Transaction Models Using GOLOG.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 360 pp. Englisch.

Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -A null value in a relational database represents missing information. This monograph analyses the problems raised by allowing null values in relational databases. Semantical, syntactical, and computational aspects are covered.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 172 pp. Englisch.