scientific article; zbMATH DE number 3890770
zbMATH Open0558.68078MaRDI QIDQ3347338FDOQ3347338
Authors: Jeffrey D. Ullman
Publication date: 1982
Title of this publication is not available (Why is that?)
Recommendations
design algorithmsrelational databasessecuritydata modelconcurrency controldependenciesintegrityquery optimizationdatabase managementdatabase designfile organizationrelational data modeldesign of query languages
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Information storage and retrieval of data (68P20) Data structures (68P05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01)
Cited In (only showing first 100 items - show all)
- Title not available (Why is that?)
- Composing recursive logic programs with clausal join
- A closed-form evaluation for Datalog queries with integer (gap)-order constraints
- On axioms constituting the foundation of hypergraph theory
- Allocating relations in a distributed database system
- Fast learning of relational dependency networks
- Boyce-Codd normal form and object normal forms
- Partially dynamic maintenance of minimum weight hyperpaths
- Sets and indices in linear programming modelling and their integration with relational data models
- Title not available (Why is that?)
- Bounded similarity querying for time-series data
- Upper bound on the communication complexity of private information retrieval
- The generalized counting method for recursive logic queries
- Query languages for hierarchic databases
- Fixed-point extensions of first-order logic
- Finitely representable databases
- An equivalence classes model of fuzzy relational databases
- Inferences for numerical dependencies
- Preservation of integrity constraints in definite DATALOG programs
- Some characterizations of finitely specifiable implicational dependency families
- Concurrent operations on \(B^ *\)-trees with overtaking
- Non first normal form relations: An algebra allowing data restructuring
- Lossless outer joins with incomplete information
- On the expressive power of database queries with intermediate types
- Directed hypergraphs and applications
- Functional dependencies in relations with null values
- Design by example: An application of Armstrong relations
- Title not available (Why is that?)
- Ordering conjunctive queries
- Incomplete deductive databases
- A complete axiomatization for fuzzy functional and multivalued dependencies in fuzzy database relations
- Constraint satisfaction from a deductive viewpoint
- Fuzzy functional dependencies and Bayesian networks
- Non-finite specifiability of projections of functional dependency families
- THE CONTROL OF STARVATION
- An algebraic theory of functional and multivalued dependencies in relational databases
- The synthesis approach for relational database design: An expanded perspective
- On the size of nonredundant FD-covers
- Title not available (Why is that?)
- Title not available (Why is that?)
- An adaptive mixed relation decomposition algorithm for conjunctive retrieval queries
- Inadequacy of interval timestamps in temporal databases
- Fuzzy functional dependencies and independencies in extended fuzzy relational database models
- The dependency-preserving decomposition and a testing algorithm in a fuzzy relational data model
- Chordality properties on graphs and minimal conceptual connections in semantic data models
- Title not available (Why is that?)
- A parallel implementation of flat concurrent Prolog
- FLEXSIM: A flexible manufacturing system simulator
- A new interpretation for null values in the weak instance model
- Distributing a \(B^+\)-tree in a loosely coupled environment
- On attribute grammars without attribute synthesis
- A logical design method for relational databases based on generalization and aggregation semantics
- Objects in relational database schemes with functional, inclusion, and exclusion dependencies
- Title not available (Why is that?)
- Minimizing the response time of executing a join between fragmented relations in a distributed database system
- Testing arbitrary subhypergraphs for the lossless join property
- Learning directed relational models with recursive dependencies
- Integrated concurrency control in shared B-trees
- Optimal distributed execution of join queries
- On the existence of acyclic views in a database scheme
- Querying fragmented relations in a distributed database
- Title not available (Why is that?)
- Abstract functional dependency structures
- Closure functions and general iterates as reflectors
- SQL translation using an attribute grammar
- Relocation problems are hard
- Heuristic least-cost computation of discrete classification functions with uncertain argument values
- Linear connectivity problems in directed hypergraphs
- Interval queries on object histories
- Comparison of functional and predicative query paradigms
- Reusing and modifying rulebases by predicate substitution
- Title not available (Why is that?)
- Finite queries do not have effective syntax.
- A first step towards implementing dynamic algebraic dependences
- Title not available (Why is that?)
- Correctness of semantic integrity checking in database management systems
- Modelling relational statistics with Bayes nets
- A relational approach to logic programming: The extended Alexander method
- A general framework for reasoning about change
- A natural semantics for modal logic over databases
- A family of NP-complete data aggregation problems
- An integer programming formulation embedded in an algorithm for query processing optimization in distributed relational database systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Independent database schemes under functional and inclusion dependencies
- A formal semantics for sql
- On the desirability of \(\gamma\)-acyclic BCNF database schemes
- Optimal multidisk partial match file designs
- Concurrency and trie hashing
- Completeness issues for join dependencies derived from the universal relation join dependency
- Testing unboundedness of database schemes and functional dependencies
- HCB-tree: a height compressed B-tree for parallel processing
- An analytical approach to the inference of summary data of additive type
- On characterizing boundedness of database schemes with bounded dependencies
- Title not available (Why is that?)
- Title not available (Why is that?)
- Closure via functional dependence simplification
- Heuristics for syntactical optimization of relational queries
- Fuzzy querying: issues and perspectives
Uses Software
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3347338)