Approximation in Databases
暂无分享,去创建一个
[1] Yannis Vassiliou,et al. Null values in data base management a denotational semantics approach , 1979, SIGMOD '79.
[2] Surajit Chaudhuri,et al. Can Datalog be approximated? , 1994, J. Comput. Syst. Sci..
[3] Witold Lipski,et al. On Databases with Incomplete Information , 1981, JACM.
[4] Anna B. Romanowska,et al. Modal theory: An algebraic approach to order, geometry, and convexity , 1985 .
[5] Tomasz Imielinski,et al. Querying Design and Planning Databases , 1991, DOOD.
[6] Jack Minker,et al. Advances in Data Base Theory , 1981, Springer US.
[7] Tomasz Imielinski,et al. Incomplete Information in Relational Databases , 1984, JACM.
[8] Limsoon Wong,et al. Some Properties of Query Languages for Bags , 1993, DBPL.
[9] Tomasz Imielinski,et al. Incomplete object—a data model for design and planning applications , 1991, SIGMOD '91.
[10] Luca Cardelli,et al. Types for Data-Oriented Languages , 1988, EDBT.
[11] Richard S. Varga,et al. Proof of Theorem 6 , 1983 .
[12] Carl A. Gunter,et al. The Mixed Powerdomain , 2008 .
[13] Aaron Watters,et al. A Semantics for Complex Objects and Approximate Answers , 1991, J. Comput. Syst. Sci..
[14] Richard S. Varga,et al. Proof of Theorem 5 , 1983 .
[15] Surajit Chaudhuri,et al. Finding Nonrecursive Envelopes for Datalog Predicates. , 1992 .
[16] Val Tannen. Tutorial: languages for collection types , 1994, PODS '94.
[17] Surajit Chaudhuri,et al. Finding nonrecursive envelopes for Datalog predicate , 1993, PODS '93.
[18] Hans-Jörg Schek,et al. The relational model with relation-valued attributes , 1986, Inf. Syst..
[19] Michael Barr,et al. Category theory for computing science , 1995, Prentice Hall International Series in Computer Science.
[20] R. Varga,et al. Proof of Theorem 4 , 1983 .
[21] Hermann Puhlmann,et al. The Snack Powerdomain for Database Semantics , 1993, MFCS.
[22] Leonid Libkin,et al. OR-SML: A Functional Database Programming Language for Disjunctive Information and Its Applications , 1994, DEXA.
[23] Peter Buneman,et al. Using Powerdomains to Generalize Relational Databases , 1991, Theor. Comput. Sci..
[24] Leonid Libkin,et al. Decomposition of Domains , 1991, MFPS.
[25] Robert D. Tennent,et al. Semantics of programming languages , 1991, Prentice Hall International Series in Computer Science.
[26] Limsoon Wong,et al. Naturally Embedded Query Languages , 1992, ICDT.
[27] Mark Levene,et al. A Fully Precise Null Extended Nested Relational Algebra , 1993, Fundamenta Informaticae.
[28] Joachim Biskup,et al. A Formal Approach to Null Values in Database Relations , 1979, Advances in Data Base Theory.
[29] Leonid Libkin. A Relational Algebra for Complex Objects Based on Partial Information , 1991, MFDBS.
[30] Gösta Grahne,et al. The Problem of Incomplete Information in Relational Databases , 1991, Lecture Notes in Computer Science.
[31] Leonid Libkin. Algebraic Characterization of Edible Powerdomains , 1993 .
[32] Val Tannen,et al. Logical and Computational Aspects of Programming with Sets/Bags/Lists , 1991, ICALP.
[33] Witold Lipski,et al. On semantic issues connected with incomplete information databases , 1979, ACM Trans. Database Syst..
[34] Latha S. Colby. A recursive algebra for nested relations , 1990, Inf. Syst..
[35] Leonid Libkin,et al. Aspects of partial information in databases , 1995 .
[36] Limsoon Wong,et al. New techniques for studying set languages, bag languages and aggregate functions , 1994, PODS '94.
[37] Teow-Hin Ngair. Convex spaces as an order theoretic basis for problem-solving , 1992 .
[38] Limsoon Wong,et al. Semantic representations and query languages for or-sets , 1993, PODS '93.
[39] Carlo Zaniolo. Database relations with null values , 1982, PODS '82.