Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Database Theory - ICDT 2001 [[electronic resource] ] : 8th International Conference London, UK, January 4-6, 2001 Proceedings / / edited by Jan Van den Bussche, Victor Vianu
| Database Theory - ICDT 2001 [[electronic resource] ] : 8th International Conference London, UK, January 4-6, 2001 Proceedings / / edited by Jan Van den Bussche, Victor Vianu |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (X, 454 p.) |
| Disciplina | 005.74 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Data structures (Computer science)
Database management Mathematical logic Information storage and retrieval Application software Algorithms Data Structures and Information Theory Database Management Mathematical Logic and Formal Languages Information Storage and Retrieval Information Systems Applications (incl. Internet) Algorithm Analysis and Problem Complexity |
| ISBN | 3-540-44503-X |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Expressive Power of SQL -- Query Evaluation via Tree-Decompositions -- Scalar Aggregation in FD-Inconsistent Databases -- On Decidability and Complexity of Description Logics with Uniqueness Constraints -- Expressiveness Issues and Decision Problems for Active Database Event Queries -- A Theory of Transactions on Recoverable Search Trees -- Minimizing View Sets without Losing Query-Answering Power -- Cost Based Data Dissemination in Broadcast Networks -- Parallelizing the Data Cube -- Asymptotically Optimal Declustering Schemes for Range Queries -- Flexible Data Cubes for Online Aggregation -- Mining for Empty Rectangles in Large Data Sets -- FUN: An Efficient Algorithm for Mining Functional and Embedded Dependencies -- Axiomatization of Frequent Sets -- On Answering Queries in the Presence of Limited Access Patterns -- The Dynamic Complexity of Transitive Closure Is in DynTC° -- Query Languages for Constraint Databases: First-Order Logic, Fixed-Points, and Convex Hulls -- A Semi-monad for Semi-structured Data (ICDT Version) -- Algebraic Rewritings for Optimizing Regular Path Queries -- Why and Where: A Characterization of Data Provenance -- Subsumption for XML Types -- Towards Aggregated Answers for Semistructured Data -- Orthogonal Range Queries in OLAP -- Reasoning about Summarizability in Heterogeneous Multidimensional Schemas -- Estimating Range Queries Using Aggregate Data with Integrity Constraints: A Probabilistic Approach -- Constraint-Based Clustering in Large Databases -- On the Surprising Behavior of Distance Metrics in High Dimensional Space -- On Optimizing Nearest Neighbor Queries in High-Dimensional Data Spaces. |
| Record Nr. | UNISA-996466174303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Database Theory - ICDT 2001 : 8th International Conference London, UK, January 4-6, 2001 Proceedings / / edited by Jan Van den Bussche, Victor Vianu
| Database Theory - ICDT 2001 : 8th International Conference London, UK, January 4-6, 2001 Proceedings / / edited by Jan Van den Bussche, Victor Vianu |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (X, 454 p.) |
| Disciplina | 005.74 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Data structures (Computer science)
Database management Logic, Symbolic and mathematical Information storage and retrieval Application software Algorithms Data Structures and Information Theory Database Management Mathematical Logic and Formal Languages Information Storage and Retrieval Information Systems Applications (incl. Internet) Algorithm Analysis and Problem Complexity |
| ISBN | 3-540-44503-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Expressive Power of SQL -- Query Evaluation via Tree-Decompositions -- Scalar Aggregation in FD-Inconsistent Databases -- On Decidability and Complexity of Description Logics with Uniqueness Constraints -- Expressiveness Issues and Decision Problems for Active Database Event Queries -- A Theory of Transactions on Recoverable Search Trees -- Minimizing View Sets without Losing Query-Answering Power -- Cost Based Data Dissemination in Broadcast Networks -- Parallelizing the Data Cube -- Asymptotically Optimal Declustering Schemes for Range Queries -- Flexible Data Cubes for Online Aggregation -- Mining for Empty Rectangles in Large Data Sets -- FUN: An Efficient Algorithm for Mining Functional and Embedded Dependencies -- Axiomatization of Frequent Sets -- On Answering Queries in the Presence of Limited Access Patterns -- The Dynamic Complexity of Transitive Closure Is in DynTC° -- Query Languages for Constraint Databases: First-Order Logic, Fixed-Points, and Convex Hulls -- A Semi-monad for Semi-structured Data (ICDT Version) -- Algebraic Rewritings for Optimizing Regular Path Queries -- Why and Where: A Characterization of Data Provenance -- Subsumption for XML Types -- Towards Aggregated Answers for Semistructured Data -- Orthogonal Range Queries in OLAP -- Reasoning about Summarizability in Heterogeneous Multidimensional Schemas -- Estimating Range Queries Using Aggregate Data with Integrity Constraints: A Probabilistic Approach -- Constraint-Based Clustering in Large Databases -- On the Surprising Behavior of Distance Metrics in High Dimensional Space -- On Optimizing Nearest Neighbor Queries in High-Dimensional Data Spaces. |
| Record Nr. | UNINA-9910143608303321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||