In this paper we discuss a connection between two seemingly distant research areas in computer science: constraint databases and abstract interpretation. We show that while the goals of research in the respective communities are diierent, the used techniques are often based on similar common foundations. We substantiate this claim by showing that abstract interpretation of a standard (Algol-lik...

Communication protocols are the computational basis for distributed electronic commerce systems, and thus the properties of these protocols deene the forms of commerce possible in electronic systems. Existing protocols used for electronic commerce focus primarily on security properties, including message integrity, privacy and non-repudiation, and on basic transaction properties, usually just a...

In this paper we propose a method for efficient management of large spatial ontologies. Current spatial ontologies are usually represented using an ontology language, such as OWL and stored as OWL files. However, we have observed some shortcomings using this approach especially in the efficiency of spatial query processing. This fact motivated the development of a hybrid approach that uses an R...

In this paper we propose a logic-based, framework inspired by artificial intelligence, but scaled down for practical database and programming applications. Computation in the framework is viewed as the task of generating a sequence of state transitions, with the purpose of making an agent’s goals all true. States are represented by sets of atomic sentences (or facts), representing the values of...

We study regular 1rst-order update logic (FUL), which is a variant of regular dynamic logic in which updates to function symbols as well as to predicate symbols are possible. We 1rst study FUL without making assumptions about atomic updates. Second, we look at relational algebra update logic (RAUL), which can be viewed as an extension of relational algebra with assignment. RAUL is an instantiat...

Schema versioning is an indispensable feature for applications using temporal databases and requiring an entire history of data and schema. τXSchema [6] is an infrastructure for constructing and validating temporal XML documents; but any explicit support for XML schema versioning is offered. A τXSchema schema is composed of a conventional XML Schema document annotated with physical and logical ...

We present a hierarchically structured transaction oriented concept for a rule based active database system In LL LHL we have proposed Statelog as a uni ed framework for active and deductive rules Following the need for better structuring capabilities we intro duce procedures as a means to group semantically related rules and to encapsulate their behavior In addition to executing elementary upd...

Database outsourcing is an idea to eliminate the burden of database management from organizations. Since data is a critical asset of organizations, preserving its privacy from outside adversary and untrusted server should be warranted. In this paper, we present a distributed scheme based on storing shares of data on different servers and separating indexes from data on a distinct server. Shamir...

A data warehouse is an integrated and timevarying collection of data derived from operational data and primarily used in strategic decision making by means of online analytical processing (OLAP) techniques. Although it is generally agreed that warehouse design is a non-trivial problem and that multidimensional data models and star or snowflake schemata are relevant in this context, hardly any m...

Experimental studies have pointed out that operational spreadsheets contain a lot of errors, mostly due to the lack of abstraction offered by existing spreadsheet programs. In this paper, we consider the specification of a spreadsheet using a database query language and the generation of the corresponding running spreadsheet. We present a technique to perform this generation automatically, allo...