Smalltalk-80: the language and its implementation
Smalltalk-80: the language and its implementation
The C++ programming language
Queries and views in an object-oriented data model
Proceedings of the second international workshop on Database programming languages
Computational problems related to the design of normal form relational schemas
ACM Transactions on Database Systems (TODS)
Limitations of record-based information models
ACM Transactions on Database Systems (TODS)
Extending the database relational model to capture more meaning
ACM Transactions on Database Systems (TODS)
A language facility for designing database-intensive applications
ACM Transactions on Database Systems (TODS)
Fast Decision Procedures Based on Congruence Closure
Journal of the ACM (JACM)
Variations on the Common Subexpression Problem
Journal of the ACM (JACM)
Principles of Database Systems
Principles of Database Systems
SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
Selection of Indexes to Memory-Resident Entities for Semantic Data
IEEE Transactions on Knowledge and Data Engineering
Theory of Relational Databases
Theory of Relational Databases
Proceedings of the 30th IEEE symposium on Foundations of computer science
Reasoning about nested functional dependencies
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Temporal FDs on complex objects
ACM Transactions on Database Systems (TODS)
Path existence constraints in object-oriented databases
Information organization and databases
Decomposition of object-oriented database schemas
Annals of Mathematics and Artificial Intelligence
Reasoning About Equations and Functional Dependencies on Complex Objects
IEEE Transactions on Knowledge and Data Engineering
A Graph-Based Data Model and its Ramifications
IEEE Transactions on Knowledge and Data Engineering
Consistency Checking in Complex Object Database Schemata with Integrity Constraints
IEEE Transactions on Knowledge and Data Engineering
Designing Functional Dependencies for XML
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
On Decidability and Complexity of Description Logics with Uniqueness Constraints
ICDT '01 Proceedings of the 8th International Conference on Database Theory
On Reasoning about Structural Equality in XML: A Description Logic Approach
ICDT '03 Proceedings of the 9th International Conference on Database Theory
On Interactions of Cardinality Constraints, Key, and Functional Dependencies
FoIKS '00 Proceedings of the First International Symposium on Foundations of Information and Knowledge Systems
Decomposition of Database Classes under Path Functional Dependencies and Onto Constraints
FoIKS '00 Proceedings of the First International Symposium on Foundations of Information and Knowledge Systems
Reasoning about Duplicate Elimination with Description Logic
CL '00 Proceedings of the First International Conference on Computational Logic
Reasoning about Uniqueness Constraints in Object Relational Databases
IEEE Transactions on Knowledge and Data Engineering
On reasoning about structural equality in XML: a description logic approach
Theoretical Computer Science - Database theory
Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets
Theoretical Computer Science - Logic, language, information and computation
On a problem of Fagin concerning multivalued dependencies in relational databases
Theoretical Computer Science
On the logical implication of multivalued dependencies with null values
CATS '06 Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51
Deciding implication for functional dependencies in complex-value databases
Theoretical Computer Science - Logic, language, information and computation
On inferences of full hierarchical dependencies
ACSC '07 Proceedings of the thirtieth Australasian conference on Computer science - Volume 62
Full hierarchical dependencies in fixed and undetermined universes
Annals of Mathematics and Artificial Intelligence
Survey of graph database models
ACM Computing Surveys (CSUR)
Constraint acquisition you can chase but you cannot find
APCCM '08 Proceedings of the fifth Asia-Pacific conference on Conceptual Modelling - Volume 79
Efficient reasoning about a robust XML key fragment
ACM Transactions on Database Systems (TODS)
ICFCA '09 Proceedings of the 7th International Conference on Formal Concept Analysis
Boolean Constraints for XML Modeling
Proceedings of the 2009 conference on Information Modelling and Knowledge Bases XX
Constraint acquisition for Entity-Relationship models
Data & Knowledge Engineering
The Implication Problem of Functional Dependencies in Complex-value Databases
Electronic Notes in Theoretical Computer Science (ENTCS)
Decomposition by pivoting and path cardinality constraints
ER'00 Proceedings of the 19th international conference on Conceptual modeling
On order dependencies for the semantic web
ER'07 Proceedings of the 26th international conference on Conceptual modeling
Appropriate reasoning about data dependencies in fixed and undetermined universes
FoIKS'08 Proceedings of the 5th international conference on Foundations of information and knowledge systems
When data dependencies over SQL tables meet the logics of paradox and S-3
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the role of the complementation rule for data dependencies over incomplete relations
WoLLIC'10 Proceedings of the 17th international conference on Logic, language, information and computation
Extending functional dependency to detect abnormal data in RDF graphs
ISWC'11 Proceedings of the 10th international conference on The semantic web - Volume Part I
Design by example for SQL table definitions with functional dependencies
The VLDB Journal — The International Journal on Very Large Data Bases
Conditional functional dependencies: an FCA point of view
ICFCA'10 Proceedings of the 8th international conference on Formal Concept Analysis
Axiomatising functional dependencies for XML with frequencies
FoIKS'06 Proceedings of the 4th international conference on Foundations of Information and Knowledge Systems
On multivalued dependencies in fixed and undetermined universes
FoIKS'06 Proceedings of the 4th international conference on Foundations of Information and Knowledge Systems
Characterisations of multivalued dependency implication over undetermined universes
Journal of Computer and System Sciences
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
ACM Transactions on Database Systems (TODS)
Appropriate inferences of data dependencies in relational databases
Annals of Mathematics and Artificial Intelligence
On Inferences of Full First-Order Hierarchical Decompositions
Fundamenta Informaticae - Logic, Language, Information and Computation
Reasoning about functional and full hierarchical dependencies over partial relations
Information Sciences: an International Journal
On the logical implication of multivalued dependencies with null values
CATS '06 Proceedings of the Twelfth Computing: The Australasian Theory Symposium - Volume 51
Letting keys and functional dependencies out of the bag
APCCM '13 Proceedings of the Ninth Asia-Pacific Conference on Conceptual Modelling - Volume 143
| Hi-index | 0.00 |
We propose a more general form of functional dependency for semantic data models that derives from their common feature in which the separate notions of domain and relation in the relational model are combined into a single notion of class. This usually results in a richer terminological component for their query languages, whereby terms may navigate through any number of properties, including none. We prove the richer expressiveness of this more general functional dependency, and exhibit a sound and complete set of inference axioms. Although the general problem of decidability of their logical implication remains open at this time, we present decision procedures for cases in which the dependencies included in a schema correspond to keys, or in which the schema itself is acyclic. The theory is then extended to include a form of conjunctive query. Of particular significance is that the query becomes an additional source of functional dependency. Finally, we outline several applications of the theory to various problems in physical design and in query optimization. The applications derive from an ability to predict when a query can have at most one solution.