Temporal reasoning in a logic programming language with modularity

Actualmente os Sistemas de Informação Organizacionais (SIO) lidam cada vez mais com informação que tem dependências temporais. Neste trabalho concebemos um ambiente de trabalho para construir e manter SIO Temporais. Este ambiente assenta sobre um linguagem lógica denominada Temporal Contextua) Logic Programming que integra modularidade com raciocínio temporal fazendo com que a utilização de um módulo dependa do tempo do contexto. Esta linguagem é a evolução de uma outra, também introduzida nesta tese, que combina Contextua) Logic Programming com Temporal Annotated Constraint Logic Programming, na qual a modularidade e o tempo são características ortogonais. Ambas as linguagens são formalmente discutidas e exemplificadas. As principais contribuições do trabalho descrito nesta tese incluem: • Optimização de Contextua) Logic Programming (CxLP) através de interpretação abstracta. • Sintaxe e semântica operacional para uma linguagem que combina de um modo independente as linguagens Temporal Annotated Constraint Logic Programming (TACLP) e CxLP. É apresentado um compilador para esta linguagem. • Linguagem (sintaxe e semântica) que integra de um modo inovador modularidade (CxLP) com raciocínio temporal (TACLP). Nesta linguagem a utilização de um dado módulo está dependente do tempo do contexto. É descrito um interpretador e um compilador para esta linguagem. • Ambiente de trabalho para construir e fazer a manutenção de SIO Temporais. Assenta sobre uma especificação revista da linguagem ISCO, adicionando classes e manipulação de dados temporais. É fornecido um compilador em que a linguagem resultante é a descrita no item anterior. ABSTRACT- Current Organisational Information Systems (OIS) deal with more and more Infor-mation that, is time dependent. In this work we provide a framework to construct and maintain Temporal OIS. This framework builds upon a logical language called Temporal Contextual. Logic Programming that deeply integrates modularity with tem-poral reasoning making the usage of a module time dependent. This language is an evolution of another one, also introduced in this thesis, that combines Contextual Logic Programming with Temporal Annotated Constraint Logic Programming where modularity and time are orthogonal features. Both languages are formally discussed and illustrated. The main contributions of the work described in this thesis include: • Optimisation of Contextual Logic Programming (CxLP) through abstract interpretation. • Syntax and operational semantics for an independent combination of the temporal framework Temporal Annotated Constraint Logic Programming (TACLP) and CxLP. A compiler for this language is also provided. • Language (syntax and semantics) that integrates in a innovative way modularity (CxLP) with temporal reasoning (TACLP). In this language the usage of a given module depends of the time of the context. An interpreter and a compiler for this language are described. • Framework to construct and maintain Temporal Organisational Information Systems. It builds upon a revised specification of the language ISCO, adding temporal classes and temporal data manipulation. A compiler targeting the language presented in the previous item is also given

An implementation of a temporal relational database management system

