Normal Forms and Conservative Extension Properties for Query Languages over Collection Types

ISSN： 0022-0000

Source： Journal of Computer and System Sciences, Vol.52, Iss.3, 1996-06, pp. : 495-505

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Complete Geometric Query Languages

By Gyssens M. van den Bussche J. van Gucht D.

Journal of Computer and System Sciences, Vol. 58, Iss. 3, 1999-06 ,pp. : 483-511

Academic Press

Access to resources Recommend Favorite

Semantic Extension of Query for the Linked Data

International Journal on Semantic Web and Information Systems (IJSWIS), Vol. 13, Iss. 4, 2017-10 ,pp. : 109-133

IGI Global_journal

Access to resources Recommend Favorite

Query automata over finite trees

By Neven F. Schwentick T.

Theoretical Computer Science, Vol. 275, Iss. 1, 2002-03 ,pp. : 633-674

Elsevier

Access to resources Recommend Favorite

The Kolmogorov expressive power of Boolean query languages

By Tyszkiewicz J.

Theoretical Computer Science, Vol. 190, Iss. 2, 1998-01 ,pp. : 317-361

Elsevier

Access to resources Recommend Favorite

Semantic Representations and Query Languages for Or-Sets

By Libkin L. Wong L.

Journal of Computer and System Sciences, Vol. 52, Iss. 1, 1996-02 ,pp. : 125-142

Academic Press

Access to resources Recommend Favorite