See this document in CiteSeerX!

Normal Forms and Conservative Properties for Query Languages over Collection Types (1993)  (Make Corrections)  (60 citations)
Limsoon Wong



  Home/Search   Context   Related

 
View or download:
upenn.edu/pub/papers/db...pods93a.ps.Z
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  upenn.edu (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Strong normalization results are obtained for a general language for collection types. An induced normal form for sets and bags is then used to show that the class of functions whose input has height (that is, the maximal depth of nestings of sets/bags/lists in the complex object) at most i and output has height at most o definable in a nested relational query language without powerset operator is independent of the height of intermediate expressions used. Our proof holds regardless of whether ... (Update)

Cited by:   More
Why and Where: - Characterization Of Data   (Correct)
On Two Forms of Structural Recursion - Dan Suciu And (1995)   (Correct)
Local Properties of Query Languages - Dong, Libkin, Wong (1997)   (Correct)

Similar documents (at the sentence level):
47.6%:   Normal Forms And Conservative Extension Properties For Query.. - Wong (1995)   (Correct)
45.8%:   Normal Forms and Conservative Extension Properties for Query.. - Wong (1995)   (Correct)

Active bibliography (related documents):   More   All
0.2:   Naturally Embedded Query Languages - Breazu-Tannen, Buneman, Wong (1992)   (Correct)
0.2:   Towards Tractable Algebras for Bags - Grumbach, Milo (1993)   (Correct)
0.2:   Tutorial: Languages for Collection Types - Tannen (1994)   (Correct)

Similar documents based on text:   More   All
0.3:   Query Languages for Bags - Libkin, Wong (1993)   (Correct)
0.3:   Some Properties of Query Languages for Bags - Libkin, Wong (1993)   (Correct)
0.2:   Polymorphic Queries Across Sets, Bags, and Lists - Wong (1994)   (Correct)

Related documents from co-citation:   More   All
25:   Converting nested relational algebra expressions into flat algebra expressions (context) - Paredaens, Van Gucht - 1992
24:   Naturally embedded query languages (context) - Breazu-Tannen, Buneman et al. - 1992
22:   Foundations of databases (context) - Abiteboul, Hull et al. - 1995

BibTeX entry:   (Update)

L. Wong. Normal forms and conservative properties for query languages over collection types. In Proceedings of 12th ACM Symposium on Principles of Database Systems, pages 26--36, Washington, D. C., May 1993. http://citeseer.ist.psu.edu/wong93normal.html   More

@inproceedings{ wong93normal,
    author = "Limsoon Wong",
    title = "Normal Forms and Conservative Properties for Query Languages over Collection Types",
    pages = "26--36",
    year = "1993",
    url = "citeseer.ist.psu.edu/wong93normal.html" }
Citations (may not include all citations):
369   Information and Computation (context) - Moggi, Computation - 1991
258   Miranda---a Non-strict Functional Language with Polymorphic .. (context) - Turner - 1985
257   Report on the Programming Language Haskell (context) - Hudak, Wadler - 1990
254   Comprehending Monads - Wadler - 1990
224   Semantics of Programming Languages: Structures and Technique.. (context) - Gunter - 1992
221   Denotational Semantics: A Methodology For Language Developme.. (context) - Schmidt - 1986
164   IFO: A Formal Semantic Database Model (context) - Abiteboul, Hull - 1987
129   the Power of Languages for the Manipulation of Complex Objec.. - Abiteboul, Beeri - 1988
106   Naturally Embedded Query Languages (context) - Breazu-Tannen, Buneman et al. - 1992
90   Structural Recursion as a Query Language - Breazu-Tannen, Buneman et al. - 1991
78   Nested Relational Structures (context) - Thomas, Fischer - 1986
71   Remarks on the Algebra of Nonfirst Normal Form Relations (context) - Jaeschke, Schek - 1982
59   Logical and Computational Aspects of Pro- gramming with Sets.. (context) - Breazu-Tannen, Subrahmanyam - 1991
44   the Expressive Power of Database Queries with Intermediate T.. (context) - Hull, Su - 1991
39   Converting Nested Relational Algebra Expressions into Flat A.. (context) - Paredaens, Van Gucht - 1992
38   Recursion Equations as a Programming Language (context) - Turner - 1982
24   Comprehension: A Query Notation for DBPLs - Trinder - 1991
21   Listlessness is better than laziness (context) - Wadler - 1984
20   An Introduction to the Completeness of Languages for Complex.. (context) - Abiteboul, Beeri et al. - 1989
17   Possibilities and Limitations of Using Flat Operators in Nes.. (context) - Paredaens, Van Gucht - 1988
15   A Comparison Between Algebraic Query Languages for Flat and .. (context) - Gyssens, Van Gucht - 1991
13   Towards a Theory of Bulk Types - Watt, Trinder - 1991
12   The Format Model: A Theory of Database Organisation (context) - Hull, Yap - 1984
11   Playing Games with Objects (context) - Grumbach, Vianu - 1990
3   Listlessness is better than laziness II (context) - Wadler - 1985



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.cis.upenn.edu.html):   More
User-Controlled Physics-Based Animation for Articulated.. - Kokkevis, Metaxas, Badler (1996)   (Correct)
Semistructured Data - Buneman (1997)   (Correct)
A Hybrid Approach to Formal Verification Applied to an ATM.. - Clarke, Lee (1996)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC