Tansel, Clifford, Gadia, Jajodia, Segev, Snodgrass. Temporal Databases -- Theory, Design and Implementation, The Benjamin / Cummings Publishing Company Inc., 1993. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Video Database on WWW - Hauglid, Heggland, Midtstraum (1999) (Correct)
....interface for selecting inter query operations is shown in Figure 8. Figure 8: Combining search results using logical operations or temporal relations As the figure shows, not only the logical operators AND, OR and AND NOT is available. You can also select from the 13 possible temporal relations [6]. 4.3 Meta data visualization Having performed a search such as the Claes or Brundtland example in the previous section, WebSTAR s video player enables you to jump directly to the intervals resulting from the search. However, it might be very difficult to understand what is actually happening in ....
Tansel, Clifford, Gadia, Jajodia, Segev, Snodgrass. Temporal Databases -- Theory, Design and Implementation, The Benjamin / Cummings Publishing Company Inc., 1993.
I/O-Efficient Join Algorithms for Temporal, Spatial, and.. - Ramaswamy, Suel (1996) (2 citations) (Correct)
....rectangles in d dimensions. In this paper, we present I O efficient algorithms for the d dimensional rectangle join problem in one, two, and three dimensions, and then generalize our algorithms to arbitrary higher dimensions. We thus provide I O efficient algorithms for join problems in temporal [26], spatial [21,22] and constraint [15] databases. For one and two dimensions, our algorithms are I O optimal, and are simple enough to be useful in practice as well. 1 We use the term rectangle in a general sense to denote intervals in one dimension, rectangles in two dimensions and ....
....lower bound for sorting in external memory [1] 1.2 Joins in One Dimension In one dimension, the join is simply the set of intersections between two sets of intervals. Hence, we refer to this problem as the interval join problem. This problem is the prototypical join problem in temporal [26] and constraint [15,16] data models. On line interval intersection is the problem where a data structure is built on an input set of intervals and then queried (or updated) in an on line fashion. That is, the results of a query have to be returned before the next query is processed. This problem ....
A. U. Tanzel, J. Clifford, S. Gadia, S. Jajodia, A. Segev & R. Snodgrass, eds., Temporal Databases: Theory, Design and Implementation, The Benjamin/Cummings Publishing Company Inc., 1993.
Theory and Practice of I/O-Efficient Algorithms.. - Arge, Procopiuc.. (1998) (5 citations) (Correct)
.... problem of determining all intersecting pairs among a set of axis parallel hyperrectangles in d dimensional space [15, 17, 16, 35, 9] The problem is a key component in VLSI design rule checking [31] and in databases it is a component in the fundamental join operator in relational [19] temporal [36], spatial [33, 34] and constraint [22] models. 1.2 Previous related results As mentioned, considerable attention has recently been given to the development of provably I O efficient algorithms. Aggarwal and Vitter [2] considered sorting and permutation related problems in the two level I O model ....
A. U. Tanzel, J. Clifford, S. Gadia, S. Jajodia, A. Segev, and R. Snodgrass. Temporal Databases: Theory, Design and Implementation. The Benjamin/Cummings Publishing Company Inc., 1993.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC