Models of approximation in databases

Theoretical Computer Science

Volumn 190, Issue 2, 1998, Pages 167-210

  Libkin, Leonid ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

Approximate answers; Databases; Partial information; Powerdomains

Indexed keywords

EID: 11544337006     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00090-X     Document Type: Article

References (36)

1. S. Abiteboul, R. Hull, V. Vianu, Foundations of Databases, Addison-Wesley, Reading, MA, 1995.
2. M. Barr, C. Wells, Category Theory for Computing Science, Prentice-Hall, Englewood Cliffs, NJ, 1990.
3. J. Biskup, A formal approach to null values in database relations, in: Advances in Data Base Theory, vol. 1, Plenum Press, New York, 1981.
4. V. Breazu-Tannen, R. Subrahmanyam, Logical and computational aspects of programming with sets/bags/lists, in: Proc. 18th ICALP, Madrid, Spain, Lecture Notes in Computer Science, vol. 510, Springer, Berlin, 1991, pp. 60-75.
5. P. Buneman, S. Davidson, A. Watters, A semantics for complex objects and approximate answers, J. Comput. System Sci. 43 (1991) 170-218.
6. P. Buneman, A. Jung, A. Ohori, Using powerdomains to generalize relational databases, Theoret. Comput. Sci. 91 (1991) 23-55.
7. P. Buneman, L. Libkin, D. Suciu, V. Tannen, L. Wong, Comprehension syntax, SIGMOD Record, 23 (1994) 87-96.
8. P. Buneman, S. Naqvi, V. Tannen, L. Wong, Principles of programming with complex objects and collection types, Theoret. Comput. Sci. 149 (1995) 3-48.
9. L. Cardelli, Types for data-oriented languages, in: J.W. Schmidt, S. Ceri, M. Missikoff (Eds.), Proc. EDBT-88, Lecture Notes in Computer Science, vol. 303, Springer, Berlin, 1988.
10. S. Chaudhuri, Finding nonrecursive envelopes for database predicates, in: ACM Symp. on Principles of Database Systems (PODS'93), pp. 135-146.
11. S. Chaudhuri, Ph. Kolaitis, Can Datalog be approximated? in: ACM Symp. on Principles of Database Systems (PODS'94), pp. 86-96.
12. G. Grahne, The problem of incomplete information in relational databases, Springer, Berlin, 1991.
13. C. Gunter, The mixed powerdomain, Theoret. Comput. Sci. 103 (1992) 311-334.
14. C. Gunter, Semantics of Programming Languages, MIT Press, Cambridge, MA, 1992.
15. E. Gunter, L. Libkin, OR-SML: a functional database programming language for disjunctive information and its applications, in: Proc. 5th Internat. Conf. on Database and Expert Systems Applications, Lecture Notes in Computer Science, vol. 856, Springer, Berlin, 1994, pp. 641-650.
16. T. Imielinski, W. Lipski, Incomplete information in relational databases, J. ACM 31 (1984) 761-791.
17. T. Imielinski, S. Naqvi, K. Vadaparty, Incomplete objects - a data model for design and planning applications, in: Proc. ACM-SIGMOD Internat. Conf. on Management of Data, Denver, Colorado, 1991, pp. 288-297.
18. A. Jung, L. Libkin, H. Puhlmann, Decomposition of domains, in: Proc. Conf. on Mathematical Foundations of Programming Semantics - 91, Lecture Notes in Computer Science, vol. 598, Springer, Berlin, 1992, pp. 235-258.
19. A. Jung, H. Puhlmann, Types, logic, and semantics for nested databases, in: Proc. Conf. on Mathematical Foundations of Programming Semantics - 95, Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, 1995.
20. K.L. Kwast, A deontic approach to database integrity, Ann. Math. Artif. Intell. 9 (1993) 205-238.
21. L. Libkin, A relational algebra for complex objects based on partial information, in: Proc. MFDBS - 91, Lecture Notes in Computer Science, vol. 495, Rostock, 1991, Springer, Berlin, 1991, pp. 36-41.
22. L. Libkin, Aspects of partial information in databases, Ph.D. Thesis, University of Pennsylvania, 1994.
23. L. Libkin, Approximation in databases, in: Proc. Internat. Conf. on Database Theory, Lecture Notes in Computer Science, vol. 893, Springer, Berlin, 1995, pp. 411-424.
24. L. Libkin, L. Wong, On representation and querying incomplete information in databases with bags, Inform. Process. Lett. 56 (4) (1995) 209-214.
25. L. Libkin, L. Wong, Semantic representations and query languages for or-sets, J. Comput. System Sci. 52 (1) (1996) 125-142.
26. L. Libkin, L. Wong, Query languages for bags and aggregate functions, J. Comput. System Sci., to appear; Extended abstract in ACM Symp. on Principles of Database Systems (PODS'94), pp. 155-166.
27. L. Libkin, L. Wong, Query languages for bags and aggregate functions, J. Comput. System Sci., to appear; Extended abstract in ACM Symp. on Principles of Database Systems (PODS'94), pp. 155-166.
28. W. Lipski, On semantic issues connected with incomplete information in databases, ACM Trans. Database Systems 4 (1979) 262-296.
29. W. Lipski, On databases with incomplete information, J. ACM 28 (1981) 41-70.
30. T.-H. Ngair, Convex spaces as an order-theoretic basis for problem solving, Ph.D. Thesis, Technical Report MS-CIS-92-60, University of Pennsylvania, 1992.
31. J. Płonka, On distributive quasilattices, Fund. Math. 60 (1967) 191-200.
32. H. Puhlmann, The snack powerdomain for database semantics, in: A. Borzyszkowski (Ed.), MFCS - 93, Lecture Notes in Computer Science, vol. 711, Springer, Berlin, 1993, pp. 650-659.
33. A. Romanowska, J.D.H. Smith, Modal Theory: An Algebraic Approach to Order, Geometry and Convexity, Heldermann, Berlin, 1985.
34. B. Rounds, Situation-theoretic aspects of databases, in: Proc. Conf. on Situation Theory and Applications, CSLI, vol. 26, 1991, pp. 229-256.
35. H.-J. Schek, M. Scholl, The relational model with relation-valued attributes, Inform. Systems 11 (1986) 137-147.
36. C. Zaniolo, Database relations with null values, J. Comput. System Sci. 28 (1984) 142-166.