Database Theory - ICDT '97 (häftad)
Format
Häftad (Paperback / softback)
Språk
Engelska
Antal sidor
486
Utgivningsdatum
1996-12-01
Upplaga
1997 ed.
Förlag
Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Medarbetare
Afrati, F. N. (ed.), Kolaitis, P. G. (ed.)
Illustrationer
XIV, 486 p.
Dimensioner
234 x 156 x 26 mm
Vikt
695 g
Antal komponenter
1
Komponenter
1 Paperback / softback
ISSN
0302-9743
ISBN
9783540622222
Database Theory - ICDT '97 (häftad)

Database Theory - ICDT '97

6th International Conference, Delphi, Greece, January 8-10, 1997. Proceedings

Häftad Engelska, 1996-12-01
1139
Skickas inom 10-15 vardagar.
Fri frakt inom Sverige för privatpersoner.
Beställ boken senast måndag 30 november för leverans innan julafton
This book constitutes the refereed proceedings of the 6th International Conference on Database Theory, ICDT '97, held in Delphi, Greece, in January 1997. The 29 revised full papers presented in the volume were carefully selected from a total of 118 submissions. Also included are invited papers by Serge Abiteboul and Jeff Ullman as well as a tutorial on data mining by Heikki Mannila. The papers are organized in sections on conjunctive queries in heterogeneous databases, logic and databases, active databases, new applications, concurrency control, unstructured data, object-oriented databases, access methods, and spatial and bulk data.
Visa hela texten

Passar bra ihop

  1. Database Theory - ICDT '97
  2. +
  3. Complexity of Constraints

De som köpt den här boken har ofta också köpt Complexity of Constraints av Nadia Creignou, Phokion G Kolaitis, Heribert Vollmer (häftad).

Köp båda 2 för 1988 kr

Kundrecensioner

Har du läst boken? Sätt ditt betyg »

Fler böcker av författarna

  • Finite Model Theory and Its Applications

    Erich Gradel, Phokion G Kolaitis, Leonid Libkin, Maarten Marx, Joel Spencer

    Finite model theory,as understoodhere, is an areaof mathematicallogic that has developed in close connection with applications to computer science, in particular the theory of computational complexity and database theory. One of the fundamental in...

  • Complexity of Constraints

    Nadia Creignou, Phokion G Kolaitis, Heribert Vollmer

    Nowadays constraint satisfaction problems (CSPs) are ubiquitous in many different areas of computer science, from artificial intelligence and database systems to circuit design, network optimization, and theory of programming languages. Consequent...

Innehållsförteckning

Querying semi-structured data.- Information integration using logical views.- Methods and problems in data mining.- Conjunctive query containment revisited.- Semantics and containment of queries with internal and external conjunctions.- Efficient complete local tests for conjunctive query constraints with negation.- Selection of views to materialize in a data warehouse.- Total and partial well-founded Datalog coincide.- Fine hierarchies of generic computation.- Local properties of query languages.- Expressiveness and complexity of active databases.- A model theoretic approach to update rule programs.- Abstract interpretation of active rules and its use in termination analysis.- Structural issues in active rule systems.- Discovering all most specific sentences by randomized algorithms extended abstract.- A formal foundation for distributed workflow execution based on state charts.- Incorporating user preferences in multimedia queries.- Queries and computation on the Web.- The complexity of iterated belief revision.- Expressive power of unary counters.- Concurrency control theory for deferred materialized views.- Serializability of nested transactions in multidatabases.- Adding structure to unstructured data.- Correspondence and translation for heterogeneous data.- Type-consistency problems for queries in object-oriented databases.- Object-oriented database evolution.- Performance of nearest neighbor queries in R-trees.- Optimal allocation of two-dimensional data (Extended abstract).- Efficient indexing for constraint and temporal databases.- On topological elementary equivalence of spatial databases.- Model-theoretic minimal change operators for constraint databases.- Tractable iteration mechanisms for bag languages.