Database Theory - ICDT'99

Invited Talks.- Issues Raised by Three Years of Developing PJama: An Orthogonally Persistent Platform for Java(TM).- 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 ofConstraint 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 Frequent Closed 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