Department of Computing and Software Engineering

... on the pic-tures is done using efficient data structures, R-and R+-trees (multi-dimensional B-trees ... Intradomain operators are outside the relational model, and their interface is not part of PSQL. ... independently to edit an ele-ment of a spatial domain and to load it in the database. ...

There is a growing belief that the next generation of information processing systems will be based on the paradigm of Intelligent and Cooperative Information Systems (ICISs). Such systems will involve information agents—distributed over the nodes of a common communication network—which work in a synergistic manner by exchanging information and expertise, coordinating their activities and negotiating how to solve parts of a common information-intensive problem. Along with motivating the importance of such systems the ...

In some recently proposed extensions to relational database systems as well as in deductive databases, a database system is presented with a collection of queries to process instead of just one. It is an interesting problem then, to come up with algorithms that process these queries together instead of one query at a time. We examine the problem of multiple (global) query optimization in this paper. A hierarchy of algorithms that can be used for global query optimization is exhibited and analyzed. These algorithms range from an arbitrary serial execution without any sharing of common results among the queries to an exhaustive search of all possible ways to process all queries.