Ankara : The Department of Computer Engineering and Information Science and the Institute of Engineering of Bilkent University, 1992.Thesis (Master's) -- Bilkent University, 1992.Includes bibliographical refences.111 this work, the implementation of a temporal database management system is reported. This system has been implemented on top of an existing database system that manipulates relations with set-valued attributes. The temporal relational model together with the tem])oral algebra are descril)ed. The basic set of opercitions of the extended relational algebra have been modified to handle temporal attributes. New operations have been added to help in the extraction of information from historical relations. These operations convcirt one attrilnite type to another and do selection over the time'dimension. Moreover, a statistical interface has been added to the system. This interface includes aggregate functions and a new operation, enumeration^ which derives a table of uniform data for a set of time points or intervals, from a three dimensional historical relation. A performance evaluation of the system is carried out by executing sample queries against different types of databases: snapshot, snapshot/nested and historical.Goralwalla, Iqbal AM.S

Implementação de um sistema temporal em um banco de dados orientado a objetos

Orientador: Claudia Bauzer MedeirosDissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Matematica, Estatistica e Ciencia da ComputaçãoResumo: Vários modelos têm sido propostos para incorporar o conceito de Tempo em Banco de Dados. A maioria destes modelos limita-se a incorporar as facilidades temporais em Sis­temas de Bancos de Dados Relacionais. Contudo, a maioria das aplicações que requerem um gerenciamento temporal de dados apresenta uma natureza orientada a objeto. As pesquisas sobre a incorporação de Tempo em Bancos de Dados Orientado a Objetos ainda estão em uma fase inicial. Este trabalho apresenta mais uma contribuição para o desenvolvimento das pesquisas nesta área. A contribuição consiste na implementação de um sistema de gerenciamento de tempo para um banco de dados orientados a objetos. Este sistema, a Camada de Gerenciamento Temporal, foi implementado sobre o sistema O2 e permite a definição e gerenciamento de dados temporais orientado a objetos, bem como o processamento de consultas temporais.Abstract: Many temporal data models have been suggested. A great number of these models is based on incorporating time only for relational databases systems. However, the applications that require temporal data management presents a object-oriented nature. Research on object-oriented database systems is still in its initial phase. This work presents a practical contribution to the research in this area. This contribution consists in the development of a temporal data management system for an object oriented database. This system - The Temporal Management Layer - was built on top of the O2 database system and allows the definition and management of object oriented temporal data, as well as the processing of temporal queries.MestradoMestre em Ciência da Computaçã

The expressive power of temporal relational query languages

We consider the representation of temporal data based on tuple and attribute timestamping. We identify the requirements in modeling temporal data and elaborate on their implications in the expressive power of temporal query languages. We introduce a temporal relational data model where N1NF relations and attribute timestamping are used and one level of nesting is allowed. For this model, a nested relational tuple calculus (NTC) is defined. We follow a comparative approach in evaluating the expressive power of temporal query languages, using NTC as a metric and comparing it with the existing temporal query languages. We prove that NTC subsumes the expressive power of these query languages. We also demonstrate how various temporal relational models can be obtained from our temporal relations by NTC and give equivalent NTC expressions for their languages. Furthermore, we show the equivalence of intervals and temporal elements (sets) as timestamps in our model. © 1997 IEEE

Query processing in temporal object-oriented databases

This PhD thesis is concerned with historical data management in the context of objectoriented databases. An extensible approach has been explored to processing temporal object queries within a uniform query framework. By the uniform framework, we mean temporal queries can be processed within the existing object-oriented framework that is extended from relational framework, by extending the existing query processing techniques and strategies developed for OODBs and RDBs. The unified model of OODBs and RDBs in UmSQL/X has been adopted as a basis for this purpose. A temporal object data model is thereby defined by incorporating a time dimension into this unified model of OODBs and RDBs to form temporal relational-like cubes but with the addition of aggregation and inheritance hierarchies. A query algebra, that accesses objects through these associations of aggregation, inheritance and timereference, is then defined as a general query model /language. Due to the extensive features of our data model and reducibility of the algebra, a layered structure of query processor is presented that provides a uniforrn framework for processing temporal object queries. Within the uniform framework, query transformation is carried out based on a set of transformation rules identified that includes the known relational and object rules plus those pertaining to the time dimension. To evaluate a temporal query involving a path with timereference, a strategy of decomposition is proposed. That is, evaluation of an enhanced path, which is defined to extend a path with time-reference, is decomposed by initially dividing the path into two sub-paths: one containing the time-stamped class that can be optimized by making use of the ordering information of temporal data and another an ordinary sub-path (without time-stamped classes) which can be further decomposed and evaluated using different algorithms. The intermediate results of traversing the two sub-paths are then joined together to create the query output. Algorithms for processing the decomposed query components, i. e., time-related operation algorithms, four join algorithms (nested-loop forward join, sort-merge forward join, nested-loop reverse join and sort-merge reverse join) and their modifications, have been presented with cost analysis and implemented with stream processing techniques using C++. Simulation results are also provided. Both cost analysis and simulation show the effects of time on the query processing algorithms: the join time cost is linearly increased with the expansion in the number of time-epochs (time-dimension in the case of a regular TS). It is also shown that using heuristics that make use of time information can lead to a significant time cost saving. Query processing with incomplete temporal data has also been discussed

A spatiotemporal indexing method for disaggregate transportation data

Time, location, and attributes are three elements of a GIS, but all commercial GIS packages can only handle location and attributes; they are in fact a static GIS. Spatiotemporal GIS has been a hot research topic recentlySpatiotemporal GIS and its application in transportation research are still prematureThis thesis focuses on spatiotemporal query problems on travel data Specifically, It attempts to answer this question during a time period which trips pass through one or more specific streets? To speed up this spatiotemporal query for large data sets, a spatiotemporal index on the trip data is built by combining Avenue, AML, and C+. All the trip origin ends and those last destination ends for each individual on each day are geocoded using Avenue scripts The trip shortest path route system is created based on ArcInfo dynamic segmentation and network analysis functionsAn array of 2-D tree structures based on each trip\u27s beginning time and ending time and each street traversed are then created in C++ and AvenueThis array of 2-D tree structures is stored in memory. Finally, the spatiotemporal query function is performed by examining the array of 2-D tree structures for a given time window using Avenue and C++. A sample trip log data file in the Knoxville Metropolitan Area and Knox county street shape file are used to implement the spatiotemporal query. This thesis is concluded that efficient indexing methods must be developed to handle complicated spatiotemporal queries for large travel data set

Implementation des ATKIS in GIS mit relationaler Attributverwaltung unter dem Aspekt der Fortführung

Das Amtliche Topographisch-Kartographische Informationssystem (ATKIS) ist ein Vorhaben der Landesvermessungsverwaltungen der Bundesrepublik Deutschland zum Aufbau digitaler Landschaftmodelle (DLM) und digitaler Kartenmodelle (DKM). In der Arbeit werden zunächst die Grundideen von ATKIS und von temporalen Datenmodellen dargestellt. Auf Grund einer Analyse des ATKIS-Objektartenkatalogs wurde ein Metainformationssystem DST entwickelt und mit Unterstützung des Instituts für Angewandte Geodäsie / Außenstelle Leipzig (IfAG) praktisch eingeführt. Weiterhin wurden Vorschläge für temporale Erweiterungen des DLM unterbreitet, die insbesondere die Gewinnung inkrementeller Fortführungsinformationen unterstützen