The premise behind developing powerful declarative database languages is compelling: by enabling users to specify their queries (and their integrity constraints) in a clear, non-operational way, they make the user's task easier, and provide the database system with more opportunities for optimization. Relational database systems offer a striking proof that this premise is indeed valid. The most popular relational query language, SQL, is based upon relational algebra and calculus, i.e., a small fragment of first-order logic, and the ease of writing queries in SQL (in comparison to more navigational languages) has been an important factor in the commercial success of relational databases. It is well-known that SQL has some important limitations, in spite of its success and popUlarity. Notably, the query language is non-recursive, and support for integrity constraints is limited. Indeed, recognizing these problems, the latest standard, SQL-92, provides increased support for integrity constraints, and it is anticipated that the successor to the SQL-92 standard, called SQL3, RECURSIVE UNION operation [1]. Logic database systems have will include a concentrated on these extensions to the relational database paradigm, and some systems (e.g., Bull's DEL prototype) have even incorporated object-oriented features (another extension likely to appear in SQL3).
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Preface. 1. Applications of Deductive Object-Oriented Databases Using DEL; O.D. Friesen, G. Gauthier-Villars, L. Vieille. 2. Q-Data: Using Deductive Database Technology to Improve Data Quality; A. Sheth, C. Wood, V. Kashyap. 3. A Deductive Front-End for Relational Databases; B. Livezey, E. Simoudis. 4. An ADITI Implementation of a Flights Database; J. Harland, K. Ramamohanarao. 5. Using LDL++ for Spatio-Temporal Reasoning in Atmospheric Science Databases; R.R. Muntz, E. Shek, C. Zaniolo. 6. MIMSY: a System for Stock Market Analysis; W.G. Roth, R. Ramakrishnan, P. Seshadri. 7. Efficient Evaluation of Visual Queries Using Deductive Databases; D. Vista, P.T. Wood. 8. Demand Interprocedural Program Analysis Using Logic Databases; T.W. Reps. 9. AMOS: a Natural Language Parser Implemented as a Deductive Database in LOLA; G. Specht, B. Freitag. 10. Programming the PTQ Grammar in XSB; D.S. Warren. 11. Querying with Generalized Quantifiers; A. Badia, D. Van Gucht, M. Gyssens. 12. Requirements for a Deductive Query Language in a Genome-Mapping Database; N. Goodman, S. Rozen, L. Stein. Index.
Book by None
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
EUR 9,95 per la spedizione da Germania a Italia
Destinazione, tempi e costiEUR 9,70 per la spedizione da Germania a Italia
Destinazione, tempi e costiDa: books4less (Versandantiquariat Petra Gros GmbH & Co. KG), Welling, Germania
gebundene Ausgabe. Condizione: Gut. 280 Seiten; Das hier angebotene Buch stammt aus einer teilaufgelösten wissenschaftlichen Bibliothek und trägt die entsprechenden Kennzeichnungen (Rückenschild, Instituts-Stempel.); Schnitt und Einband sind etwas staubschmutzig; der Buchzustand ist ansonsten ordentlich und dem Alter entsprechend gut. Text in ENGLISCHER Sprache! Sprache: Englisch Gewicht in Gramm: 720. Codice articolo 1586481
Quantità: 1 disponibili
Da: Buchpark, Trebbin, Germania
Condizione: Gut. Zustand: Gut | Seiten: 308 | Sprache: Englisch | Produktart: Bücher. Codice articolo 2057388/3
Quantità: 1 disponibili
Da: Buchpark, Trebbin, Germania
Condizione: Sehr gut. Zustand: Sehr gut | Seiten: 308 | Sprache: Englisch | Produktart: Bücher. Codice articolo 2057388/2
Quantità: 1 disponibili
Da: Ammareal, Morangis, Francia
Hardcover. Condizione: Très bon. Ancien livre de bibliothèque. Salissures sur la tranche. Edition 1995. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Stains on the edge. Edition 1995. Ammareal gives back up to 15% of this item's net price to charity organizations. Codice articolo E-499-780
Quantità: 1 disponibili
Da: moluna, Greven, Germania
Gebunden. Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. The premise behind developing powerful declarative database languages is compelling: by enabling users to specify their queries (and their integrity constraints) in a clear, non-operational way, they make the user s task easier, and provide the database sys. Codice articolo 5971567
Quantità: Più di 20 disponibili
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Buch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -The premise behind developing powerful declarative database languages is compelling: by enabling users to specify their queries (and their integrity constraints) in a clear, non-operational way, they make the user's task easier, and provide the database system with more opportunities for optimization. Relational database systems offer a striking proof that this premise is indeed valid. The most popular relational query language, SQL, is based upon relational algebra and calculus, i.e., a small fragment of first-order logic, and the ease of writing queries in SQL (in comparison to more navigational languages) has been an important factor in the commercial success of relational databases. It is well-known that SQL has some important limitations, in spite of its success and popUlarity. Notably, the query language is non-recursive, and support for integrity constraints is limited. Indeed, recognizing these problems, the latest standard, SQL-92, provides increased support for integrity constraints, and it is anticipated that the successor to the SQL-92 standard, called SQL3, RECURSIVE UNION operation [1]. Logic database systems have will include a concentrated on these extensions to the relational database paradigm, and some systems (e.g., Bull's DEL prototype) have even incorporated object-oriented features (another extension likely to appear in SQL3).Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 308 pp. Englisch. Codice articolo 9780792395331
Quantità: 1 disponibili
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: New. Codice articolo 758018-n
Quantità: Più di 20 disponibili
Da: Ria Christie Collections, Uxbridge, Regno Unito
Condizione: New. In. Codice articolo ria9780792395331_new
Quantità: Più di 20 disponibili
Da: AHA-BUCH GmbH, Einbeck, Germania
Buch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - The premise behind developing powerful declarative database languages is compelling: by enabling users to specify their queries (and their integrity constraints) in a clear, non-operational way, they make the user's task easier, and provide the database system with more opportunities for optimization. Relational database systems offer a striking proof that this premise is indeed valid. The most popular relational query language, SQL, is based upon relational algebra and calculus, i.e., a small fragment of first-order logic, and the ease of writing queries in SQL (in comparison to more navigational languages) has been an important factor in the commercial success of relational databases. It is well-known that SQL has some important limitations, in spite of its success and popUlarity. Notably, the query language is non-recursive, and support for integrity constraints is limited. Indeed, recognizing these problems, the latest standard, SQL-92, provides increased support for integrity constraints, and it is anticipated that the successor to the SQL-92 standard, called SQL3, RECURSIVE UNION operation [1]. Logic database systems have will include a concentrated on these extensions to the relational database paradigm, and some systems (e.g., Bull's DEL prototype) have even incorporated object-oriented features (another extension likely to appear in SQL3). Codice articolo 9780792395331
Quantità: 1 disponibili
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Condizione: New. Codice articolo 758018-n
Quantità: Più di 20 disponibili