A. Kumar, V.J. Tsotras, and C. Faloutsos, "Designing Access Methods for Bitemporal Databases," IEEE Trans. Knowledge and Data Eng., vol. 10, no. 1, pp. 1-20, Jan.-Feb. 1998. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Trajectory Queries and Octagons - In Moving Object (Correct)
....Another index structure is TB tree which indexes mbbs of fixed size segments of trajectories. In [8] a splitting strategy was developed to split the input trajectories into fixed number of segments such that the total volume of the resulting mbbs of these segments is minimized. PPR trees by [13] are used to organize the mbbs of the trajectory segments. 17] studied past movement of discretely moving objects, and introduced MV3R tree a combination of a multiversion R # tree and a 3 d R # tree. MV3R trees can also be used to index mbb approximations of moving object trajectories. In ....
....linked together. 8] developed algorithms to distribute a predefined total number of splits among a set of trajectories and an optimal algorithm and a heuristic are developed to split each trajectory based on the distribution generated. Furthermore, PPR trees (partially persistent R trees) [13] were used to index the resulting mbbs of trajectory segments. It is clear that mbbs are coarse approximations for trajectories. The approach in this paper is to replace mbbs by the finer mbop approximation and organize mbops into a new index structure to achieve better overall performance of ....
[Article contains additional citation context not shown here]
A. Kumar, V. J. Tsotras, and C. Faloutsos. Designing access methods for bitemporal databases. IEEE Trans. Knowledge and Data Engineering, 10(1), 1998.
Metadata Efficiency in Versioning File Systems - Soules, Goodson, Strunk, Ganger (2003) (9 citations) (Correct)
....extremely space efficient comprehensive versioning. In addition to the significant file system work in versioning, there has been quite a bit of work done in the database community for keeping versions of data through time. Most of this work has been done in the form of temporal data structures [2, 23, 24, 44, 45]. Our directory structure borrows from these techniques. The log structured data layout was developed for writeonce media [33] and later extended to provide write performance benefits for read write disk technology [36] Since its inception, LFS has been evaluated [3, 28, 35, 38] and used [1, 7, ....
A. Kumar, V. J. Tsotras, and C. Faloutsos. Designing access methods for bitemporal databases. IEEE Transactions on Knowledge and Data Engineering, 10(1), February 1998.
Query Indexing and Velocity Constrained Indexing.. - Prabhakar, Xia.. (2002) (9 citations) (Correct)
.... [27] In particular, the only constraint imposed on objects in our model is that for Velocity Constrained Indexing (discussed in Section 5) each object has a maximum speed at which it can travel (in any direction) Indexing techniques for moving objects are being proposed in the literature, e.g. [8, 19] index the histories, or trajectories, of the positions of moving objects, while [27] indexes the current and anticipated future positions of the moving objects. In [17] trajectories are mapped to points in a higher dimensional space which are then indexed. In [27] objects are indexed in their ....
Anil Kumar, Vassilis J. Tsotras, and Christos Faloutsos. Designing access methods for bitemporal databases. 10(1):1-20, 1998.
Query Indexing and Velocity Constrained Indexing.. - Prabhakar, Xia.. (2002) (9 citations) (Correct)
.... particular, the only constraint imposed on objects in our model is that, for Velocity Constrained Indexing (discussed in Section 5) each object has a maximum speed at which it can travel (in any direction) Indexing techniques for moving objects are being proposed in the literature, e.g. 8] [20] index the histories, or trajectories, of the positions of moving objects, while [29] indexes the current and anticipated future positions of the moving objects. In [18] trajectories are mapped to points in a higher dimensional space which are then indexed. In [29] objects are indexed in their ....
A. Kumar, V.J. Tsotras, and C. Faloutsos, "Designing Access Methods for Bitemporal Databases," IEEE Trans. Knowledge and Data Eng., vol. 10, no. 1, pp. 1-20, 1998.
Recent Progress on Selected Topics in Database Research - Chen, Li, al. (Correct)
....common nodes, if the objects in these nodes do not incur extent changes. The first partially persistent structure, the historical R tree (HR tree) 47] however, still involves considerable data redundancy as analyzed in [62] which led to the development of the multi version R tree (MVR tree) [46], and its subsequent versions [57, 45, 43] Besides the partially persistent methodology, historical STDB can also be indexed using a 3D R tree by treating time just as an extra dimension (in addition to the two spatial dimensions) Specifically, each record in the 3D R tree [65] represents a 3D ....
A. Kumar, V. Tsotras, and C. Faloutsos. Designing access methods for bitemporal databases. TKDE, 10(1):1--20, 1998.
Indexing the Trajectories of Moving Objects - Pfoser (Correct)
....In [7] Hadjileftheriou et al. dene an approach to reduce the dead space introduced by MBB approximations of trajectories (cf. Section 2.3) by introducing articial object updates. They effectively manipulate the partitioning of a trajectory into segments. A partially persistent tree structure [5, 18] is used to index the data. This approach generalizes a previous work [4] in which it was assumed that the objects move with a linear function of time, whereas in [7] more complex functions are permitted. Porkaew et al. 15, 6] examine the indexing of trajectories in Native Space (cf. Section ....
A. Kumar, V. Tsotras, and C. Faloutsos. Designing access methods for bitemporal databases. IEEE Transactions on Knowledge and Data Engineering, 10(1):1--20, 1998.
Metadata Efficiency in a Comprehensive Versioning File.. - Soules, Goodson, Strunk, .. (2002) (4 citations) (Correct)
....CVFS to provide efficient comprehensive versioning. In addition to the significant file system work in versioning, there has been quite a bit of work done in the database community for keeping versions of data through time. Most of this work has been done in the form of temporal data structures [2, 22, 23, 44, 45]. Our directory structure borrows from these techniques. The log structured data layout was developed for write once media [33] and later extended to provide write performance benefits for read write disk technology [36] Since its inception, LFS has been evaluated [3, 27, 35, 38] and used [1, ....
Anil Kumar, Vassilis J. Tsotras, and Christos Faloutsos. Designing access methods for bitemporal databases. IEEE Transactions on Knowledge and Data Engineering, 10(1), February 1998.
Indexing Problems in Spatiotemporal Databases - Kollios (2000) Self-citation (Tsotras) (Correct)
No context found.
A. Kumar, V.J. Tsotras and C. Faloutsos. Designing Access Methods for Bitemporal Databases. IEEE Transactions on Knowledge and Data Engineering, 10(1):1-20, 1998.
Index Based Processing of Semi-Restrictive Temporal Joins - Zhang, Tsotras (2002) Self-citation (Tsotras) (Correct)
No context found.
A. Kumar, V. J. Tsotras and C. Faloutsos, \Designing Access Methods for Bitemporal Databases", TKDE 10(1), 1998.
Efficient Complex Query Support for - Multiversion Xml Documents Self-citation (Tsotras) (Correct)
....a small segment could require reading a lot of unnecessary data. While UBCC is very effective at supporting full version retrieval queries, complex queries on content and history combined call for indexing techniques such are the Multiversion B Tree [17, 3, 27] and the Multiversion R Tree [13]. We investigate the following three approaches: Scheme 1: single Multiversion B Tree, Scheme 2: UBCC with a Multiversion B Tree, and Scheme 3: UBCC with a Multiversion R Tree. The last two approaches still use the UBCC mechanism as the main storage scheme for the document elements. The ....
....as elements are added updated in the page. To answer a range retrieval query, the index should identify the UBCC pages with range intervals that intersect the query range at the given version. Hence, this index must support multiversion interval intersection queries. The Multiversion R tree (MVRT) [13, 26] is such an index. Like the MVBT, the MVRT conceptually maintains many versions of an ephemeral R tree. We note that this MVRT is a sparse index: it does not store the element DNNs; rather, the ranges of page DNNs are stored. As a result, using the MVRT to implement the full index will result in a ....
A. Kumar, V. J. Tsotras and C. Faloutsos, "Designing Access Methods for bitemporal Databases", IEEE TKDE 10(1), pp. 1-20, 1998.
Index Based Processing of Semi-Restrictive Temporal Joins - Zhang, Tsotras Self-citation (Tsotras) (Correct)
No context found.
A. Kumar, V. J. Tsotras and C. Faloutsos, "Designing Access Methods for Bitemporal Databases", TKDE 10(1), 1998.
Aggregation Computation over Complex Objects - Zhang (2002) (2 citations) Self-citation (Tsotras) (Correct)
....model used by the temporal application. In the temporal database literature two time dimensions have been proposed, namely the valid time and the transaction time [J 98] The kind of updates supported on the temporal data depends on whether valid time or transaction time (or both) is supported [KTF98]. In a valid time environment when a tuple is inserted in the database, its associated interval is fully known. Moreover, tuples can be added and deleted from the database in any order. After a tuple is deleted its record is physically removed from the database (and thus cannot be further ....
A. Kumar, V. Tsotras and C. Faloutsos, "Designing Access Methods for Bitemporal Databases", IEEE TKDE 10(1), 1998.
Efficient Structural Joins on Indexed XML Documents - Chien, Vagena, Zhang, Tsotras (2002) (8 citations) Self-citation (Tsotras) (Correct)
No context found.
A. Kumar, V. J. Tsotras and C. Faloutsos, \Designing Access Methods for bitemporal Databases", IEEE TKDE 10(1), 1998.
Efficient Structural Joins on Indexed XML Documents - Chien, Vagena, Zhang.. (2002) (8 citations) Self-citation (Tsotras) (Correct)
No context found.
A. Kumar, V. J. Tsotras and C. Falout- sos, "Designing Access Methods for bitemporal Databases", IEEE TKDE 10(1), 1998.
Real-Time Processing of Range-Monitoring - Queries In Heterogeneous (Correct)
No context found.
A. Kumar, V.J. Tsotras, and C. Faloutsos, "Designing Access Methods for Bitemporal Databases," IEEE Trans. Knowledge and Data Eng., vol. 10, no. 1, pp. 1-20, Jan.-Feb. 1998.
Processing Range-Monitoring Queries on Heterogeneous Mobile.. - Ying Cai Kien (2004) (5 citations) (Correct)
No context found.
A. Kumar, V. J. Tsotras, and C. Faloutsos. Designing access methods for bitemporal databases. IEEE TKDE, 10(1):1-- 20, 1998.
R-Trees Have Grown Everywhere - Manolopoulos, Nanopoulos.. (Correct)
No context found.
A. Kumar, V.J. Tsotras and C. Faloutsos: "Designing Access Methods for Bitemporal Databases", IEEE Transactions on Knowledge and Data Engineering, Vol.10, No.1, pp.120, 1998.
Indexing the Past, Present and Anticipated Future.. - Pelanis, Saltenis.. (2004) (Correct)
No context found.
A. Kumar, Vassilis. J. Tsotras, and C. Faloutsos. Designing Access Methods for Bitemporal Databases. TKDE 10(1): 1--20, 1998.
R-Tree Based Indexing of Now-Relative Bitemporal Data - Rasa Bliujute Christian (1998) (2 citations) (Correct)
No context found.
A. Kumar, V. J. Tsotras, and C. Faloutsos. Designing Access Methods for Bitemporal Databases. TR-3764, Dept. of Comp. Sci. University of Maryland (1997).
Efficient Querying of Constantly Evolving Data - Kalashnikov (2003) (Correct)
No context found.
Anil Kumar, Vassilis J. Tsotras, and Christos Faloutsos. Designing access methods for bitemporal databases. IEEE TKDE, 10(1):1--20, 1998.
An Experimental Performance Evaluation of.. - Jeong, Paton.. (2004) (Correct)
No context found.
A. Kumar, V.J. Tsotras, and C. Faloutsos. Designing Access Methods for Bitemporal Databases. Technical report, AT&T Bell Laboratories, 1995.
Main Memory Evaluation of Montoring Queries Over Moving - Objects Kalashnikov Prabhakar (Correct)
No context found.
Anil Kumar, Vassilis J. Tsotras, and Christos Faloutsos. Designing access methods for bitemporal databases. 10(1):1--20, 1998.
Processing Range-Monitoring Queries on Heterogeneous Mobile.. - Ying Cai Kien (2004) (5 citations) (Correct)
No context found.
A. Kumar, V. J. Tsotras, and C. Faloutsos. Designing access methods for bitemporal databases. IEEE TKDE, 10(1):1-- 20, 1998.
Spatio-temporal Access Methods - Mokbel, Ghanem, Aref (2003) (1 citation) (Correct)
No context found.
A. Kumar, V. J. Tsotras, and C. Faloutsos. Designing Access Methods for Bitemporal Databases. IEEE Trans. on Knowledge and Data Engineering, TKDE, 10(1):1--20, 1998.
Query Indexing and Velocity Constrained Indexing.. - Prabhakar, Xia.. (2002) (9 citations) (Correct)
No context found.
Anil Kumar, Vassilis J. Tsotras, and Christos Faloutsos. Designing access methods for bitemporal databases. IEEE Transactions on Knowledge and Data Engineering, 10(1):1--20, 1998.
First 50 documents Next 50
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