505 search results - page 22 / 101 » Efficient Temporal Join Processing Using Indices |
DASFAA
2004
IEEE
13 years 11 months ago
2004
IEEE
Relational index structures, as for instance the Relational Interval Tree or the Linear Quadtree, support efficient processing of queries on top of existing object-relational datab...
TIME
1997
IEEE
13 years 11 months ago
1997
IEEE
Temporal databases provide built-in supports for efficient recording and querying of time-evolving data. In this paper, data clustering issues in temporal database environment are...
ADBIS
2007
Springer
14 years 1 months ago
2007
Springer
This paper describes a new XML compression scheme that offers both high compression ratios and short query response time. Its core is a fully reversible transform featuring substit...
FUIN
2006
13 years 7 months ago
2006
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
IEEESCC
2005
IEEE
14 years 29 days ago
2005
IEEE
The main goal of our key project, CROWN Grid, is to empower in-depth integration of resources and cooperation of researchers nationwide and worldwide. In CROWN, Information Servic...