Specification and Implementation of Temporal Databases in a Bitemporal Event Calculus

1999 ◽  
pp. 74-85 ◽  
Author(s):  
Carlos A. Mareco ◽  
Leopoldo Bertossi
Keyword(s):  
Temporal Databases ◽  
Event Calculus ◽  
Specification And Implementation

scholarly journals Cache-efficient sweeping-based interval joins for extended Allen relation predicates

2021 ◽  
Author(s):  
Danila Piatov ◽  
Sven Helmer ◽  
Anton Dignös ◽  
Fabio Persia
Keyword(s):  
Data Structure ◽  
Experimental Evaluation ◽  
State Of The Art ◽  
Temporal Databases ◽  
Access Method ◽  
Wide Range ◽  
Interval Relation ◽  
Cache Efficient ◽  
Join Algorithms ◽  
Better Than

AbstractWe develop a family of efficient plane-sweeping interval join algorithms for evaluating a wide range of interval predicates such as Allen’s relationships and parameterized relationships. Our technique is based on a framework, components of which can be flexibly combined in different manners to support the required interval relation. In temporal databases, our algorithms can exploit a well-known and flexible access method, the Timeline Index, thus expanding the set of operations it supports even further. Additionally, employing a compact data structure, the gapless hash map, we utilize the CPU cache efficiently. In an experimental evaluation, we show that our approach is several times faster and scales better than state-of-the-art techniques, while being much better suited for real-time event processing.

Main Memory-Based Algorithms for Efficient Parallel Aggregation for Temporal Databases

2004 ◽  
Vol 16 (2) ◽  
pp. 123-163 ◽  
Author(s):  
Dengfeng Gao ◽  
Jose Alvin G. Gendrano ◽  
Bongki Moon ◽  
Richard T. Snodgrass ◽  
Minseok Park ◽  
...  
Keyword(s):  
Main Memory ◽  
Temporal Databases

Resolution of time concepts in temporal databases

1994 ◽  
Vol 80 (1-2) ◽  
pp. 91-125 ◽  
Author(s):  
Sharma Chakravarthy ◽  
Seung-Kyum Kim
Keyword(s):  
Temporal Databases ◽  
Time Concepts

CHR grammars

2005 ◽  
Vol 5 (4-5) ◽  
pp. 467-501 ◽  
Author(s):  
HENNING CHRISTIANSEN
Keyword(s):  
Logic Programming ◽  
Integrity Constraints ◽  
Bottom Up ◽  
Context Sensitive ◽  
Language Analysis ◽  
Definite Clause Grammars ◽  
Grammar Rules ◽  
High Flexibility ◽  
Definite Clause ◽  
Specification And Implementation

A grammar formalism based upon CHR is proposed analogously to the way Definite Clause Grammars are defined and implemented on top of Prolog. These grammars execute as robust bottom-up parsers with an inherent treatment of ambiguity and a high flexibility to model various linguistic phenomena. The formalism extends previous logic programming based grammars with a form of context-sensitive rules and the possibility to include extra-grammatical hypotheses in both head and body of grammar rules. Among the applications are straightforward implementations of Assumption Grammars and abduction under integrity constraints for language analysis. CHR grammars appear as a powerful tool for specification and implementation of language processors and may be proposed as a new standard for bottom-up grammars in logic programming.

Sign in / Sign up

Export Citation Format

Share Document