Database Theory - ICDT '92: 4th International Conference, Berlin, Germany, October 14-16, 1992. Proceedings / Edition 1

Paperback (Print)
Buy New
Buy New from
Used and New from Other Sellers
Used and New from Other Sellers
from $4.59
Usually ships in 1-2 business days
(Save 96%)
Other sellers (Paperback)
  • All (14) from $4.59   
  • New (6) from $93.65   
  • Used (8) from $4.59   


The papers in this volume were presented at the
International Conference on Database Theory, held in Berlin,
Germany, October 14-16, 1992. This conference initiated the merger of two series of conferences on theoretical aspects of databases that were formed in parallel by different scientific communities in Europe. The first series was known as the International Conference on Database Theory and the second as the Symposium on Mathematical Fundamentals of
Database Systems. In the future, ICDT will be organized every two years, alternating with the more practically oriented series of conferences on Extending Database
Technology (EDBT).
The volume contains 3 invited lectures and 26 contributed papers selected from a total of 107 submissions. The papers are organized into sections on constraints and decomposition, query languages, updates and active databases, concurrency control and recovery, knowledge bases, datalog complexity and optimization, object orientation, information capacity and security, and data structures and algorithms. Two of the invited papers survey research into theoretical database issues done in Eastern
Europe during the past decade.

Read More Show Less

Product Details

  • ISBN-13: 9783540560395
  • Publisher: Springer Berlin Heidelberg
  • Publication date: 11/5/1992
  • Series: Lecture Notes in Computer Science Series, #646
  • Edition description: 1992
  • Edition number: 1
  • Pages: 454
  • Product dimensions: 9.21 (w) x 6.14 (h) x 0.94 (d)

Table of Contents

Combinatorial and algebraic results for database relations.- Semantics of disjunctive deductive databases.- Database theory in Russia (1979–1991) (an overview).- On the composition and decomposition of attributes and tuples.- Approximate dependency inference from relations.- Views and decompositions of databases from a categorical perspective.- Computing with infinitary logic.- Query languages with counters.- Naturally embedded query languages.- Optimizing incremental computation of datalog programs with non-deterministic semantics.- Optimizing active databases using the split technique (Preliminary Report).- Updating atomic information in labelled database systems (extended abstract).- Context-specific synchronization for atomic data types.- Hybrid atomicity for nested transactions.- Model and verification of a data manager based on ARIES.- Minimizing indefinite information in disjunctive deductive databases.- Well founded semantics and stable semantics of semi-strict programs.- On finding extensions of default theories.- Incremental evaluation of Datalog queries.- Decidability and undecidability of equivalence for linear Datalog, with applications to normal-form optimizations.- A paradox in database theory.- A hierarchy of faithful set creation in pure OODB's.- Identification, genericity and consistency in object-oriented databases.- Subsumption for complex object data models.- Semantic information connected with data.- Declarative foundations of secure deductive databases.- On materializing views and on-line queries.- Maintaining dictionaries: Space-saving modifications of B-trees.- Set-term matching in logic programming.

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star


4 Star


3 Star


2 Star


1 Star


Your Rating:

Your Name: Create a Pen Name or

Barnes & Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation


  • - By submitting a review, you grant to Barnes & and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Terms of Use.
  • - Barnes & reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)