Database theory - ICDT 99 : 7th International Conference, Jerusalem, Israel, January 10 12, 1999 : proceedings
Databaseresearchisa?eldofcomputersciencewheretheorymeetsapplications. Many concepts and methods, that were regarded as issues of theoretical interest when initially proposed, are now included in implemented database systems and related products. Examples abound in the ?elds of database design, query...
Αποθηκεύτηκε σε:
| Συγγραφή απο Οργανισμό/Αρχή: | |
|---|---|
| Άλλοι συγγραφείς: | , |
| Μορφή: | Livre numérique |
| Γλώσσα: | Anglais |
| Έκδοση: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Σειρά: | Lecture notes in computer science
1540 |
| Θέματα: | |
| Διαθέσιμο Online: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Σημείωση: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Database theory--ICDT'99, 7th International Conference, Jerusalem, Israel, January 10-12, 1999, proceedings, Catriel Beeri, Peter Buneman (eds.), 1999, New York, Springer, 1 vol. (XI-488 p.), Lecture notes in computer science, 3-540-65452-6 • Database Theory - ICDT'99, Texte imprimé, 9783662200483 |
Πίνακας περιεχομένων:
- 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.