Sciweavers

619 search results - page 122 / 124
» Query Planning in Infomaster
Sort
View
W2GIS
2004
Springer
15 years 2 months ago
Expansion-Based Algorithms for Finding Single Pair Shortest Path on Surface
Abstract. Finding single pair shortest paths on surface is a fundamental problem in various domains, like Geographic Information Systems (GIS) 3D applications, robotic path plannin...
Ke Deng, Xiaofang Zhou
ADC
2003
Springer
106views Database» more  ADC 2003»
15 years 2 months ago
Database Component Ware
Database modeling is still a job of an artisan. Due to this approach database schemata evolve by growth without any evolution plan. Finally, they cannot be examined, surveyed, con...
Bernhard Thalheim
HICSS
2002
IEEE
136views Biometrics» more  HICSS 2002»
15 years 2 months ago
Using XML to Facilitate Information Management across Multiple Local Government Agencies
The main barriers to the level of electronic data interchange required to seamlessly integrate services offered by legacy systems in an Internet environment are the need for appli...
G. M. Bryan, Joanne M. Curry, Carolyn McGregor, D....
GIS
2009
ACM
15 years 2 months ago
Data structures and intersection algorithms for 3D spatial data types
Apart from visualization tasks, three-dimensional (3D) data management features are not or only hardly available in current spatial database systems and Geographic Information Sys...
Tao Chen, Markus Schneider
73
Voted
PODS
1999
ACM
121views Database» more  PODS 1999»
15 years 1 months ago
Tracking Join and Self-Join Sizes in Limited Storage
Query optimizers rely on fast, high-quality estimates of result sizes in order to select between various join plans. Selfjoin sizes of relations provide bounds on the join size of...
Noga Alon, Phillip B. Gibbons, Yossi Matias, Mario...