2223 search results - page 137 / 445 » Query Optimization in an OODBMS |
120
click to vote
SIGMOD
1998
ACM
15 years 8 months ago
1998
ACM
Remote data access from disparate sources across a widearea network such as the Internet is problematic due to the unpredictable nature of the communications medium and the lack o...
164
click to vote
ICDE
2010
IEEE
15 years 10 months ago
2010
IEEE
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
168
click to vote
DPD
2006
15 years 3 months ago
2006
A common technique used to minimize I/O in data intensive applications is data declustering over parallel servers. This technique involves distributing data among several disks so...
EDBT
2000
ACM
15 years 8 months ago
2000
ACM
The paper presents Spatial Distributions Server – an analytical tool aimed at efficient creation, storing and analyzing of spatial distributions. Methods of approximation of spat...
110
click to vote
ATMOS
2008
15 years 5 months ago
2008
We present an extension of the well-known time-expanded approach for timetable information. By remodeling unimportant stations, we are able to obtain faster query times with less s...