Semantic representations and query languages for Or-sets

Journal of Computer and System Sciences

Volumn 52, Issue 1, 1996, Pages 125-142

  Libkin, Leonid ^a   Wong, Limsoon ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b Real World Comp Partnership N   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; DATABASE SYSTEMS; INFORMATION THEORY; MATHEMATICAL OPERATORS; MATHEMATICAL TRANSFORMATIONS; QUERY LANGUAGES;

CONJUNCTIVE INFORMATION; DATABASE QUERIES; DISJUNCTIVE INFORMATION; OR SETS; SEMANTIC REPRESENTATIONS;

DATA STRUCTURES;

EID: 0030082166     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1996.0010     Document Type: Article

References (34)

1. S. Abiteboul and C. Beeri, On the power of languages for the manipulation of complex objects, in "Proceedings, International Workshop on Theory and Applications of Nested Relations and Complex Objects, Darmstadt, 1988."
2. S. Abiteboul, P. Fischer, and H.-J. Schek (Eds.), "Nested Relations and Complex Objects in Databases," Lect. Notes in Comput. Sci., Vol. 361, Springer-Verlag, New York/Berlin, 1989.
3. V. Breazu-Tannen, P. Buneman, and S. Naqvi, Structural recursion as a query language, in "Proceedings, 3rd International Workship on Database Programming Languages, Naphlion, Greece, August 1991," pp. 919.
4. V. Breazu-Tannen and R. Subrahmanyam, Logical and computational aspects of programming with sets/bags/lists, in "Proceedings, 18th International Colloquium on Automata, Languages, and Programming, Madrid, Spain, July 1991," Lect. Notes in Comput. Sci., Vol. 510, pp. 60-75, Springer-Verlag, New York/Berlin, 1991.
5. P. Buneman, S. Naqvi, V. Tannen, and L. Wong, Principles of programming with complex objects and collection types, Theoret. Comput. Sci., to appear; extended abstract in "Proceedings, International Conference on Database Theory, Berlin, Germany, October 1992," Lect. Notes in Comput. Sci., Vol. 646, Springer-Verlag, New York/Berlin, 1992.
6. P. Buneman, S. Davidson, and A. Watters, A semantics for complex objects and approximate answers, J. Comput. System Sci. 43 (1991), 170-218.
7. P. Buneman, A. Ohori, and A. Jung, Using powerdomains to generalize relational databases, Theoret. Comput. Sci. 91 (1991), 23-55.
8. N. Dershowitz and J.-P. Jouannand, Rewrite systems, in "Handbook of Theoretical Computer Science," pp. 243-320, North-Holland, Amsterdam, 1990.
9. K. E. Flannery and J. J. Martin, Hoare and Smyth power domain constructors commute under composition, J. Comput. System Sci. 40 (1990), 125-135.
10. C. Gunter, The mixed powerdomain, Theoret. Comput. Sci. 103 (1992), 311-334.
11. C. Gunter and D. Scott, Semantic domains, in "Handbook of Theoretical Computer Science," pp. 633-674, North-Holland, Amsterdam.
12. E. Gunter and L. Libkin, OR-SML: A functional database programming language for disjunctive information and its applications, in "Proceedings, Database and Expert Systems Applications, Athens, September 1994," pp. 641-650, Lect. Notes in Comput. Sci., Vol. 856, Springer-Verlag, New York/Berlin, 1994.
13. H. Harper, R. Milner, and M. Tofte, "The Definition of Standard ML," MIT Press, Cambridge, MA, 1990.
14. R. Heckmann, Lower and upper power domain constructions commute on all cpos, Inform. Process. Lett. 40 (1997), 7-11.
15. T. Imielinski and W. Lipski, Incomplete information in relational databases, J. Assoc. Comput. Mach. 31 (1984), 761-791.
16. T. Imielinski, R. van der Meyden, and K. Vadaparty, Complexity tailored design: A new design methodology for databases with incomplete information, J. Comput. System Sci., to appear.
17. T. Imielinski, S. Naqvi, and K. Vadaparty, Incomplete objects - A data model for design and planning applications, in "Proceedings, ACM-SIGMOD International Conference on Management of Data, Denver, Colorado, May 1991," pp. 288-297.
18. T. Imielinski, S. Naqvi, and K. Vadaparty, Querying design and planning databases, in "Proceedings, 2nd International Conference on Deductive and Object-Oriented Databases, Munich, Germany, December 1991," pp. 524-545, Lect. Notes in Comput. Sci., Vol. 566, Springer-Verlag, New York/Berlin, 1992.
19. L. Libkin, A relation algebra for complex objects based on partial information, in "Proceedings, Symposium on Mathematical Fundamentals of Database Systems, Rostock, May 1991," pp. 36-41, Lect. Notes in Comput Sci., Vol. 495, Springer-Verlag, New York/Berlin, 1991.
20. L. Libkin, An elementary proof that upper and lower powerdomain constructions commute, Bull. EATCS 48 (1992), 175-177.
21. L. Libkin, "Aspects of Partial Information in Databases," Ph.D. thesis, University of Pennsylvania, August 1994. Available from http://www. cis.upenn.edu/ l∼ibkin/home.html.
22. L. Libkin, Approximation in database, in "Proceedings, 5th International Conference on Database Theory, Prague, January 1995," pp.411-424, Lect. Notes in Comput. Sci., Vol. 893, Springer-Verlag, New York/Berlin, 1995.
23. L. Libkin, Normalizing incomplete database, in "Proceedings, 14th ACM Symposium on Principles of Database Systems, San Jose, California, May 1995," pp. 219-230.
24. L. Libkin and L. Wong, Semantic representations and query languages for or-sets, in "Proceedings, 12th ACM Symposium on Principles of Database Systems, Washington, DC, May 1993," pp. 37-48.
25. L. Libkin and L. Wong, Some properties of query languages for bags, in "Proceedings, 4th International Workshop on Database Programming Languages, Manhattan, New York, August 1993," pp. 97-114.
26. L. Libkin and L. Wong, Conservativity of nested relational calculi with internal generic functions, Inform. Process. Lett. 49 (1994), 273-280.
27. E. Moggi, Notions of computation and monads, Inform, and Comput. 93 (1991), 55-92.
28. J. Moon and L. Moser, On cliques in graphs, Israel J. Math. 3 (1965), 23-28.
29. S. Naqvi and S. Tsur, "A Logical Language for Data and Knowledge Bases," Computer Science Press, Rockville, MD, 1989.
30. T.-H. Ngair, "Convex Spaces as an Order-theoretic Basis for Problem Solving," Ph.D. thesis, University of Pennsylvania, August 1992.
31. H. Puhlmann, The snack powerdomain for database semantics, in "Mathematical Foundations of Computer Science, Gdansk, September 1993," pp. 650-659, Lect. Notes in Comput. Sci., Vol. 711, Springer-Verlag, New York/Berlin, 1993.
32. B. Rounds, Situation-theoretic aspects of databases, in "Proceedings, 1991 Conference on Situation Theory and Applications," CSLI, Vol. 26, pp. 229-256.
33. P. Wadler, Comprehending monads, Math. Structures Comput. Sci. 2 (1992), 461-493.
34. G. Winskel, Powerdomains and modality, Theoret. Comput. Sci. 36 (1985), 127-137.