Abstract. Aggregate R-B-tree (aRB-tree) provides a framework for supporting OLAP operations over spatio-temporal data. Although existing aRB-tree implementations process sptio-temporal aggregate queries pretty efficiently, it is hardly applicable for online processing due to the excessive accesses to the aggregate B-trees of the entries in the R-tree and the overlap in the R-tree. This paper ad...

In this article we present a family of four tree-based access structures for indexing spatio-temporal objects. Our indexing methods support spatio-temporal, as well as purely spatial and purely temporal queries. 111 order to handle sets of extended spatio-teniporal objects we propose to specialize generalized search trees by combining the advantages of the well-known spatial structures R*-tree ...

Most Web pages contain temporal information. However, most of previous studies only consider the update time of Web pages rather than fully exploit different temporal features in Web. In this paper, we propose a novel approach to fusing different temporal features in Web pages to build an efficient index structure for temporal-textual Web search. Specially, we focus on update time and content t...

The temporal aggregation in temporal databases is an extension of the conventional aggregation including the time as a range condition of the aggregation. In this paper, we propose a new tree based structure for the temporal aggregation, called the CTA-tree. In the CTA-tree, we transform the time interval of a temporal data record into a value, called the T-value, using the Corner transformatio...

It’s a well-known fact that new GIS applications need to keep track of temporal information. However, the most widely used spatial index, the R-Tree and its variants, do not preserve the evolution of bounding boxes. Some new indexing structures were proposed in the literature that allows the retrieving of present and past states of data. In this paper we evaluate the most popular indexes struct...

Typically, geospatial data include satellite imagery, digital orthophoto quads, maps, digital line graphs, census data, voter registration, land ownership data, and land use data. This data is considered sensitive based on its location (characterized by its longitude and latitude), resolution, and the time of capture, among others. Since both objects and authorizations are associated with spati...

Partial order temporal logics interpreted on trace systems have been shown not to have finitary complete axiomatizations due to the fact that the complexity of their decidability problem is in 11. This paper gives infinitary complete proof systems for several temporal logics on trace systems e.g. Computation Tree Logic with past operators and an essential subset of Interleaving Set Temporal Logic.

A complete axiomatic system CTL rp is introduced for a temporal logic for nitely branching ! +-trees in a language extended with so called reference pointers. Syntactic and semantic interpretations are constructed for the branching time computation tree logic CTL into CTL rp. In particular, that yields a complete axiomatization for the translations of all valid CTL-formulae. Thus, the temporal ...

Contrary to MON-tree index less than the temporal and spatial indexing methods based on road networks we proposed Improved-MON-tree. The index is divided into two levels and the quad tree grid index at the top of the road network, and the bottom of the two-dimensional Rtree index moving object moving information. In order to support the global trajectory of moving objects query, add a hash stru...