Order dependency in the relational model

DOI10.1016/0304-3975(83)90084-1zbMath0584.68095OpenAlexW1974545679MaRDI QIDQ1069711

Richard Hull, Seymour Ginsburg

Publication date: 1983

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(83)90084-1

zbMATH Keywords

NP-completenessrelational databaseinference rulesdata dependencyorders on domains

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Information storage and retrieval of data (68P20) Total orders (06A05) Other classical set theory (including functions, relations, and set algebra) (03E20)

Related Items (4)

Non-finite specifiability of projections of functional dependency families ⋮ Valuations in incomplete information databases ⋮ Decision problems of object histories ⋮ Constraint-generating dependencies

Cites Work

• Characterizations for functional dependency and Boyce-Codd normal form families
• Calculating constraints on relational expression
• An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic
• Properties of functional-dependency families
• Horn clauses and database dependencies
• On the family of generalized dependency constraints
• Multidimensional binary search trees used for associative searching
• Functional Dependencies in a Relational Database and Propositional Logic
• Equivalences among Relational Expressions
• A relational model of data for large shared data banks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Order dependency in the relational model