Random databases with approximate record matching

DOI10.1007/s11009-008-9092-4zbMath1182.62010OpenAlexW2090082608WikidataQ57376357 ScholiaQ57376357MaRDI QIDQ2270185

Oleg Seleznjev, Bernhard Thalheim

Publication date: 15 March 2010

Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11009-008-9092-4

Mathematics Subject Classification ID

Asymptotic distribution theory in statistics (62E20) Database theory (68P15) Applications of statistics (62P99) Statistical aspects of information-theoretic topics (62B10)

Related Items (5)

Random Databases with Correlated Data ⋮ Statistical Inference for Rényi Entropy Functionals ⋮ Statistical estimation of quadratic Rényi entropy for a stationarym-dependent sequence ⋮ Statistical inference for the \(\epsilon \)-entropy and the quadratic Rényi entropy ⋮ Estimation of entropy-type integral functionals

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the height of digital trees and related problems
• Metric entropy and the small ball problem for Gaussian measures
• Asymptotic properties of keys and functional dependencies in random databases
• Small ball probabilities around random centers of Gaussian measures and applications to quantization
• Average case analysis in database problems
• Small ball constants and tight eigenvalue asymptotics for fractional Brownian motions
• Foundations of quantization for probability distributions
• Stochastic structure of asymptotic quantization errors
• A suboptimal lossy data compression based on approximate pattern matching
• Source coding, large deviations, and approximate pattern matching
• Epsilon Entropy of Gaussian Processes

This page was built for publication: Random databases with approximate record matching