Data sciences: from relations to semistructured data and XML / Serge Abiteboul, Peter Buneman and Dan Suciu

1 Introduction
1.1 Audience
1.2 Web Data and the Two Cultures
1.3 Organization
1 Data Model
2 A Syntax for Data
2.1 Base Types
2.2 Representing Relational Databases
2.3 Representing Object Databases
2.4 Specification of Syntax
2.5 The Object Exchange Model (OEM)
2.6 Object Databases
2.7 Other Representations
2.7.1 ACeDB
2.8 Terminology
2.9 Bibliographic Remarks
3 XML
3.1 Basic Syntax
3.1.1 XML Elements
3.1.2 XML Attributes
3.1.3 Well;JEormed XML Documents
3.2 XML and Semistructured Data
3.2.1 XML Graph Model
3.2.2 XML References
3.2.3 Order
3.2.4 Mixing Elements and Text
3.2.5 Other XML Constructs
3.3 Document Type Definitions
3.3.1 A Simple DTD
3.3.2 DTDs as Grammars
3.3.3 DTDs as Schemas
3.3.4 Declaring Attributes in DTDs
3.3.5 Valid XML Documents
3.3.6 Limitations of DTDs as Schemas
3.4 Document Navigation
3.5 DCD
3.6 Paraphernalia
3.6.1 RDF
3.6.2 Stylesheets
3.6.3 SAX and DOM
3.7 Bibliographic Remarks
11 Queries
4 Query Languages
4.1 Path Expressions
4.2 A Core Language
4.2.1 The Basic Syntax
4.3 More on Lorel
4.3.1 Less Essential Syntactic Sugaring
4.4 UnQL
4.5 Label and Path Variables
4.5.1 Paths as Data
4.6 Mixing with Structured Data
4.7 Bibliographic Remarks
5 Query Languages for XML
5.1 XML-QL
5.1.1 Constructing New XML Data
5.1.2 Processing Optional Elements with Nested Queries
5.1.3 Grouping widi Nested Queries .
5.1.4 Binding Elements and Contents
5.1.5 Querying Attributes
5.1.6 Joining Elements by Value
5.1.7 Tag Variables
5.1.8 Regular Path Expressions .
5.1.9 Order
5.2 XSL.
5.3 Bibliographic Remarks
6 Interpretation and Advanced Features
6.1 First-Order Interpretation
6.2 Object Creation
6.3 Graphical Languages
6.4 Structural Recursion
6.4.1 Structural Recursion on Trees
6.4.2 XSL and Structural Recursion
6.4.3 Bisimulation in Semistructured Data
6.4.4 Structural Recursion on Cyclic Data
6.5 StruQL
6.6 Bibliographic Remarks
III Types
7 Typing Semistructured Data .
7.1 What Is Typing Good For?
7.1.1 Browsing and Querying Data
7.1.2 Optimizing Query Evaluation
7.1.3 Improving Storage
7.2 Analyzing the Problem
7.3 Schema Formalisms
7.3.1 Logic
7.3.2 Datalog
7.3.3 Simulation
7.3.4 Comparison between Datalog Rules and Simulation
7.4 Extracting Schemas from Data
7.4.1 Data Guides
7.4.2 Extracting Datalog Rules from Data
7.5 Inferring Schemas from Queries
7.6 Sharing, Multiplicity, and Order
7.6.1 Sharing
7.6.2 Attribute Multiplicity
7.6.3 Order
7.7 Path Constraints
7.7.1 Constraints in Relational Databases
7.7.2 Constraints in Object-Oriented Databases
7.7.3 Patih Constraints in Semistructured Data
7.7.4 The Constraint Inference Problem
7.7.5 Constraints in XML
7.8 Bibliographic Remarks
rv Systems
8 Query Processing
8.1 Architecture.
8.2 Semistructured Data Servers
8.2.1 Storage .
8.2.2 Indexing
8.2.3 Distributed Evaluation
8.3 Mediators for Semistructured Data
8.3.1 A Simple Mediator: Converting Relational Data to XML
8.3.2 Mediators for Data Integration
8.4 Incremental Maintenance
8.5 Bibliographic Remarks
9 The Lore System
9.1 Architecture
9.2 Query Processing and Indexes
9.3 Other Aspects of Lore
9.3.1 The Data Guide
9.3.2 Managing External Data
9.3.3 Proximity Search
9.3.4 Views
9.3.5 Dynamic OEM and Chorel
9.3.6 Mixing Structured and Semistructured in Ozone
9.4 Bibliographic Remarks
10 Strudel
10.1 An Example
10.1.1 Data Management
10.1.2 Structure Management
10.1.3 Management of the Graphical Presentation
10.2 Advantages of Declarative Web Site Design
10.3 BiWiographic Remarks
11 Database Products Supporting XML
11.1 Architecture
11.2 Storage . .
11.3 Application Programming Interface
11.4 Query language
11.5 Scalability
11.6 Bibliographic Remarks