New type of coding problem motivated by database theory
Discrete Applied Mathematics - Discrete mathematics & data mining (DM & DM)
Counter-free keys and functional dependencies in higher-order datamodels
Fundamenta Informaticae
Discovering branching and fractional dependencies in databases
Data & Knowledge Engineering
Keys and Armstrong databases in trees with restructuring
Acta Cybernetica
New type of coding problem motivated by database theory
Discrete Applied Mathematics
On the existence of armstrong instances with bounded domains
FoIKS'08 Proceedings of the 5th international conference on Foundations of information and knowledge systems
Coding theory motivated by relational databases
SDKB'10 Proceedings of the 4th international conference on Semantics in data and knowledge bases
On the existence of armstrong data trees for XML functional dependencies
FoIKS'10 Proceedings of the 6th international conference on Foundations of Information and Knowledge Systems
Counter-Free Keys and Functional Dependencies in Higher-Order Datamodels
Fundamenta Informaticae
| Hi-index | 0.00 |