Sciweavers

242 search results - page 5 / 49
» Joining Interval Data in Relational Databases
Sort
View
BTW
2005
Springer
108views Database» more  BTW 2005»
14 years 1 months ago
Integrating the Relational Interval Tree into IBM's DB2 Universal Database Server
: User-defined data types such as intervals require specialized access methods to be efficiently searched and queried. As database implementors cannot provide appropriate index str...
Christoph Brochhaus, Jost Enderle, Achim Schlosser...
VLDB
2005
ACM
121views Database» more  VLDB 2005»
14 years 7 months ago
Join operations in temporal databases
Joins are arguably the most important relational operators. Poor implementations are tantamount to computing the Cartesian product of the input relations. In a temporal database, t...
Dengfeng Gao, Christian S. Jensen, Richard T. Snod...
GVD
2003
151views Database» more  GVD 2003»
13 years 8 months ago
Bridging the GAP Between Relational and Native XML Storage with Staircase Join
Several mapping schemes have recently been proposed to store XML data in relational tables. Relational database systems are readily available and can handle vast amounts of data v...
Jens Teubner, Torsten Grust, Maurice van Keulen
SSD
2001
Springer
120views Database» more  SSD 2001»
13 years 12 months ago
On Multi-way Spatial Joins with Direction Predicates
Spatial joins are fundamental in spatial databases. Over the last decade, the primary focus of research has been on joins with the predicate “region intersection.” In modern da...
Hongjun Zhu, Jianwen Su, Oscar H. Ibarra
GEOINFO
2003
13 years 8 months ago
Efficient Query Processing on the Relational Quadtree
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 existing...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...