04027nam 22006135 450 99646568560331620200705031019.03-540-47346-710.1007/3-540-17187-8(CKB)1000000000230575(SSID)ssj0000323893(PQKBManifestationID)11237088(PQKBTitleCode)TC0000323893(PQKBWorkID)10304393(PQKB)10247049(DE-He213)978-3-540-47346-6(PPN)155228633(EXLCZ)99100000000023057520121227d1986 u| 0engurnn|008mamaatxtccrICDT'86[electronic resource] International Conference on Database Theory. Rome, Italy, September 8-10, 1986. Proceedings /edited by Giorgio Ausiello, Paolo Atzeni1st ed. 1986.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,1986.1 online resource (VIII, 448 p.) Lecture Notes in Computer Science,0302-9743 ;243Bibliographic Level Mode of Issuance: Monograph3-540-17187-8 Logic programming and parallel complexity -- The generalized counting method for recursive logic queries -- Restructuring of complex objects and office forms -- Set containment inference -- A domain theoretic approach to higher-order relations -- On the desirability of ?-acyclic BCNF database schemes -- Update semantics under the domain closure assumption -- Unsolvable problems related to the view integration approach -- Horizontal decompositions based on functional-dependency-setimplications -- Update serializability in locking -- Filtering data flow in deductive databases -- Multidimensional order preserving linear hashing with partial expansions -- Split-freedom and MVD-intersection: A new characterization of multivalued dependencies having conflict-free covers -- Towards online schedulers based on Pre-Analysis Locking -- Query processing in incomplete logical databases -- to the theory of nested transactions -- Entity-relationship consistency for relational schemas -- Modelling large bases of categorical data with acyclic schemes -- Some extensions to the closed world assumption in databases -- Expedient stochastic move-to-front and optimal stochastic move-to-rear list organizing strategies -- The cost of locking -- Theoretical foundation of algebraic optimization utilizing unnormalized relations -- A polynomial-time join dependency implication algorithm for unary multi-valued dependencies -- Interaction-free multivalued dependency sets -- Updating logical databases containing null values -- A new characterization of distributed deadlock in databases.Lecture Notes in Computer Science,0302-9743 ;243Data structures (Computer science)ComputersAlgorithmsData Structures and Information Theoryhttps://scigraph.springernature.com/ontologies/product-market-codes/I15009Models and Principleshttps://scigraph.springernature.com/ontologies/product-market-codes/I18016Data Structureshttps://scigraph.springernature.com/ontologies/product-market-codes/I15017Algorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Data structures (Computer science).Computers.Algorithms.Data Structures and Information Theory.Models and Principles.Data Structures.Algorithm Analysis and Problem Complexity.005.74Ausiello Giorgioedthttp://id.loc.gov/vocabulary/relators/edtAtzeni Paoloedthttp://id.loc.gov/vocabulary/relators/edtBOOK996465685603316ICDT'862831560UNISA