Random databases with approximate record matching

Methodology and Computing in Applied Probability

Volumn 12, Issue 1, 2010, Pages 63-89

  Seleznjev, Oleg ^a,b   Thalheim, Bernhard ^c  

^a UMEÅ UNIVERSITY   (Sweden)

^b MOSCOW STATE UNIVERSITY   (Russian Federation)

^c UNIVERSITY OF KIEL   (Germany)

Author keywords

Approximate matching; Join; Poisson approximation; Random database; R nyi entropy; Tests

Indexed keywords

EID: 77951298634     PISSN: 13875841     EISSN: 15737713     Source Type: Journal    
DOI: 10.1007/s11009-008-9092-4     Document Type: Article

References (31)

1. Barbour AD, Holst L, Janson S (1992) Poisson approximation. Clarendon, Oxford.
2. Bronski JC (2003) Small ball constant and tight eigenvalue asymptotic for fractional Brownian motion. J Theor Probab 16: 87-100.
3. Bruno N, Chaudhuri S (2002) Exploiting statistics on query expressions for optimization. In: Proc ACM SIGMOD02, pp 263-274.
4. Christodoulakis S (1983) Estimating record selectivities. Inf Syst 8: 105-115.
5. Copas JB, Hilton FJ (1990) Record linkage: statistical models for matching computer records. J R Stat Soc Ser A 153: 287-320.
6. Dalvi N, Suciu D (2005) Answering queries from statistics and probabilistic views. In: Proc VLDB05, Conf. Oslo, Norway, pp 805-816.
7. Dembo A, Kontoyiannis I (2002) Source coding, large deviations, and approximate pattern matching. IEEE Trans Infrom Th 48: 1590-1615.
8. Demetrovics J, Katona GOH, Miklós D, Seleznjev O, Thalheim B (1995) The average length of keys and functional dependencies in (random) databases. In: Gottlob G, Vardi M (eds) Proc ICDT95 LN in Comp Sc, vol 893. Springer, Berlin, pp 266-279.
9. Demetrovics J, Katona GOH, Miklós D, Seleznjev O, Thalheim B (1998a) Asymptotic properties of keys and functional dependencies in random databases. Theor Comp Sci 190: 151-166.
10. Demetrovics J, Katona GOH, Miklós D, Seleznjev O, Thalheim B (1998b) Functional dependencies in random databases. Stud Sci Math Hung 34: 127-140.
11. Dereich S (2003) Small ball probabilities around random centers of Gaussian measures and application to quantization. J Theor Prob 16: 427-449.
12. Graf S, Luschgy H (2000) Foundation of quantization for probability distributions. In: LN in Math, vol 1730. Springer, Berlin.
13. Hachem NI, Bao C, Taylor S (1996) Approximate query answering in numerical databases. In: Proc SSDBM, vol 8, pp 63-73.
14. Haussler D, Opper M (1995) General bounds on the mutual information between a parameter and n conditionally independent observations. In: Proc 7th Ann. ACW workshop comp. learn. Th., ACM Press: New York, pp 402-411.
15. Hernández MA, Stolfo SJ (1998) Real-world data is dirty: data cleansing and the merge/purge problem. Data Mining and Knowledge Discovery 2: 9-37.
16. Kapur JN, Kesavan HK (1992) Entropy optimization principles with applications. Academic, New York.
17. Kifer M, Bernstein A, Lewis Ph M (2005) Database systems: an application-oriented approach. Addison Wesley.
18. Kuelbs J, Li WV (1993) Metric entropy and the small ball problem for Gaussian measures. J Func Anal 116: 133-157.
19. Li WV, Shao Q-M (2001) Gaussian processes: inequalities, small ball probabilities, and applications. In: Rao CR, Shanbhag D (eds) Stochastic processes: theory and methods. Handbook of Statistics, vol 19. Elsevier, New York pp 533-598.
20. Lifshits M (1999) Asymptotic behavior of small ball probabilities. In: Prob. Theory and Math Stat, 23th European Meet Stat, VSP/TEV, pp 453-468.
21. Luczak T, Szpankovwski W (1997) A suboptimal lossy data compression based in approximate pattern matching. IEEE Trans Inf Theory 4: 1439-1451.
22. Posner EC, Rodemich EE, Rumsey H Jr (1969) Epsilon entropy of Gaussian processes. Ann Math Stat 40: 1272-1296.
23. Prohorov Yu V, Rozanov Yu A (1970) Probability theory. Springer: New York.
24. Rényi A (1961) On measures of entropy and information. In: 4th Berkley Symp Math Statist Prob, vol I. Berkeley, Univ Calif Press, pp 547-561.
25. Rényi A (1970) Probability theory. North-Holland, London.
26. Seleznjev O, Thalheim B (2003) Average case analysis in database problems. Meth Comput Appl Probab 5: 395-418.
27. Shykula M, Seleznjev O (2006) Stochastic structure of asymptotic quantization errors. Stat Probab Lett 76: 453-464.
28. Steinbrunn M, Moerkotte G, Kemper A (1997) Heuristic and randomized optimization for the join ordering problem. VLDB 6: 191-208.
29. Szpankowski W (1991) On the height of digital trees and related problems. Algorithmica 6: 256-277.
30. Szpankowski W (2001) Average case analysis of algorithms on sequences. Wiley, New York.
31. Thalheim B (2000) Entity-relationship modeling. Foundations of database technology. Springer, Berlin.