Skip Navigation


Logic Journal of IGPL Advance Access originally published online on September 29, 2006
Logic Journal of IGPL 2006 14(5):785-814; doi:10.1093/jigpal/jzl010
This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
14/5/785    most recent
jzl010v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Sazonov, V.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author, 2006. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

Querying Hyperset/Web-Like Databases

Vladimir Sazonov

Department of Computer Science, University of Liverpool, Liverpool L69 7ZF, UK. E-mail: v.sazonov{at}csc.liv.ac.uk


  Abstract

Hyperset approach to Web-like (semistructured) databases is presented in a simple and intuitive way, hopefully for a wider audience, with demonstrating how this abstract view can be represented in concrete terms of set equations distributed between many hyperlinked HTML files of a particular form. Detailed, bisimulation invariant operational semantics of hyperset query language {Delta} is defined by means of reduction rules transforming such systems of set equations. The high expressive power of this language, formerly characterised by using the technique of descriptive complexity theory, is illustrated by defining formal semantics of path expressions, as well as of other known languages UnQL and UnCAL. A "horizontal", stronger alternative to structural recursion of UnCAL is introduced, both definable in {Delta}.

Key Words: Semistructured or Web-like databases • hypersets • non-well-founded sets • bisimulation • query language • Delta • UnQL • UnCAL • expressive power • path expressions • structural recursion


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.