619 search results - page 108 / 124 » Query Planning in Infomaster |
119
click to vote
WEA
2007
Springer
15 years 8 months ago
2007
Springer
Many speed-up techniques for route planning in static graphs exist, only few of them are proven to work in a dynamic scenario. Most of them use preprocessed information, which has ...
111
click to vote
DOLAP
2004
ACM
15 years 7 months ago
2004
ACM
Computer system sizing involves estimating the amount of hardware resources needed to support a new workload not yet deployed in a production environment. In order to determine th...
127
click to vote
WEA
2010
Springer
15 years 7 months ago
2010
Springer
Server based route planning in road networks is now powerful enough to find quickest paths in a matter of milliseconds, even if detailed information on time-dependent travel times...
109
Voted
VLDB
1999
ACM
15 years 6 months ago
1999
ACM
In this paper, we describe our recent experiences in adding a number of object-relational extensions to the DB2 Universal Database UDB system as part of a research and developme...
164
click to vote
DASFAA
2004
IEEE
15 years 5 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...