Partial Evaluations in a Set-Theoretic Query Language for the WWW

Authors:
Yury P. Serdyuk
Affiliations:
-
Venue:
FoIKS '00 Proceedings of the First International Symposium on Foundations of Information and Knowledge Systems
Year:
2000

Citing 11
Cited 1

Non-well-founded sets modeled as ideal fixed points

Information and Computation
Hereditarily-finite sets, data bases and polynomial-time computability

Informatika '91 Selected papers of the 5th Soviet-French symposium on Theoretical computer science, methods and tools for compilation, and program development
Notes on set theory

Notes on set theory
Reflective programming in the relational algebra

Journal of Computer and System Sciences
&Dgr;-languages for sets and LOGSPACE computable graph transformers

NSL '94 Proceedings of the first workshop on Non-standard logics and logical aspects of computer science
Linear ordering on graphs, anti-founded sets and polynomial time computability

Theoretical Computer Science
Typed query languages for databases containing queries

Information Systems
APPROXIMATE: A Query Processor that Produces Monotonically Improving Approximate Answers

IEEE Transactions on Knowledge and Data Engineering
Partial Answers for Unavailable Data Sources

FQAS '98 Proceedings of the Third International Conference on Flexible Query Answering Systems
Querying Semi-Structured Data

ICDT '97 Proceedings of the 6th International Conference on Database Theory
Bounded Hyperset Theory and Web-like Data Bases

KGC '97 Proceedings of the 5th Kurt Gödel Colloquium on Computational Logic and Proof Theory

Using Agents for Concurrent Querying of Web-Like Databases via a Hyper-Set-Theoretic Approach

PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an approach to handle unavailable data sources during query execution over WWW which is based on partial evaluations. Syntax of the set-theoretic query language Δ and some examples of queries are given. We define an ordinary and a lazy semantics for this language. Moreover, we introduce a universe of non-well-founded hereditarily finite protosets and an approximation relation on this universe in order to compare the partial answers to a query. A theorem about properties of the above semantics, in particular about correctness of lazy semantics is formulated.