Latha S. Colby
ABSTRACT
We present a language for querying list-based complex objects. The language is shown to express precisely the polynomial-time generic list-object functions. The iteration mechanism of the language is based on a new approach wherein, in addition to the list over which the iteration is performed, a second list is used to control the number of iteration steps. During the iteration, the intermediate results can be moved to the output list as well as reinserted into the list being iterated over. A simple syntactic constraint allows the growth rate of the intermediate results to be tightly controlled which, in turn, restricts the expressiveness of the language to PTIME.
- AB87.S. Abiteboul and C. Beeri. On the power of languages for the manipulation of complex objects. In Proceedings of the International Workshop on Theory and Applications of Nested Relations and Complex Objects, Darmstadt, 1987.Google Scholar
- AV90.S. Abiteboul and V. Vianu. Procedural languages for database queries and updates. Journal of Computer and System Sciences, 41(2):181-229, 1990. Google ScholarDigital Library
- AV91.S. Abiteboul and V. Vianu. Generic computation and its complexity, in Proceedings of the 23rd A CM Symposium on Theory of Computing, pages 209-219, 1991. Google ScholarDigital Library
- BC92.S. Bellantoni and S. Cook. A new recursiontheoretic characterization of the polytime functions. In Proceedings of the 24th A CM Sympos'tum on Theory of Comput'tng, pages 283-293, 1992. Google ScholarDigital Library
- BTBN91.V. Breazu-Tannen, P. Buneman, and S. Naqvi. Structural recursion as a query langauge. In Proceedings of the 3rd International Workshop on Database Programming Languages, pages 9-19, Nafplion, Greece, August 1991. Morgan Kaufmann. Google ScholarDigital Library
- BTBW92.V. Breazu-Tannen, P. Buneman, and L. Wong. Naturally embedded query languages. In LNCS 6#6: Proceedings of the International Conference on Database Theory, pages 140-154. Springer-verlag, October 1992. Google ScholarDigital Library
- CH80.A. Chandra and D. Hard. Computable queries for relational data bases. Journal of Computer and @stem Sciences, 21 (2): 156- 178, 1980.Google Scholar
- CH82.A. Chandra and D. Hard. Structure and complexity of relational queries. Journal of Computer and System, Sc'tences, 25:99-128, 1982.Google Scholar
- Cha81.A. Chandra. Programming primitives for database languages. In Proceedings of the A CM Symposium on Pmnc'tples of Programmmg Languages, pages 50-62, May 1981. Google ScholarDigital Library
- CSV93.L.S. Colby, L. V. Saxton, and D. Van Gucht. A query language for list-based complex objects. Technical Report 395, Indiana University, December 1993.Google Scholar
- CSV94.L.S. Colby, L. V. Saxton, and D. Van Gucht. Concepts for modeling and querying list-structured data. Informat'ton Processzng and Management, 1994. To appear. Google ScholarDigital Library
- GM93.S. Grumbach and T. Milo.Towards tractable algebras for bags.In Proceedzngs of the twelfth A CM SIGA CT- SIGMOD-SIGART Sympos'tum on Prone'tples of Database Systems, pages 49-58, Washingtion, DC, May 1993. Google ScholarDigital Library
- GV88.M. Gyssens and D. Fan Gucht. The powerset algebra as a result of adding programming constructs to the nested relational algebra. In Proceedzngs of the A CM SIG- MOD Internatzonal Conference on Management of Data, pages 225-232, Chicago, IL, June 1988. Google ScholarDigital Library
- GW92.S. Ginsburg and X. Wang. Pattern matching by rs-operations: Towards a unified approach to querying sequenced data. In Proceedings of the eleventh A CM SIGACT-SIGMOD Symposzum on Principles o/Database @stems, pages 293-300, San Diego, California, 1992. Google ScholarDigital Library
- HKM93.G. G. Hillebrand, P. C. KaneIlakis, and H. G. Mairson. Database query languages embedded in the typed lambda calculus. In LICS, 1993.Google ScholarCross Ref
- HS89.R. Hull and J. Su. Untyped sets, invention, and computable queries. In Proceedings of the eighth A CM SIGA CT- SIGMOD-SIGART Symposium on Prznciples of Database Systems, pages 347-359, 1989. Google ScholarDigital Library
- HS91.R. Hull and J. Su. On the expressive power of database queries with intermediate types. Journal of Computer and System Sciences, 43(1):219-267, 1991. Google ScholarDigital Library
- HS93.R. Hull and J. Su. Algebraic and calculus query languages for recursively typed complex objects. Journal of Computer and System, Sczenees, 47:121-156, 1993. Google ScholarDigital Library
- Imm86.N. Immmerman. Relational queries computable in polynomial time. Information and Control, 68:86-104, 1986. Google ScholarDigital Library
- IPS91a.N. Immerman, S. Patnaik, and D. Stemple. The expressiveness of a family of finite set languages. Technical Report 91-96, Computer and Information Science Department, University of Massachusetts, 1991. Google Scholar
- IPS91b.N. Immerman, S. Patnaik, and D. Stemple. The expressiveness of a family of finite set languages. In Proceedings of the tenth A CM SIGA CT-SIGMOD-SIGART Symposium on Principles o/ Database Systems, pages 37-52# 1991. Google ScholarDigital Library
- KV93.G.M. Kuper and M. Y. Vardi. On the complexity of queries in the logical data model. Theoretical Computer Science, 116:33-57, 1993. Google ScholarDigital Library
- LM93.D. Leivant and J-Y. Marion. Lambda calculus characterizations of poly-time. In Proceedings of the Internatwnal Conference on Typed Lambda Calculi and Applications, 1993. To appear in Fundamenta Informaticae. Google ScholarDigital Library
- LW93.L. Libkin and L. Wong. Some properties of query languages for bags. In Proceedings of the Fourth International Workshop on Database Programming Languages, 1993. Google ScholarDigital Library
- MV93.D. Maier and B. Vance. A call to order. In Proceedings of the twelfth A CM SIGA CT- SIGMOD-SIGART Symposzum on Principles of Database Systems, pages 1-16, Washingtion, DC, May 1993. Google ScholarDigital Library
- PSV92.D.S. Parker, E. Simon, and P. Valduriez. SVP - a model capturint# sets, streams and parallelism. In Proceedings of the 18th VLDB Conference, pages 115-126, Vancouver, Canada, 1992. Google ScholarDigital Library
- Suc93.D. Suciu. Fixpoints and bounded fixpoints for complex objects. In Proceedings o/ the Fourth International Workshop on Database Programming Languages, 1993. Google ScholarDigital Library
- Tri91.P. Trinder. Comprehensions, a query notation for DBPLs. In Proceedings of the 3rd Internat'tonal Workshop on Database Programming Languages, pages 55-68, Nafplion, Greece, August 1991. Morgan Kaufmann. Google ScholarDigital Library
- Var82.M. Vardi. The complexity of relational query languages. In Proceedings of the 14th A CM Symposium on Theory of Computing, pages 137-146, 1982. Google ScholarDigital Library
Index Terms
- A query language for list-based complex objects
Recommendations
How to Make SQL Stand for String Query Language
DBPL '99: Revised Papers from the 7th International Workshop on Database Programming Languages: Research Issues in Structured and Semistructured Database ProgrammingA string database is simply a collection of tables, the columns of which contain strings over some given alphabet. We address in this paper the issue of designing a simple, user friendly query language for string databases. We focus on the language FO(•)...
Layout-sensitive language extensibility with SugarHaskell
Haskell '12: Proceedings of the 2012 Haskell SymposiumProgrammers need convenient syntax to write elegant and concise programs. Consequently, the Haskell standard provides syntactic sugar for some scenarios (e.g., do notation for monadic code), authors of Haskell compilers provide syntactic sugar for more ...
Comments