%0 Journal Article
%J Theoretical Computer Science
%D 2005
%T A new framework for addressing temporal range queries and some preliminary results
%A Shi,Qingmin
%A JaJa, Joseph F.
%K algorithms
%K Data structures
%K Orthogonal range search
%K temporal data
%X Given a set of n objects, each characterized by d attributes specified at m fixed time instances, we are interested in the problem of designing space efficient indexing structures such that a class of temporal range search queries can be handled efficiently. When m = 1 , our problem reduces to the d-dimensional orthogonal search problem. We establish efficient data structures to handle several classes of the general problem. Our results include a linear size data structure that enables a query time of O ( log n log m + f ) for one-sided queries when d = 1 , where f is the number of objects satisfying the query. A similar result is shown for counting queries. We also show that the most general problem can be solved with a polylogarithmic query time using superlinear space data structures.
%B Theoretical Computer Science
%V 332
%P 109 - 121
%8 2005/02/28/
%@ 0304-3975
%G eng
%U http://www.sciencedirect.com/science/article/pii/S0304397504007005
%N 1–3
%R 10.1016/j.tcs.2004.10.013