Dynamic analysis of some relational databases parameters
From MaRDI portal
Publication:672987
DOI10.1016/0304-3975(94)00305-3zbMATH Open0874.68089OpenAlexW1973435422MaRDI QIDQ672987FDOQ672987
Authors: Guy Louchard, Danièle Gardy 
Publication date: 28 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)00305-3
Recommendations
- scientific article; zbMATH DE number 1071533
- Dynamic query interpretation in relational databases
- scientific article; zbMATH DE number 194564
- Analysis and optimization of active databases
- scientific article
- Analysis of database performance with dynamic locking
- scientific article; zbMATH DE number 194118
- Analyzing FD inference in relational databases
- Specification and verification of database dynamics
Cites Work
- Title not available (Why is that?)
- The first-passage density of a continuous gaussian process to a general boundary
- Title not available (Why is that?)
- On some generalized farlie-gumbel-morgenstern distributions-II regression, correlation and further generalizations
- Sequence of operations analysis for dynamic data structures
- The maximum of a random walk whose mean path has a maximum
- On the joint distribution of the maximum and its location for a linear diffusion
- The analysis of simple list structures
- Random walks, Gaussian processes and list structures
- The maximum of a Gaussian process whose mean path has a maximum, with an application to the strength of bundles of fibres
- Brownian motion and algorithm complexity
- A path integral approach to data structure evolution
- Dynamic algorithms in D. E. Knuth's model: A probabilistic analysis
- Join sizes, urn models and normal limiting distributions
- Title not available (Why is that?)
- Implications of certain assumptions in database performance evauation
- Title not available (Why is that?)
- Statistical profile estimation in database systems
- Normal Limiting Distributions for Projection and Semijoin Sizes
- Trie size in a dynamic list structure
- Efficient sampling strategies for relational database operations
Cited In (12)
- Occupancy urn models in the analysis of algorithms
- On the size of projections: I
- Title not available (Why is that?)
- Distribution of time interval between the modifications of result sets cardinalities in random databases
- Dynamic databases with optimal in order time complexity
- Average case analysis in database problems
- The permutation-path coloring problem on trees.
- Dynamic query interpretation in relational databases
- Title not available (Why is that?)
- Dynamic analysis of the sizes of relations
- Title not available (Why is that?)
- Efficient sampling strategies for relational database operations
This page was built for publication: Dynamic analysis of some relational databases parameters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672987)
