Sciweavers

14 search results - page 1 / 3
» Management and Query Processing of One-Dimensional Intervals...
Sort
View
EDBT
2000
ACM
13 years 8 months ago
Management and Query Processing of One-Dimensional Intervals with the UB-Tree
The management and query processing of one dimensional intervals is a special case of extended object handling. One dimensional intervals play an important role in temporal databa...
Robert Fenk
SSDBM
2002
IEEE
149views Database» more  SSDBM 2002»
13 years 9 months ago
A Cost Model for Interval Intersection Queries on RI-Trees
The efficient management of interval data represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tree1 ), an effi...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
DASFAA
2004
IEEE
158views Database» more  DASFAA 2004»
13 years 8 months ago
A Cost Model for Spatial Intersection Queries on RI-Trees
Abstract. The efficient management of interval sequences represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tr...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
ICDE
1998
IEEE
70views Database» more  ICDE 1998»
14 years 5 months ago
Point-Versus Interval-Based Temporal Data Models
The association of timestamps with various data items such as tuples or attribute values is fundamental to the management of time-varying information. Using intervals in timestamp...
Michael H. Böhlen, Renato Busatto, Christian ...
DKE
1998
88views more  DKE 1998»
13 years 4 months ago
Temporal Grid File: A File Structure for Interval Data
Disk I/O is a major bottleneck for query processing in database applications. This bottleneck is especially a problem for temporal databases because of their large size. Reduction...
Chiang Lee, Te-Ming Tseng