By Topic

Completeness of Query Operations on Resource Spaces

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Hai Zhuge Hai Zhuge ; Key Lab. of Intell. Inf. Process., Inst. of Comput. Technol., Beijing, China ; Erlin Yao Erlin Yao

A great variety of languages can be designed by different people for different purposes to operate resource spaces. Two fundamental issues are: can we design more operations in addition to existing operations? and, how many operations are sufficient or necessary? This paper solves these problems by investigating the theoretical basis for determining how complete a selection capability is provided in a resource operation sublanguage independent of any host language. The result is very useful to the design and analysis of operating languages.

Published in:

Semantics, Knowledge and Grid, 2006. SKG '06. Second International Conference on

Date of Conference:

1-3 Nov. 2006