ult of the
Morton
e of the
1adrantic
vident in
itions C5
like an
ause its
uadrants,
ed in the
points.
2 shows
does not
window.
ses with
to the y-
xity, and
are being
ites.
id 2 that
v by nine
y similar
orders.
'der out-
ed.
riation of
tains the
ween the
d on row
cial case
has been
pace. À
t to show
able than
ion of an
1 to n-d,
ies of the
arison of
as shown
order by
> search
ir query
of the n-
8. REFERENCES
Goodchild, M.F. (1989). "Tiling of Large Geographical Databases." Proceeding of "Design and
Implementation of Large Spatial Databases”. First Symposium SSD'89, Santa Babara, U.S.A.,
pp. 138-146.
Guenther, O. and A. Buchmann (1990). "Research Issues in spatial Databases." SIGMOD Record,
vol.19, no.4, December, 61-68.
Knuth, D.E. (1973). "The Art of Computer Programming. Volume III/ Sorting and Searching."
Addison-Wesley, Reading, Mas.
Lee, Y.C. and W.P. Yang (1993). "A Fast and Simple Range Search Algorithm for Point Sets."
Proceedings of the Canadian Conference on GIS - 1993, 975-987.
McCormick, B.H.; T. A. DeFanti and M.D. Brown (1987). "Visualization in Scientific Computing."
Computer Graphics, vol.21, no.6, ACM SIGMOD: New York.
Orenstein, J.A. and F.A. Manola (1988). "PROBE Spatial Data Modeling and Query Processing in
an Image Database Application." IEEE Transaction on Software Engineering, vol.14, no.5, pp.
611-629.
Yang, W.P. (1992). "A New Range Searching Algorithm for Large Point Databases." Unpublished
Masters Thesis, Department of Geodesy and Geomatics Engineering, University of New
Brunswick, Canada.
1023 1023
Z7 Z8 Z9
C7 C8 C9
C4 C5 C6 Z4 Z5 Z6
299
= Cl C2 C3 99 Z1 77 73
0 299 1023 5 Ü .99 1023
a) C-Configuration b) Z-Configuration
1023
599
H3
H2 H4
Hi
0 599 1023
c) H-Config uration
Fig.4: Variation of Query Window Configuration
103