DocumentCode
2443576
Title
On modeling the query processing-relevant complexity of 2-D spatial objects
Author
Bryson, Ndel ; Mobolurin, Ayodele
Author_Institution
Dept. of Inf. Syst. & Anal., Howard Univ., Washington, DC, USA
Volume
2
fYear
1997
fDate
14-18 Jul 1997
Firstpage
716
Abstract
We present a conceptual framework for looking at query processing oriented complexity measures for spatial objects. We look at benefits that could result from development of such a measure. While Brinkhoff et. al. (1995) presented a complexity measure, they did not offer much theoretical justification for their choice of parameters nor for the functional form that they used
Keywords
object-oriented databases; query processing; visual databases; 2D spatial objects; conceptual framework; object decomposition; query processing-relevant complexity; spatial databases; Area measurement; Information analysis; Information systems; Moon; Object oriented databases; Query processing; Shape; Spatial databases; Spatial indexes; Testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Aerospace and Electronics Conference, 1997. NAECON 1997., Proceedings of the IEEE 1997 National
Conference_Location
Dayton, OH
Print_ISBN
0-7803-3725-5
Type
conf
DOI
10.1109/NAECON.1997.622720
Filename
622720
Link To Document