Querying Hyperset/Web-Like Databases

DOI10.1093/JIGPAL/JZL010MaRDI QIDQ3424122zbMATH OpenOpenAlexFDO

Authors Vladimir Yu. Sazonov

Publication date 15 February 2007

Published in Logic Journal of the IGPL (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/jigpal/jzl010

zbMATH Keywords

bisimulationDeltaexpressive powerhypersetsnon-well-founded setspath expressionsquery languagesemistructured or Web-like databasesstructural recursionUnCALUnQL

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• Web-like databases, non-well-founded sets and inductive definability
• -languages for sets and LOGSPACE computable graph transformers
• scientific article; zbMATH DE number 2084359
• \(\Delta\): set-theoretic query language capturing LOGSPACE
• Queries and computation on the web

Cited in

(5)

• Queries and computation on the web
• scientific article; zbMATH DE number 1629816 (Why is no real title available?)
• High-Level Web Data Abstraction Using Language Integrated Query
• scientific article; zbMATH DE number 2084359 (Why is no real title available?)
• Web-like databases, non-well-founded sets and inductive definability

This page was built for publication: Querying Hyperset/Web-Like Databases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3424122)