A Time Efficient Indexing Scheme for Complex Spatiotemporal Retrieval

Computer Science – Databases

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

6 pages, 7 figures, submitted to Sigmod Record

Scientific paper

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 with order). Therefore, the efficient processing of a spatiotemporal predicate is crucial for the efficient implementation of more complex queries of practical interest. We propose an extension of a known approach, suitable for processing spatial predicates, which has been used for the efficient manipulation of STP queries with order. The extended method is supported by efficient indexing structures. We also provide experimental results that show the efficiency of the technique.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A Time Efficient Indexing Scheme for Complex Spatiotemporal Retrieval does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Time Efficient Indexing Scheme for Complex Spatiotemporal Retrieval, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Time Efficient Indexing Scheme for Complex Spatiotemporal Retrieval will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-188793

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.