A Query Language for NC

Journal of Computer and System Sciences

Volumn 55, Issue 2, 1997, Pages 299-321

  Suciu, Dan ^a   Tannen, Val ^b  

^a AT AND T LABS RESEARCH   (United States)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; PARALLEL PROCESSING SYSTEMS; RANDOM ACCESS STORAGE; RECURSIVE FUNCTIONS; RELATIONAL DATABASE SYSTEMS; SET THEORY;

DIVIDE AND CONQUER RECURSION (DCR); PARALLEL RANDOM ACCESS MACHINE (PRAM); RELATIONAL ALGEBRA;

QUERY LANGUAGES;

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

References (48)

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." Also available as INRIA Technical Report 846.
2. S. Abiteboul, R. Hull, and V. Vianu, "Foundations of Databases," Addison-Wesley, Reading, MA, 1995.
3. S. Abiteboul and V. Vianu, Generic computation and its complexity, in "Proceedings, 23rd ACM Symposium on the Theory of Computing, 1991."
4. S. Abiteboul, M. Vardi, and V. Vianu, Fixpoint logics, relational machines, and computational complexity, in "Structure and Complexity, 1992."
5. F. Bancilhon, T. Briggs, S. Khoshafian, and P. Valduriez FAD, a powerful and simple database language, in "Proceedings, 13th International Conference on Very Large Data Bases, 1987," pp. 97-105.
6. V. Breazu-Tannen, P. Buneman, and L. Wong, Naturally embedded query languages, in "Proceedings, 4th International Conference on Database Theory, Berlin, October, 1992" (J. Biskup, R. Hull, Ed.), Lect. Notes in Comput. Sci., Vol. 646, pp. 140-154, Springer-Verlag, New York/Berlin, 1992. Available as UPenn Technical Report MS-CIS-92-47.
7. 1, J. Comput. System Sci. 41 (1990), 274-306.
8. P. Buneman, S. Naqvi, V. Tannen, and L. Wong, Principles of programming with collection types, Theoretical Computer Science, to appear.
9. V. Breazu-Tannen, Generalized structural recursion and sets vs. bags, January 1992. Manuscript available from val@ saul.cis.upenn.edu.
10. V. Breazu-Tannen, P. Buneman, and S. Naqvi, Structural recursion as a query language, in "Proceedings, 3rd International Workshop on Database Programming Languages, Naphlion, Greece, August 1991," pp. 9-19, Morgan Kaufmann, San Mateo, CA, 1992. Also available as UPenn Technical Report MS-CIS-92-17.
11. V. Breazu-Tannen and R. Subrahmanyam, Logical and computational aspects of programming with Sets/Bags/Lists, in "LNCS 510: Proceedings of 18th International Colloquium on Automata, Languages, and Programming, Madrid, Spain, July 1991," pp. 60-75, Springer-Verlag, 1991.
12. J-Y. Cai, M. Furer, and N. Immerman, An optimal lower bound on the number of variables for graph identification, Combinatorica 12, No. 4 (1992), 389-410.
13. A. Chandra and D. Harel, Computable queries for relational databases, J. Comput. System Sci. 21, No. 2 (1980), 156-178.
14. K. L. Compton and C. Laflamme, An algebra and a logic for NC, Information and Computation 87, No. 1-2 (1990), 240-262.
15. k, and NC, in "Feasible Mathematics" (S. R. Buss and P. J. Scot, Eds.), Birkhäuser, Boston, 1990.
16. S. Cook, A taxonomy of problems with fast parallel algorithms, Inform, and Control 64 (1985), 2-22.
17. A. Dawar, S. Lindell, and S. Weinstein, Infinitary logic and inductive definability over finite structures, Inform, and Comput. 119 (1995), 160-175. Available as UPenn Technical Report MS-CIS-91-97.
18. K. Denninghof and V. Vianu, The power of methods with parallel semantics, in "Proceedings, 17th International Conference on Very Large Databases, 1991."
19. R. Fagin, Finite model theory - A personal perspective, Theoretical Computer Science 116, No. 1 (1993), 3-32.
20. Y. Gurevich, Algebra of feasible functions, in "Proceedings, 24th IEEE Symposium on Foundations of Computer Science," pp. 210-214, IEEE Comput. Soc., Los Alamitos, CA, 1983.
21. S. Grumbach and V. Vianu, Expressiveness and complexity of restricted languages for complex objects, in "Proceedings, 3rd International Workshop on Database programming Languages, Naphlion, Greece," pp. 191-202, Morgan Kaufmann, 1991.
22. S. Grumbach and V. Vianu, "Tractable Query Languages for Complex Object Databases," Technical Report 1573 INRIA, Rocquencourt BP 105, 78152 Le Chesnay, France, 1991. Extended abstract appeared in PODS 91.
23. S. Grumbach and V. Vianu, Tractable query languages for complex object databases, in "Proceedings, 10th ACM Symposium on Principles of Database Systems, 1991".
24. S. Grumbach and V. Vianu, Tractable query languages for complex object databases, J. Comput. System Sci. 51, No. 2 (1995), 149-167.
25. N. Immerman, Upper and lower bounds for first-order expressibility, J. Comput. Systems Sci. 25 (1982), 76-98.
26. N. Immerman, Relational queries computable in polynomial time, Information and Control 68 (1986), 86-104.
27. N. Immerman, Expressibility as a complexity measure: Results and directions, in "Proceedings, 2nd Conference on Structure in Complexity Theory," pp. 194-202, 1987.
28. N. Immerman, Languages that capture complexity classes, SIAM Journal of Computing 16 (1987), 760-778.
29. N. Immerman, Expressibility and parallel complexity, SIAM Journal of Computing 18 (1989), 625-638.
30. N. Immerman, S. Patnaik, and D. Stemple, The expressiveness of a family of finite set languages, in "Proceedings, 10th ACM Symposium on Principles of Database Systems," pp. 37-52, 1991.
31. L. Libkin and L. Wong, Aggregate functions, conservative extension, and linear orders, in "Proceedings, 4th International Workshop on Database Programming Languages, New York, August 1993" (C. Beeri, A. Ohori, and D. E. Shasha, Eds.), pp. 282-294, Springer-Verlag, New York/ Berlin, 1994. See also UPenn Technical Report MS-CIS-93-36.
32. L. Libkin and L. Wong, New techniques for studying set languages, bag languages, and aggregate functions, in "Proceedings, 13th ACM Symposium on Principles of Database Systems," pp. 115-166, Minneapolis, Minnesota, 1994. See also UPenn Technical Report MS-CIS-93-95.
33. Y. N. Moschovakis, "Elementary Induction on Abstract Structures," North Holland, Amsterdam, 1974.
34. A. Ohori, P. Buneman, and V. Breazu-Tannen, Database programming in Machiavelli, a polymorphic language with static type inference, in "Proceedings of ACM-SIGMOD International Conference on management of Data" (J. Clifford, B. Lindsay, and D. Maier, Eds.), pp. 46-57, Portland, Oregon, 1989.
35. J. Paredaens and D. Van Gucht, Possibilities and limitations of using flat operators in nested algebra expressions, in "Proceedings, 7th ACM Symposium on Principles of Database Systems," pp. 29-38, Austin, Texas, 1988.
36. J. Paredaens and D. Van Gucht, Converting nested relational algebra expressions into flat algebra expressions, ACM Trans. Database Systems 17, No. 1 (1992), 65-93.
37. D. Stott Parker, E. Simon, and P. Valduriez, SVP: A model capturing sets, streams, and parallelism, in "Proceedings, 18th International Conference on Very Large Databases, Vancouver, August 1992" (L-Y. Yuan, Ed.), pp. 115-126, Morgan-Kaufmann, San Mateo, California, 1992.
38. M. Sipser and R. Boppana, The complexity of finite functions, in "Handbook of Theoretical Computer Science. Vol. A: Algorithms and Complexity" (J. Van Leeuwen, Ed.), MIT Press, 1990.
39. P. Rao and C. Walinsky, An equational language for dataparallelism, in "Proceedings, 4th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming," pp. 112-118, ACM Press, 1993.
40. V. Y. Sazonov, Hereditarily-finite sets, data bases and polynomial-time computability, Theoretica Computer Science 119 (1993), 187-214.
41. H.-J. Schek and M. H. Scholl, The relational model with relation-valued attributes, Information Systems 11, No. 2 (1986), 137-147.
42. D. Suciu, Bounded fixpoints for complex objects, Theoretical Computer Science 176 (1997), 283-328.
43. L. Stockmeyer and U. Vishkin, Simulation of parallel random access machines by circuits, SIAM Journal of Computing 13 (1984), 409-422.
44. D. Suciu and L. Wong, On two forms of structural recursion, 1995.
45. S. J. Thomas and P. C. Fisher, Nested relational structures, in "Advances in Computing Research: The Theory of Databases" (P. C. Kanellakis and F. P. Preparata, Eds.), pp. 269-307, JAI Press, London, England, 1986.
46. M. Y. Vardi, The complexity of relational query languages, in "Proceedings, 14th ACM SIGACT Symposium on the Theory of Computing," pp. 137-146, San Francisco, California, 1982.
47. L. Wong, Normal forms and conservative properties for query languages over collection types, in "Proceedings, 12th ACM Symposium on Principles of Database Systems," pp. 26-36, Washington, D.C., 1993. See also UPenn Technical Report MS-CIS-92-59.
48. L. Wong, "Querying nested Collections," Ph.D. thesis, Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA, 19104, 1994. Available as University of Pennsylvania IRCS Report 94-09.