Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Fastfds: A heuristic-driven, depth-first algorithm for mining functional dependencies from relation instances extended abstract
C Wyss, C Giannella, E Robertson - … , September 5–7, 2001 Proceedings 3, 2001 - Springer
The problem of discovering functional dependencies (FDs) from an existing relation instance
has received considerable attention in the database research community. To date, even the …
has received considerable attention in the database research community. To date, even the …
Achievements of relational database schema design theory revisited
J Biskup - International Workshop on Semantics in Databases, 1995 - Springer
Database schema design is seen as to decide on formats for time-varying instances, on
rules for supporting inferences and on semantic constraints. Schema design aims at both …
rules for supporting inferences and on semantic constraints. Schema design aims at both …
Finding faithful Boyce-Codd normal form decompositions
H Koehler - International Conference on Algorithmic Applications in …, 2006 - Springer
It is well known that faithful (ie dependency preserving) decompositions of relational
database schemas into Boyce-Codd Normal Form (BCNF) do not always exist, depending …
database schemas into Boyce-Codd Normal Form (BCNF) do not always exist, depending …
Random databases with approximate record matching
In many database applications in telecommunication, environmental and health sciences,
bioinformatics, physics, and econometrics, real-world data are uncertain and subjected to …
bioinformatics, physics, and econometrics, real-world data are uncertain and subjected to …
Database schema design theory: achievements and challenges
J Biskup - International Conference on Information Systems and …, 1995 - Springer
Database schema design is seen as to decide on formats for time-varying instances, on
rules for supporting inferences and on semantic constraints. Schema design aims at both …
rules for supporting inferences and on semantic constraints. Schema design aims at both …
[PDF][PDF] Finding minimal keys in a relation instance
C Giannella, C Wyss - 1999 - Citeseer
Mannila 11] cites as an open problem in Data Mining the problem of nding all minimal keys
in a relation instance using only time that is polynomial in the number of relation attributes …
in a relation instance using only time that is polynomial in the number of relation attributes …
Statistical inference for Rényi entropy functionals
Numerous entropy-type characteristics (functionals) generalizing Rényi entropy are widely
used in mathematical statistics, physics, information theory, and signal processing for …
used in mathematical statistics, physics, information theory, and signal processing for …
Average case analysis in database problems
In a variety of applications ranging from environmental and health sciences to
bioinformatics, it is essential that data collected in large databases are generated …
bioinformatics, it is essential that data collected in large databases are generated …
Statistical Inference for R\'enyi Entropy Functionals
D Källberg, N Leonenko, O Seleznjev - ar**er%20lecture%20notes%5D%20conceptual-modelling-and-its-theoretical-foundations-2012.pdf#page=26" data-clk="hl=no&sa=T&oi=gga&ct=gga&cd=9&d=9825081142149731031&ei=4TjAZ8zOCoC96rQP4Ibo-AY" data-clk-atid="11I5Rz6zWYgJ" target="_blank">[PDF] vnu.edu.vn
Some remarks on relational database schemes having few minimal keys
J Biskup - Conceptual Modelling and Its Theoretical Foundations …, 2012 - Springer
Relational database schemes comprise semantic constraints to formally capture at least part
of the “real-world” semantics of an application. Functional dependencies constitute a basic …
of the “real-world” semantics of an application. Functional dependencies constitute a basic …