scientific article
From MaRDI portal
Publication:3347338
zbMath0558.68078MaRDI QIDQ3347338
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
securitydata modelconcurrency controldatabase designrelational databasesdatabase managementdesign algorithmsdependenciesintegrityquery optimizationfile organizationrelational data modeldesign of query languages
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Data structures (68P05) Information storage and retrieval of data (68P20)
Related Items (only showing first 100 items - show all)
Optimal distributed execution of join queries ⋮ Inferences for numerical dependencies ⋮ A general framework for reasoning about change ⋮ Non-finite specifiability of projections of functional dependency families ⋮ The principle of optimality in the design of efficient algorithms ⋮ Incorporating processor costs in optimizing the distributed execution of join queries ⋮ Fixed-point extensions of first-order logic ⋮ Fast learning of relational dependency networks ⋮ Sets and indices in linear programming modelling and their integration with relational data models ⋮ An algebraic theory of functional and multivalued dependencies in relational databases ⋮ Correctness of semantic integrity checking in database management systems ⋮ A deontic approach to database integrity ⋮ A historical query language ⋮ Executing join queries in an uncertain distributed environment ⋮ A natural semantics for modal logic over databases ⋮ A family of NP-complete data aggregation problems ⋮ Constraint satisfaction from a deductive viewpoint ⋮ Allocating relations in a distributed database system ⋮ Incomplete deductive databases ⋮ A logical design method for relational databases based on generalization and aggregation semantics ⋮ Minimizing the response time of executing a join between fragmented relations in a distributed database system ⋮ On the size of nonredundant FD-covers ⋮ An integer programming formulation embedded in an algorithm for query processing optimization in distributed relational database systems ⋮ Composing recursive logic programs with clausal join ⋮ The generalized counting method for recursive logic queries ⋮ On the desirability of \(\gamma\)-acyclic BCNF database schemes ⋮ Optimal multidisk partial match file designs ⋮ Concurrency and trie hashing ⋮ The propagation of updates to relational tables in a distributed database system ⋮ 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 ⋮ 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 ⋮ Finitely representable databases ⋮ Heuristics for syntactical optimization of relational queries ⋮ Boyce-Codd normal form and object normal forms ⋮ A first step towards implementing dynamic algebraic dependences ⋮ Fuzzy functional dependencies and Bayesian networks ⋮ Learning directed relational models with recursive dependencies ⋮ 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 ⋮ Heuristic least-cost computation of discrete classification functions with uncertain argument values ⋮ Testing arbitrary subhypergraphs for the lossless join property ⋮ The synthesis approach for relational database design: An expanded perspective ⋮ An equivalence classes model of fuzzy relational databases ⋮ On the expressive power of database queries with intermediate types ⋮ An analytical approach to the inference of summary data of additive type ⋮ Connection-trap-free database schemes ⋮ Functional dependencies and normal forms in the fuzzy relational database model ⋮ Conceptual level concurrency control of relational update transactions ⋮ Interval queries on object histories ⋮ Comparison of functional and predicative query paradigms ⋮ Reusing and modifying rulebases by predicate substitution ⋮ Equivalence of the relational algebra and calculus for nested relations ⋮ Polynomial tests of normal forms and some related results ⋮ Generating hinges from arbitrary subhypergraphs ⋮ On characterizing boundedness of database schemes with bounded dependencies ⋮ A closed-form evaluation for Datalog queries with integer (gap)-order constraints ⋮ Query languages for hierarchic databases ⋮ Modelling relational statistics with Bayes nets ⋮ Selective inheritance of attribute values in relational databases ⋮ Preservation of integrity constraints in definite DATALOG programs ⋮ Bounded similarity querying for time-series data ⋮ Partially dynamic maintenance of minimum weight hyperpaths ⋮ Some characterizations of finitely specifiable implicational dependency families ⋮ Non first normal form relations: An algebra allowing data restructuring ⋮ Design by example: An application of Armstrong relations ⋮ Chordality properties on graphs and minimal conceptual connections in semantic data models ⋮ Concurrent operations on \(B^ *\)-trees with overtaking ⋮ Lossless outer joins with incomplete information ⋮ On axioms constituting the foundation of hypergraph theory ⋮ Directed hypergraphs and applications ⋮ Page-queries as a tool for organizing secondary memory auxiliary databases. II: Optimal selection of SADB contents ⋮ Evaluating multiple join queries in a distributed database system ⋮ SQL translation using an attribute grammar ⋮ A relational approach to logic programming: The extended Alexander method ⋮ Inadequacy of interval timestamps in temporal databases ⋮ An adaptive mixed relation decomposition algorithm for conjunctive retrieval queries ⋮ Independent database schemes under functional and inclusion dependencies ⋮ A parallel implementation of flat concurrent Prolog ⋮ Linear connectivity problems in directed hypergraphs ⋮ Automatic generation of test data for relational queries ⋮ Structural, elicitation and computational issues faced when solving complex decision making problems with influence diagrams ⋮ Subscript-free modeling languages: A tool for facilitating the formulation and use of models ⋮ Fuzzy information in extended fuzzy relational databases ⋮ Integrated concurrency control in shared B-trees ⋮ Functional dependencies in relations with null values ⋮ Querying fragmented relations in a distributed database ⋮ Finite queries do not have effective syntax. ⋮ On the existence of acyclic views in a database scheme ⋮ Ordering conjunctive queries ⋮ Irreversibility problem in NL-class relations ⋮ Abstract functional dependency structures ⋮ Fast parallel constraint satisfaction ⋮ FLEXSIM: A flexible manufacturing system simulator ⋮ Objects in relational database schemes with functional, inclusion, and exclusion dependencies ⋮ Closure functions and general iterates as reflectors ⋮ A note on the equivalence of a set of egds to a set of FDs
Uses Software
This page was built for publication:
