The following pages link to (Q3668890):
Displaying 50 items.
- On computing minimal independent support and its applications to sampling and counting (Q265701) (← links)
- On keys and normal forms (Q287084) (← links)
- On improving dependency implication algorithms (Q287258) (← links)
- A complete axiomatization of full acyclic join dependencies (Q293431) (← links)
- Optimal covers in the relational database model (Q303689) (← links)
- On minimal constraint networks (Q359976) (← links)
- A relation-algebraic approach to the ``Hoare logic'' of functional dependencies (Q406457) (← links)
- Autonomous sets for the hypergraph of all canonical covers (Q429444) (← links)
- The implication problem for `closest node' functional dependencies in complete XML documents (Q439971) (← links)
- On conditions for mappings to preserve optimal solutions of semiring-induced valuation algebras (Q481102) (← links)
- On critical sets of a finite Moore family (Q481926) (← links)
- The joy of implications, aka pure Horn formulas: mainly a survey (Q507516) (← links)
- Succinctness and tractability of closure operator representations (Q507522) (← links)
- Hydras: directed hypergraphs and Horn formulas (Q507537) (← links)
- On minimal sets of graded attribute implications (Q526697) (← links)
- Fuzzy logic programming reduced to reasoning with attribute implications (Q529051) (← links)
- Partition semantics for relations (Q579957) (← links)
- Non first normal form relations: An algebra allowing data restructuring (Q579959) (← links)
- Design by example: An application of Armstrong relations (Q579962) (← links)
- Set-based representations of conjunctive and disjunctive knowledge (Q581001) (← links)
- A logical framework for depiction and image interpretation (Q582146) (← links)
- On the complexity of enumerating pseudo-intents (Q628340) (← links)
- Approximate inference of functional dependencies from relations (Q672339) (← links)
- Cycle structure of edge labelled graphs (Q686524) (← links)
- Finite-model theory -- A personal perspective (Q688663) (← links)
- Minimal bases of temporal attribute implications (Q722104) (← links)
- Fuzzy functional dependencies: a comparative survey (Q723258) (← links)
- Derivation digraphs for dependencies in ordinal and similarity-based data (Q726160) (← links)
- I/O-efficient join dependency testing, Loomis-Whitney join, and triangle enumeration (Q736613) (← links)
- Closed sets and translations of relation schemes (Q751255) (← links)
- Procedural languages for database queries and updates (Q751799) (← links)
- A formal framework for independence with respect to transactions in the universal relation model (Q803778) (← links)
- Recognizing different types of beta-cycles in a database scheme (Q808238) (← links)
- Computing unique canonical covers for simple FDs via transitive reduction (Q834931) (← links)
- Attribute selection with fuzzy decision reducts (Q845335) (← links)
- Minimum implicational basis for \(\wedge\)-semidistributive lattices (Q845722) (← links)
- Reformulation of global constraints based on constraints checkers (Q850448) (← links)
- A semantic approach to optimize linear datalog programs (Q854685) (← links)
- A logic of graded attributes (Q892134) (← links)
- Fuzzy inequational logic (Q892182) (← links)
- Granularity of attributes in formal concept analysis (Q903595) (← links)
- Decomposing a relation into a tree of binary relations (Q909447) (← links)
- A new interpretation for null values in the weak instance model (Q909490) (← links)
- A distributed join algorithm (Q909494) (← links)
- Parallel update transactions (Q915439) (← links)
- Semantics of types for database objects (Q915443) (← links)
- Testing arbitrary subhypergraphs for the lossless join property (Q918686) (← links)
- The synthesis approach for relational database design: An expanded perspective (Q918695) (← links)
- The calculus of context relations (Q918720) (← links)
- An algebra of probability over finite product spaces, with applications (Q919365) (← links)
