首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Average Case Analysis in Database Problems
Authors:Oleg Seleznjev  Bernhard Thalheim
Institution:(1) Department of Mathematical Statistics, Umeå University, SE-901 87 Umeå, Sweden;(2) Faculty of Mathematics and Mechanics, Moscow State University, 119 992 Moscow, Russia;(3) Computer Science Institute, Brandenburg University of Technology at Cottbus, PB 101344, D-03013 Cottbus, Germany
Abstract:In a variety of applications ranging from environmental and health sciences to bioinformatics, it is essential that data collected in large databases are generated stochastically. This states qualitatively new problems both for statistics and for computer science. Namely, instead of deterministic (usually worst case) analysis, the average case analysis is needed for many standard database problems. Since both stochastic and deterministic methods and notation are used it causes additional difficulties for an investigation of such problems and for an exposition of results. We consider a general class of probabilistic models for databases and study a few problems in a probabilistic framework. In order to demonstrate the general approach, the problems for systems of database constraints (keys, functional dependencies and related) are investigated in more detail. Our approach is based on consequent using Rényi entropy as a main characteristic of uncertainty of distribution and Poisson approximation (Stein–Chen technique) of the corresponding probabilities.
Keywords:random database  tests  keys  extreme values    nyi entropy  Poisson (Stein–  Chen) approximation
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号