Quantifiers in Action: Generalized Quantification in Query, Logical and Natural LanguagesThe database industry is a multi-billion, world-wide, all-encompassing part of the software world. Quantifiers in Action: Generalized Quantification in Query, Logical and Natural Languages introduces a query language called GQs—Generalized Quantification in Query. Most query languages are simply versions of First Order Logic (FOL). GQs are an extension of the idea of quantifier in FOL. GQs are a perfect example of a practical theory within databases. This book provides a brief background in logic and introduces the concept of GQs, and then develops a query language based on GQs. Using Query Language with Generalized Quantifiers, the reader explores the efficient implementation of the concept, always a primary consideration in databases. This professional book also includes several extensions for use with documents employing question and answer techniques. Designed for practitioners and researchers within the database management field; also suitable for advanced-level students in computer science. |
From inside the book
Results 1-5 of 44
... instance, in query optimization) make it to market in relatively short time. Changes in the industry (for instance, the move to data warehouses) provoke comparable changes in the field, creating whole subareas of research. On the other ...
... instance, if some property can also be expressed in the extended language that could not be expressed in plain FOL, that such property must be somehow related to infinity. A trivial example is that of finiteness, which can be expressed ...
... instance, [94]). We have, then, a theoretical concept that can have practical application, and that has spanned several areas of research. The book's thesis is that Generalized Quantification is a good idea that can be profitable ...
... instance distributed computing, so prominent nowadays with the raise of peer-to-peer systems and cloud computing. While the research in this chapter is just in its beginning stages, it will hopefully be enough to show the adaptability ...
... instance, ψ1 ∧ ψ2 ∨ ψ3 is written as (ψ1 ∧ ψ2) ∨ ψ3 or as ψ1 ∧ (ψ2 ∨ ψ3), depending on what was intended2. We will always assume a special binary relation, equality, denoted by =. As is customary, we will write a = b instead of ...
Contents
1 | |
7 | |
9780387095646_3_OnlinePDF | 24 |
9780387095646_4_OnlinePDF | 37 |
9780387095646_5_OnlinePDF | 55 |
9780387095646_6_OnlinePDF | 73 |
9780387095646_7_OnlinePDF | 90 |
9780387095646_8_OnlinePDF | 107 |
9780387095646_9_OnlinePDF | 127 |
9780387095646_10_OnlinePDF | 149 |
9780387095646_BookBackmatter_OnlinePDF | 157 |
Other editions - View all
Quantifiers in Action: Generalized Quantification in Query, Logical and ... M. P. Fourman,C. J. Mulvey,Dana S. Scott No preview available - 1979 |