The premise behind developing powerful declarative database languages is compelling: by enabling users to specify their queries (and their integrity constraints) in a clear, nonoperational 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 firstorder 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 wellknown that SQL has some important limitations, in spite of its success and popUlarity. Notably, the query language is nonrecursive, and support for integrity constraints is limited. Indeed, recognizing these problems, the latest standard, SQL92, provides increased support for integrity constraints, and it is anticipated that the successor to the SQL92 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 objectoriented features (another extension likely to appear in SQL3).
The premise behind developing powerful declarative database languages is compelling: by enabling users to specify their queries (and their integrity constraints) in a clear, nonoperational 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 firstorder 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 wellknown that SQL has some important limitations, in spite of its success and popUlarity. Notably, the query language is nonrecursive, and support for integrity constraints is limited. Indeed, recognizing these problems, the latest standard, SQL92, provides increased support for integrity constraints, and it is anticipated that the successor to the SQL92 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 objectoriented features (another extension likely to appear in SQL3).
Barnes & Noble is the world’s largest retail bookseller and a leading retailer of content, digital media and educational products. Our Nook Digital business offers a lineup of NOOK® tablets and e-Readers and an expansive collection of digital reading content through the NOOK Store®. Barnes & Noble’s mission is to operate the best omni-channel specialty retail business in America, helping both our customers and booksellers reach their aspirations, while being a credit to the communities we serve.
