242 search results - page 4 / 49 » Joining Interval Data in Relational Databases |
CORR
2008
Springer
13 years 6 months ago
2008
Springer
Many real-world data are maintained in relational format, with different tables storing information about entities and their links or relationships. The structure (schema) of the ...
SSDBM
2003
IEEE
13 years 11 months ago
2003
IEEE
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existin...
VLDB
2000
ACM
13 years 9 months ago
2000
ACM
Modern database applications show a growing demand for efficient and dynamic management of intervals, particularly for temporal and spatial data or for constraint handling. Common...
SSD
2001
Springer
13 years 10 months ago
2001
Springer
The design of external index structures for one- and multidimensional extended objects is a long and well studied subject in basic database research. Today, more and more commercia...
VLDB
1991
ACM
13 years 9 months ago
1991
ACM
A non-equijoin of relations R and S is a band join if the join predicate requires values in the join attribute of R to fall within a speci ed band about the values in the join att...