Dynamic analysis of some relational databases parameters
From MaRDI portal
Publication:672987
DOI10.1016/0304-3975(94)00305-3zbMath0874.68089OpenAlexW1973435422MaRDI QIDQ672987
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
Related Items (2)
Occupancy urn models in the analysis of algorithms ⋮ The permutation-path coloring problem on trees.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient sampling strategies for relational database operations
- The analysis of simple list structures
- Brownian motion and algorithm complexity
- On the joint distribution of the maximum and its location for a linear diffusion
- Random walks, Gaussian processes and list structures
- 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
- Implications of certain assumptions in database performance evauation
- The maximum of a random walk whose mean path has a maximum
- The first-passage density of a continuous gaussian process to a general boundary
- Statistical profile estimation in database systems
- The maximum of a Gaussian process whose mean path has a maximum, with an application to the strength of bundles of fibres
- Sequence of operations analysis for dynamic data structures
- Normal Limiting Distributions for Projection and Semijoin Sizes
- On some generalized farlie-gumbel-morgenstern distributions-II regression, correlation and further generalizations
- Trie size in a dynamic list structure
This page was built for publication: Dynamic analysis of some relational databases parameters
