Database Theory - ICDT'99
Editat de Catriel Beeri, Peter Bunemanen Limba Engleză Paperback – 18 dec 1998
Preț: 332.81 lei
Preț vechi: 416.02 lei
-20%
Puncte Express: 499
Carte tipărită la comandă
Livrare economică 14-28 iulie
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 400.00 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783540654520
ISBN-10: 3540654526
Pagini: 508
Ilustrații: XII, 496 p.
Dimensiuni: 155 x 235 x 28 mm
Greutate: 0.76 kg
Ediția:1999
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540654526
Pagini: 508
Ilustrații: XII, 496 p.
Dimensiuni: 155 x 235 x 28 mm
Greutate: 0.76 kg
Ediția:1999
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Invited Talks.- Issues Raised by Three Years of Developing PJama: An Orthogonally Persistent Platform for Java™.- Novel Computational Approaches to Information Retrieval and Data Mining.- Tutorial.- Description Logics and Their Relationships with Databases.- Query Languages.- An Equational Chase for Path-Conjunctive Queries, Constraints, Views.- Adding For-Loops to First-Order Logic.- Logic.- Definability and Descriptive Complexity on Databases of Bounded Tree-Width.- Decidability of First-Order Logic Queries over Views.- Performence I.- Urn Models and Yao’s Formula.- On the Generation of 2-Dimensional Index Workloads.- Increasing the Expressiveness of Analytical Performance Models for Replicated Databases.- Concurrency and Distribution.- Transactions in Stack, Fork, and Join Composite Systems.- Databases for Tracking Mobile Units in Real Time.- Constraint Databases.- On Capturing First-Order Topological Properties of Planar Spatial Databases.- On the Orthographic Dimension of Constraint Databases.- Index Structures.- When Is “Nearest Neighbor” Meaningful?.- On Rectangular Partitionings in Two Dimensions: Algorithms, Complexity and Applications.- Optimal Dynamic Range Searching inNon-replicating Index Structures.- Index Structures for Path Expressions.- Semi-Structured Data.- Schemas for Integration and Translation of Structured and Semi-structured Data.- In Search of the Lost Schema.- Mediation.- Tableau Techniques for Querying Information Sources through Global Schemas.- Optimizing Large Join Queries in Mediation Systems.- Computational Issues.- Incremental FO( +, < ) Maintenance of All-Pairs Shortest Paths for Undirected Graphs after Insertions and Deletions.- A Framework for the Investigation of Aggregate Functions in Database Queries.- Discovering FrequentClosed Itemsets for Association Rules.- Views.- View Disassembly.- Answering Queries Using Materialized Views with Disjunctions.- Selection of Views to Materialize Under a Maintenance Cost Constraint.- The Data Warehouse of Newsgroups.