Dynamic analysis of some relational databases parameters
From MaRDI portal
Publication:672987
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; zbMATH DE number 4201597
- 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
- scientific article; zbMATH DE number 3856384 (Why is no real title available?)
- scientific article; zbMATH DE number 3974347 (Why is no real title available?)
- scientific article; zbMATH DE number 3736679 (Why is no real title available?)
- scientific article; zbMATH DE number 3274494 (Why is no real title available?)
- A path integral approach to data structure evolution
- Brownian motion and algorithm complexity
- Dynamic algorithms in D. E. Knuth's model: A probabilistic analysis
- Efficient sampling strategies for relational database operations
- Implications of certain assumptions in database performance evauation
- Join sizes, urn models and normal limiting distributions
- Normal Limiting Distributions for Projection and Semijoin Sizes
- On some generalized farlie-gumbel-morgenstern distributions-II regression, correlation and further generalizations
- On the joint distribution of the maximum and its location for a linear diffusion
- Random walks, Gaussian processes and list structures
- Sequence of operations analysis for dynamic data structures
- Statistical profile estimation in database systems
- The analysis of simple list structures
- The first-passage density of a continuous gaussian process to a general boundary
- The maximum of a Gaussian process whose mean path has a maximum, with an application to the strength of bundles of fibres
- The maximum of a random walk whose mean path has a maximum
- Trie size in a dynamic list structure
Cited in
(12)- Dynamic databases with optimal in order time complexity
- On the size of projections: I
- The permutation-path coloring problem on trees.
- Dynamic analysis of the sizes of relations
- Efficient sampling strategies for relational database operations
- Dynamic query interpretation in relational databases
- Average case analysis in database problems
- Distribution of time interval between the modifications of result sets cardinalities in random databases
- scientific article; zbMATH DE number 220141 (Why is no real title available?)
- scientific article; zbMATH DE number 1071533 (Why is no real title available?)
- Occupancy urn models in the analysis of algorithms
- scientific article; zbMATH DE number 4070290 (Why is no real title available?)
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)
