The paper is concerned with the time efficient processing of spatiotemporal predicates, i.e. spatial predicates associated with an exact temporal constraint. A set of such predicates forms a buffer query or a Spatio-temporal Pattern (STP) Query with time. In the more general case of an STP query, the temporal dimension is introduced via the relative order of the spatial predicates (STP queries ...

A wide range of additional forward chaining applications could be realized with deductive databases, if their rule formalism, their immediate consequence operator, and their fixpoint iteration process would be more flexible. Deductive databases normally represent knowledge using stratified Datalog programs with default negation. But many practical applications of forward chaining require an ext...

This paper is the second in a series of two papers presenting recent developments concerning the interaction between aspectual classes of predicates and the semantics of aspectual for-phrases. Aspectual for-phrases must modify predicates which are homogeneous meaning that the predicate spreads appropriately to subintervals. For eventive predicates the relevant notion of homogeneity should be a ...

In this paper we review Dale s algorithm for determining the content of a referring expres sion The algorithm which only permits the use of one place predicates is revised and extended to deal with n ary predicates We investigate the problem of blocking recursion in complex noun phrases and propose a solution in the context of our algorithm

1. introduction in addition to simple verbs, persian employs a large number of complex predicates consisting of a preverbal element and a light verb. the preverbal element can be a noun, an adjective, an adverb or a preposition phrase, which combines with a verb to form a single syntactic predicate. persian complex verbs have attracted some researchers (e.g. folli, harley & karimi 2005, karimi ...

Chapter 5 presents a novel approach for processing complex twig pattern with OR-predicates and AND-predicates over XML document streams which a twig pattern is represented as a query tree. Its OR-predicates and AND-predicates are represented as a separate abstract syntax tree associated with the branch node, and all the twig patterns are combined into a single prefix query tree that represents ...

There has been a long record of research for efficient join algorithms in RDBMS, but user-defined join predicates in ORDBMS are typically evaluated using a restriction after forming the complete Cartesian product. While there has been some research on join algorithms for non-traditional data (e.g. spatial joins), today's ORDBMS offer developers no general mechanism that allows to implement user...